| Classification of distributed binary labeling problems A Balliu, S Brandt, Y Efron, J Hirvonen, Y Maus, D Olivetti, J Suomela arXiv preprint arXiv:1911.13294, 2019 | 55 | 2019 |
| Hardness of distributed optimization N Bacrach, K Censor-Hillel, M Dory, Y Efron, D Leitersdorf, A Paz Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 49 | 2019 |
| Distributed weighted min-cut in nearly-optimal time M Dory, Y Efron, S Mukhopadhyay, D Nanongkai Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 27 | 2021 |
| Unitary Complexity and the Uhlmann Transformation Problem J Bostanci, Y Efron, T Metger, A Poremba, L Qian, H Yuen arXiv preprint arXiv:2306.13073, 2023 | 24 | 2023 |
| Nearly optimal communication and query complexity of bipartite matching J Blikstad, J Van Den Brand, Y Efron, S Mukhopadhyay, D Nanongkai 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 16 | 2022 |
| Cut query algorithms with star contraction S Apers, Y Efron, P Gawrychowski, T Lee, S Mukhopadhyay, ... 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 15 | 2022 |
| Distributed distance approximation B Ancona, K Censor-Hillel, M Dalirrooyfard, Y Efron, VV Williams arXiv preprint arXiv:2011.05066, 2020 | 14 | 2020 |
| Beyond alice and bob: Improved inapproximability for maximum independent set in CONGEST Y Efron, O Grossman, S Khoury Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 5 | 2020 |
| Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs L Yohananov, Y Efron, E Yaakobi IEEE Transactions on Information Theory 66 (7), 4089-4103, 2020 | 4 | 2020 |
| Brief Announcement: Classification of Distributed Binary Labeling Problems A Balliu, S Brandt, Y Efron, J Hirvonen, Y Maus, D Olivetti, J Suomela Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 1 | 2020 |
| Double and triple node-erasure-correcting codes over graphs L Yohananov, Y Efron, E Yaakobi 2019 IEEE International Symposium on Information Theory (ISIT), 1582-1586, 2019 | 1 | 2019 |
| Dynamically Available Common Subset Y Efron, EN Tas Cryptology ePrint Archive, 2025 | | 2025 |
| A Simple Algorithm for Dynamic Carpooling with Recourse Y Efron, S Patel, C Stein 2025 Symposium on Simplicity in Algorithms (SOSA), 196-201, 2025 | | 2025 |
| Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement D Collins, Y Efron, J Komatovic arXiv preprint arXiv:2410.12121, 2024 | | 2024 |
| How Much Public Randomness Do Modern Consensus Protocols Need? J Bonneau, B Bünz, M Christ, Y Efron Cryptology ePrint Archive, 2024 | | 2024 |
| Good things come to those who wait: Dishonest-Majority Coin-Flipping Requires Delay Functions J Bonneau, B Bünz, M Christ, Y Efron Cryptology ePrint Archive, 2024 | | 2024 |
| New Advances in Distributed Optimization and Distance Computation Y Efron, K Censor-Hillel Computer Science Department, Technion, 2020 | | 2020 |
