Dean Leitersdorf

Orcid: 0000-0002-2775-9207

According to our database1, Dean Leitersdorf authored at least 21 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Deterministic near-optimal distributed listing of cliques.
Distributed Comput., December, 2024

Fast Broadcast in Highly Connected Networks.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Improved All-Pairs Approximate Shortest Paths in Congested Clique.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023
AritPIM: High-Throughput In-Memory Arithmetic.
IEEE Trans. Emerg. Top. Comput., 2023

The Relationship between APSP and Matrix Multiplication in Congested Clique.
Bull. EATCS, 2023

Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model.
CoRR, 2023

2022
Fast Distributed Algorithms via Sparsity Awareness.
PhD thesis, 2022

Quantum Distributed Algorithms for Detection of Cliques.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Fast approximate shortest paths in the congested clique.
Distributed Comput., 2021

Distance Computations in the Hybrid Network Model via Oracle Simulations.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

On Sparsity Awareness in Distributed Computations.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Tight Distributed Listing of Cliques.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Constant-Round Spanners and Shortest Paths in Congested Clique and MPC.
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.
Theor. Comput. Sci., 2020

Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

On Distributed Listing of Cliques.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019
PODC 2019 Review.
SIGACT News, 2019

Hardness of Distributed Optimization.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018
Sparse Matrix Multiplication with Bandwidth Restricted All-to-All Communication.
CoRR, 2018

2016
'MASTerful' Matchmaking in Service Transactions: Inferred Abilities, Needs and Interests versus Activity Histories.
Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems, 2016


  Loading...