| A lower bound for the distributed Lovász local lemma S Brandt, O Fischer, J Hirvonen, B Keller, T Lempiäinen, J Rybicki, ... Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 127 | 2016 |
| Possibilities and impossibilities for distributed subgraph detection O Fischer, T Gonen, F Kuhn, R Oshman Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 44 | 2018 |
| Three notes on distributed property testing G Even, O Fischer, P Fraigniaud, T Gonen, R Levi, M Medina, ... 31st International Symposium on Distributed Computing (DISC 2017), 2017 | 44 | 2017 |
| Sublinear-time distributed algorithms for detecting small cliques and even cycles T Eden, N Fiat, O Fischer, F Kuhn, R Oshman Distributed Computing, 1-28, 2022 | 32 | 2022 |
| Fast distributed algorithms for girth, cycles and small subgraphs K Censor-Hillel, O Fischer, T Gonen, FL Gall, D Leitersdorf, R Oshman arXiv preprint arXiv:2101.07590, 2021 | 17 | 2021 |
| Distributed uniformity testing O Fischer, U Meir, R Oshman Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 15 | 2018 |
| Quantum distributed algorithms for detection of cliques K Censor-Hillel, O Fischer, FL Gall, D Leitersdorf, R Oshman arXiv preprint arXiv:2201.03000, 2022 | 14 | 2022 |
| A distributed algorithm for directed minimum-weight spanning tree O Fischer, R Oshman Distributed Computing 36 (1), 57-87, 2023 | 13 | 2023 |
| Distributed property testing for subgraph-freeness revisited O Fischer, T Gonen, R Oshman arXiv preprint arXiv:1705.04033, 2017 | 12 | 2017 |
| Constant-round spanners and shortest paths in Congested Clique and MPC M Dory, O Fischer, S Khoury, D Leitersdorf Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021 | 11 | 2021 |
| Public vs. private randomness in simultaneous multi-party communication complexity O Fischer, R Oshman, U Zwick Structural Information and Communication Complexity: 23rd International …, 2016 | 11 | 2016 |
| On the multiparty communication complexity of testing triangle-freeness O Fischer, S Gershtein, R Oshman Proceedings of the ACM Symposium on Principles of Distributed Computing, 111-120, 2017 | 9 | 2017 |
| Explicit space-time tradeoffs for proof labeling schemes in graphs with small separators O Fischer, R Oshman, D Shamir 25th International Conference on Principles of Distributed Systems (OPODIS 2021), 2022 | 2 | 2022 |
| Public vs. private randomness in simultaneous multi-party communication complexity O Fischer, R Oshman, U Zwick Theoretical Computer Science 810, 72-81, 2020 | 2 | 2020 |
| Superlinear lower bounds for distributed subgraph detection O Fischer, T Gonen, R Oshman arXiv preprint arXiv:1711.06920, 2017 | 2 | 2017 |
| Optimal Sample Complexity of Contrastive Learning N Alon, D Avdiukhin, D Elboim, O Fischer, G Yaroslavtsev arXiv preprint arXiv:2312.00379, 2023 | 1 | 2023 |
| Tree learning: optimal sample complexity and algorithms D Avdiukhin, G Yaroslavtsev, D Vainstein, O Fischer, S Das, F Mirza Proceedings of the AAAI Conference on Artificial Intelligence 37 (6), 6701-6708, 2023 | 1 | 2023 |
| Proof labeling schemes for reachability-related problems in directed graphs Y Ben Shimon, O Fischer, R Oshman International Colloquium on Structural Information and Communication …, 2022 | 1 | 2022 |
| Distributed CONGEST Algorithms against Mobile Adversaries O Fischer, M Parter Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing …, 2023 | | 2023 |
| Tree Learning: Optimal Algorithms and Sample Complexity D Avdiukhin, G Yaroslavtsev, D Vainstein, O Fischer, S Das, F Mirza arXiv preprint arXiv:2302.04492, 2023 | | 2023 |
