A lower bound for the distributed Lovász local lemma. - Sebastian Brandt 002; Orr Fischer; Juho Hirvonen; Barbara Keller; Tuomo Lempiäinen; Joel Rybicki; Jukka Suomela; Jara Uitto (STOC, 2016)

On the Multiparty Communication Complexity of Testing Triangle-Freeness. - Orr Fischer; Shay Gershtein; Rotem Oshman (PODC, 2017)

Three Notes on Distributed Property Testing. - Guy Even; Orr Fischer; Pierre Fraigniaud; Tzlil Gonen; Reut Levi; Moti Medina; Pedro Montealegre 001; Dennis Olivetti; Rotem Oshman; Ivan Rapaport; Ioan Todinca (DISC, 2017)

Distributed Property Testing for Subgraph-Freeness Revisited. - Orr Fischer; Tzlil Gonen; Rotem Oshman (CoRR, 2017)

Superlinear Lower Bounds for Distributed Subgraph Detection. - Orr Fischer; Tzlil Gonen; Rotem Oshman (CoRR, 2017)

Distributed Uniformity Testing. - Orr Fischer; Uri Meir; Rotem Oshman (PODC, 2018)

Possibilities and Impossibilities for Distributed Subgraph Detection. - Orr Fischer; Tzlil Gonen; Fabian Kuhn; Rotem Oshman (SPAA, 2018)

Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. - Keren Censor-Hillel; Orr Fischer; Tzlil Gonen; François Le Gall; Dean Leitersdorf; Rotem Oshman (DISC, 2020)

Public vs. private randomness in simultaneous multi-party communication complexity. - Orr Fischer; Rotem Oshman; Uri Zwick (Theor. Comput. Sci., 2020)

Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators. - Orr Fischer; Rotem Oshman; Dana Shamir (OPODIS, 2021)

Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. - Michal Dory; Orr Fischer; Seri Khoury; Dean Leitersdorf (PODC, 2021)

Quantum Distributed Algorithms for Detection of Cliques. - Keren Censor-Hillel; Orr Fischer; François Le Gall; Dean Leitersdorf; Rotem Oshman (ITCS, 2022)

Massively Parallel Computation in a Heterogeneous Regime. - Orr Fischer; Adi Horowitz; Rotem Oshman (PODC, 2022)

Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs. - Yoav Ben Shimon; Orr Fischer; Rotem Oshman (SIROCCO, 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)

Tree Learning: Optimal Sample Complexity and Algorithms. - Dmitrii Avdiukhin; Grigory Yaroslavtsev; Danny Vainstein; Orr Fischer; Sauman Das; Faraz Mirza (AAAI, 2023)

Distributed CONGEST Algorithms against Mobile Adversaries. - Orr Fischer; Merav Parter (PODC, 2023)

Tree Learning: Optimal Algorithms and Sample Complexity. - Dmitrii Avdiukhin; Grigory Yaroslavtsev; Danny Vainstein; Orr Fischer; Sauman Das; Faraz Mirza (CoRR, 2023)

A distributed algorithm for directed minimum-weight spanning tree. - Orr Fischer; Rotem Oshman (Distributed Comput., 2023)

Optimal Sample Complexity of Contrastive Learning. - Noga Alon; Dmitrii Avdiukhin; Dor Elboim; Orr Fischer; Grigory Yaroslavtsev (ICLR, 2024)

Embedding Dimension of Contrastive Learning and k-Nearest Neighbors. - Dmitrii Avdiukhin; Vaggos Chatziafratis; Orr Fischer; Grigory Yaroslavtsev (NeurIPS, 2024)

All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free. - Orr Fischer; Merav Parter (PODC, 2025)

Pointer Chasing with Unlimited Interaction. - Orr Fischer; Rotem Oshman; Adi Rosén; Tal Roth (SIROCCO, 2025)

Depth-Width tradeoffs in Algorithmic Reasoning of Graph Tasks with Transformers. - Gilad Yehudai; Clayton Sanford; Maya Bechler-Speicher; Orr Fischer; Ran Gilad-Bachrach; Amir Globerson (CoRR, 2025)