5 citations · 7 across the 2 of their papers we have counts for
6 papers
Quantum Distributed Algorithms for Detection of Cliques
Keren Censor-Hillel, Orr Fischer, François Le Gall +2
The possibilities offered by quantum computing have drawn attention in the distributed computing community recently, with several breakthrough results showing quantum distributed a…
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
Keren Censor-Hillel, Orr Fischer, Tzlil Gonen +3
In this paper we give fast distributed graph algorithms for detecting and listing small subgraphs, and for computing or approximating the girth. Our algorithms improve upon the sta…
Distance Computations in the Hybrid Network Model via Oracle Simulations
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
The Hybrid network model was introduced in [Augustine et al., SODA '20] for laying down a theoretical foundation for networks which combine two possible modes of communication: One…
Hardness of Distributed Optimization
Nir Bachrach, Keren Censor-Hillel, Michal Dory +3
This paper studies lower bounds for fundamental optimization problems in the CONGEST model. We show that solving problems exactly in this model can be a hard task, by providing $\t…
Fast Approximate Shortest Paths in the Congested Clique
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen +1
We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: -- A -approximation for all-pairs shortest pat…
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model
Keren Censor-Hillel, Dean Leitersdorf, Elia Turner
We multiply two matrices over semirings in the Congested Clique model, where fully connected nodes communicate synchronously using -bit messages,…