92 citations · 170 across the 35 of their papers we have counts for
3 papers · 2 filters
Near-Optimal Resilient Labeling Schemes
Keren Censor-Hillel, Einav Huberman
Labeling schemes are a prevalent paradigm in various computing settings. In such schemes, an oracle is given an input graph and produces a label for each of its nodes, enabling the…
Fast Approximate Counting of Cycles
Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams
We consider the problem of approximate counting of triangles and longer fixed length cycles in directed graphs. For triangles, Tětek [ICALP'22] gave an algorithm that returns a $(1…
Faster Cycle Detection in the Congested Clique
Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams
We provide a fast distributed algorithm for detecting -cycles in the \textsf{Congested Clique} model, whose running time decreases as the number of -cycles in the graph incre…