5 citations · 10 across the 4 of their papers we have counts for
5 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…
Superlinear Lower Bounds for Distributed Subgraph Detection
Orr Fischer, Tzlil Gonen, Rotem Oshman
In the distributed subgraph-freeness problem, we are given a graph , and asked to determine whether the network graph contains as a subgraph or not. Subgraph-freeness is an…
On The Multiparty Communication Complexity of Testing Triangle-Freeness
Orr Fischer, Shay Gershtein, Rotem Oshman
In this paper we initiate the study of property testing in simultaneous and non-simultaneous multi-party communication complexity, focusing on testing triangle-freeness in graphs.…
Distributed Property Testing for Subgraph-Freeness Revisited
Orr Fischer, Tzlil Gonen, Rotem Oshman
In the subgraph-freeness problem, we are given a constant-size graph , and wish to determine whether the network contains as a subgraph or not. The \emph{property-testing} r…