| Fast approximate shortest paths in the congested clique K Censor-Hillel, M Dory, JH Korhonen, D Leitersdorf Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 62 | 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 |
| Sparse matrix multiplication with bandwidth restricted all-to-all communication K Censor-Hillel, D Leitersdorf, E Turner CoRR, abs/1802.04789, 2018 | 39* | 2018 |
| On distributed listing of cliques K Censor-Hillel, FL Gall, D Leitersdorf Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 25 | 2020 |
| Tight distributed listing of cliques K Censor-Hillel, YJ Chang, FL Gall, D Leitersdorf Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 22 | 2021 |
| 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 | 21 | 2021 |
| Quantum distributed algorithms for detection of cliques K Censor-Hillel, O Fischer, FL Gall, D Leitersdorf, R Oshman arXiv preprint arXiv:2201.03000, 2022 | 20 | 2022 |
| 'Masterful'matchmaking in service transactions: Inferred abilities, needs and interests versus activity histories H Jung, V Bellotti, A Doryab, D Leitersdorf, J Chen, BV Hanrahan, S Lee, ... Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems …, 2016 | 20 | 2016 |
| Distance computations in the hybrid network model via oracle simulations K Censor-Hillel, D Leitersdorf, V Polosukhin arXiv preprint arXiv:2010.13831, 2020 | 17 | 2020 |
| AritPIM: High-throughput in-memory arithmetic O Leitersdorf, D Leitersdorf, J Gal, M Dahan, R Ronen, S Kvatinsky IEEE Transactions on Emerging Topics in Computing 11 (3), 720-735, 2023 | 16 | 2023 |
| 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 | 16 | 2021 |
| On sparsity awareness in distributed computations K Censor-Hillel, D Leitersdorf, V Polosukhin Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 13 | 2021 |
| Deterministic near-optimal distributed listing of cliques K Censor-Hillel, D Leitersdorf, D Vulakh Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022 | 9 | 2022 |
| Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model YJ Chang, O Hecht, D Leitersdorf, P Schneider Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing …, 2024 | 2 | 2024 |
| Improved All-Pairs Approximate Shortest Paths in Congested Clique HD Bui, S Chandra, YJ Chang, M Dory, D Leitersdorf arXiv preprint arXiv:2405.02695, 2024 | | 2024 |
| Fast Broadcast in Highly Connected Networks S Chandra, YJ Chang, M Dory, M Ghaffari, D Leitersdorf arXiv preprint arXiv:2404.12930, 2024 | | 2024 |
| The Relationship between APSP and Matrix Multiplication in Congested Clique D Leitersdorf Bulletin of EATCS 141 (3), 2023 | | 2023 |
| Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model YJ Chang, O Hecht, D Leitersdorf arXiv preprint arXiv:2304.06317, 2023 | | 2023 |
| 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) M Bläser, B Monmege Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2021 | | 2021 |
| 34th International Symposium on Distributed Computing: DISC 2020, October 12-16, 2020, Virtual Conference H Attiya Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2020 | | 2020 |
Keren Censor-HillelDepartment of Computer Science, TechnionVerified email at cs.technion.ac.il
