Obserwuj
Dean Leitersdorf
Dean Leitersdorf
Zweryfikowany adres z cs.technion.ac.il
Tytuł
Cytowane przez
Cytowane przez
Rok
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
522019
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
442019
Sparse matrix multiplication with bandwidth restricted all-to-all communication
K Censor-Hillel, D Leitersdorf, E Turner
CoRR, abs/1802.04789, 2018
30*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
212016
On distributed listing of cliques
K Censor-Hillel, FL Gall, D Leitersdorf
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
192020
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
182021
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
172021
Distance computations in the hybrid network model via oracle simulations
K Censor-Hillel, D Leitersdorf, V Polosukhin
arXiv preprint arXiv:2010.13831, 2020
172020
Quantum distributed algorithms for detection of cliques
K Censor-Hillel, O Fischer, FL Gall, D Leitersdorf, R Oshman
arXiv preprint arXiv:2201.03000, 2022
142022
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
112021
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, 2023
102023
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
102021
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
42022
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
YJ Chang, O Hecht, D Leitersdorf, P Schneider
arXiv preprint arXiv:2311.09548, 2023
2023
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
PODC 2019 Review
N Ben-David, YJ Chang, M Dory, D Leitersdorf
ACM SIGACT News 50 (4), 33-45, 2019
2019
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–17