Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Hardness of Distributed Optimization., , , , , and . PODC, page 238-247. ACM, (2019)Quantum Distributed Algorithms for Detection of Cliques., , , , and . ITCS, volume 215 of LIPIcs, page 35:1-35:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Fast Approximate Shortest Paths in the Congested Clique., , , and . PODC, page 74-83. ACM, (2019)Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model., , , and . PODC, page 380-390. ACM, (2024)Tight Distributed Listing of Cliques., , , and . CoRR, (2020)Sparse Matrix Multiplication with Bandwidth Restricted All-to-All Communication., , and . CoRR, (2018)Fast Distributed Algorithms via Sparsity Awareness.. Technion - Israel Institute of Technology, Israel, (2022)Distance Computations in the Hybrid Network Model via Oracle Simulations., , and . STACS, volume 187 of LIPIcs, page 21:1-21:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Constant-Round Spanners and Shortest Paths in Congested Clique and MPC., , , and . PODC, page 223-233. ACM, (2021)Deterministic Near-Optimal Distributed Listing of Cliques., , and . PODC, page 271-280. ACM, (2022)