Orr Fischer

According to our database, Orr Fischer authored at least 20 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

A distributed algorithm for directed minimum-weight spanning tree.

Orr Fischer, Rotem Oshman

Distributed Comput., March, 2023

Optimal Sample Complexity of Contrastive Learning.

Noga Alon, Dmitrii Avdiukhin, Dor Elboim, Orr Fischer, Grigory Yaroslavtsev

CoRR, 2023

Tree Learning: Optimal Algorithms and Sample Complexity.

Dmitrii Avdiukhin, Grigory Yaroslavtsev, Danny Vainstein, Orr Fischer, Sauman Das, Faraz Mirza

CoRR, 2023

Distributed CONGEST Algorithms against Mobile Adversaries.

Orr Fischer, Merav Parter

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Tree Learning: Optimal Sample Complexity and Algorithms.

Dmitrii Avdiukhin, Grigory Yaroslavtsev, Danny Vainstein, Orr Fischer, Sauman Das, Faraz Mirza

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Sublinear-time distributed algorithms for detecting small cliques and even cycles.

Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman

Distributed Comput., 2022

Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs.

Yoav Ben Shimon, Orr Fischer, Rotem Oshman

Proceedings of the Structural Information and Communication Complexity, 2022

Massively Parallel Computation in a Heterogeneous Regime.

Orr Fischer, Adi Horowitz, Rotem Oshman

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Quantum Distributed Algorithms for Detection of Cliques.

Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Constant-Round Spanners and Shortest Paths in Congested Clique and MPC.

Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators.

Orr Fischer, Rotem Oshman, Dana Shamir

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020

Public vs. private randomness in simultaneous multi-party communication complexity.

Orr Fischer, Rotem Oshman, Uri Zwick

Theor. Comput. Sci., 2020

Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs.

Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman

Proceedings of the 34th International Symposium on Distributed Computing, 2020

2018

Possibilities and Impossibilities for Distributed Subgraph Detection.

Orr Fischer, Tzlil Gonen, Fabian Kuhn, Rotem Oshman

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Distributed Uniformity Testing.

Orr Fischer, Uri Meir, Rotem Oshman

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017

Superlinear Lower Bounds for Distributed Subgraph Detection.

Orr Fischer, Tzlil Gonen, Rotem Oshman

CoRR, 2017

Distributed Property Testing for Subgraph-Freeness Revisited.

Orr Fischer, Tzlil Gonen, Rotem Oshman

CoRR, 2017

Three Notes on Distributed Property Testing.

Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca

Proceedings of the 31st International Symposium on Distributed Computing, 2017

On the Multiparty Communication Complexity of Testing Triangle-Freeness.

Orr Fischer, Shay Gershtein, Rotem Oshman

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016

A lower bound for the distributed Lovász local lemma.

Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, Jara Uitto

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016