| 2026 | PODC | Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes. | Arnold Filtser, Orr Fischer |
| 2026 | PODC | The Task Completion Problem and its Application to Crash-Resilient Computation. | Orr Fischer, Ran Gelles |
| 2025 | PODC | All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free. | Orr Fischer, Merav Parter |
| 2025 | SIROCCO | Pointer Chasing with Unlimited Interaction. | Orr Fischer, Rotem Oshman, Adi Rosn, Tal Roth |
| 2024 | ICLR | Optimal Sample Complexity of Contrastive Learning. | Noga Alon, Dmitrii Avdiukhin, Dor Elboim, Orr Fischer, Grigory Yaroslavtsev |
| 2023 | AAAI | Tree Learning: Optimal Sample Complexity and Algorithms. | Dmitrii Avdiukhin, Grigory Yaroslavtsev, Danny Vainstein, Orr Fischer, Sauman Das, Faraz Mirza |
| 2023 | PODC | Distributed CONGEST Algorithms against Mobile Adversaries. | Orr Fischer, Merav Parter |
| 2022 | PODC | Massively Parallel Computation in a Heterogeneous Regime. | Orr Fischer, Adi Horowitz, Rotem Oshman |
| 2022 | SIROCCO | Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs. | Yoav Ben Shimon, Orr Fischer, Rotem Oshman |
| 2021 | OPODIS | Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators. | Orr Fischer, Rotem Oshman, Dana Shamir |
| 2021 | PODC | Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. | Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf |
| 2018 | PODC | Distributed Uniformity Testing. | Orr Fischer, Uri Meir, Rotem Oshman |
| 2018 | SPAA | Possibilities and Impossibilities for Distributed Subgraph Detection. | Orr Fischer, Tzlil Gonen, Fabian Kuhn, Rotem Oshman |
| 2017 | PODC | On the Multiparty Communication Complexity of Testing Triangle-Freeness. | Orr Fischer, Shay Gershtein, Rotem Oshman |
| 2016 | STOC | A lower bound for the distributed Lovsz local lemma. | Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiinen, Joel Rybicki, Jukka Suomela, Jara Uitto |
| 2016 | SIROCCO | Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity. | Orr Fischer, Rotem Oshman, Uri Zwick |