Dean Leitersdorf

According to our database, Dean Leitersdorf authored at least 19 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

AritPIM: High-Throughput In-Memory Arithmetic.

Orian Leitersdorf, Dean Leitersdorf, Jonathan Gal, Mor M. Dahan, Ronny Ronen, Shahar Kvatinsky

IEEE Trans. Emerg. Top. Comput., 2023

The Relationship between APSP and Matrix Multiplication in Congested Clique.

Dean Leitersdorf

Bull. EATCS, 2023

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model.

Yi-Jun Chang, Oren Hecht, Dean Leitersdorf, Philipp Schneider

CoRR, 2023

Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model.

Yi-Jun Chang, Oren Hecht, Dean Leitersdorf

CoRR, 2023

2022

Fast Distributed Algorithms via Sparsity Awareness.

Dean Leitersdorf

PhD thesis, 2022

Deterministic Near-Optimal Distributed Listing of Cliques.

Keren Censor-Hillel, Dean Leitersdorf, David Vulakh

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Quantum Distributed Algorithms for Detection of Cliques.

Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Fast approximate shortest paths in the congested clique.

Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf

Distributed Comput., 2021

Distance Computations in the Hybrid Network Model via Oracle Simulations.

Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

On Sparsity Awareness in Distributed Computations.

Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Tight Distributed Listing of Cliques.

Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Constant-Round Spanners and Shortest Paths in Congested Clique and MPC.

Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020

Sparse matrix multiplication and triangle listing in the Congested Clique model.

Keren Censor-Hillel, Dean Leitersdorf, Elia Turner

Theor. Comput. Sci., 2020

Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs.

Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman

Proceedings of the 34th International Symposium on Distributed Computing, 2020

On Distributed Listing of Cliques.

Keren Censor-Hillel, François Le Gall, Dean Leitersdorf

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019

PODC 2019 Review.

Naama Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf

SIGACT News, 2019

Hardness of Distributed Optimization.

Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018

Sparse Matrix Multiplication with Bandwidth Restricted All-to-All Communication.

Keren Censor-Hillel, Dean Leitersdorf, Elia Turner

CoRR, 2018

2016

'MASTerful' Matchmaking in Service Transactions: Inferred Abilities, Needs and Interests versus Activity Histories.

Hyunggu Jung, Victoria Bellotti, Afsaneh Doryab, Dean Leitersdorf, Jiawei Chen, Benjamin V. Hanrahan, Sooyeon Lee, Daniel Turner, Anind K. Dey, John M. Carroll

Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems, 2016