Dean Leitersdorf
Dean Leitersdorf
Verified email at cs.technion.ac.il
Title
Cited by
Cited by
Year
Fast approximate shortest paths in the congested clique
K Censor-Hillel, M Dory, JH Korhonen, D Leitersdorf
Distributed Computing, 1-25, 2020
292020
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
222019
Sparse matrix multiplication with bandwidth restricted all-to-all communication
K Censor-Hillel, D Leitersdorf, E Turner
CoRR, abs/1802.04789, 2018
19*2018
'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
172016
On distributed listing of cliques
K Censor-Hillel, FL Gall, D Leitersdorf
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
92020
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
62021
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
32021
Distance Computations in the Hybrid Network Model via Oracle Simulations
K Censor-Hillel, D Leitersdorf, V Polosukhin
arXiv preprint arXiv:2010.13831, 2020
32020
On Sparsity Awareness in Distributed Computations
K Censor-Hillel, D Leitersdorf, V Polosukhin
arXiv preprint arXiv:2105.06068, 2021
12021
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
2021
PODC 2019 Review
N Ben-David, YJ Chang, M Dory, D Leitersdorf
ACM SIGACT News 50 (4), 33-45, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–11