5 citations · 27 across the 22 of their papers we have counts for
5 papers · 1 filter
Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
Keren Censor-Hillel, Orr Fischer, Ran Gelles +1
We design a deterministic compiler that makes any computation in the Congested Clique model robust to a constant fraction of adversarial crash faults. In particular, we show…
Bounded Memory in Distributed Networks
Ran Ben Basat, Keren Censor-Hillel, Yi-Jun Chang +3
The recent advent of programmable switches makes distributed algorithms readily deployable in real-world datacenter networks. However, there are still gaps between theory and pract…
Computing in a Faulty Congested Clique
Keren Censor-Hillel, Pedro Soto
We study a Faulty Congested Clique model, in which an adversary may fail nodes in the network throughout the computation. We show that any task of -bit input per node…
Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate -clique counts faster
Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams
Dell, Lapinskas and Meeks [DLM SICOMP 2022] presented a general reduction from approximate counting to decision for a class of fine-grained problems that can be viewed as hyperedge…
When MIS and Maximal Matching are Easy in the Congested Clique
Keren Censor-Hillel, Tomer Even, Maxime Flin +1
Two of the most fundamental distributed symmetry-breaking problems are that of finding a maximal independent set (MIS) and a maximal matching (MM) in a graph. It is a major open qu…