Dean Leitersdorf

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 35

Top Topics

Highly Connected

Minimal Surface

Information Dissemination

Matrix Multiplication

Top Venues

Publications

Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf
Fast Broadcast in Highly Connected Networks. CoRR (2024)
Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf
Fast Broadcast in Highly Connected Networks. SPAA (2024)
Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
Improved All-Pairs Approximate Shortest Paths in Congested Clique. PODC (2024)
Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
Improved All-Pairs Approximate Shortest Paths in Congested Clique. CoRR (2024)
Yi-Jun Chang, Oren Hecht, Dean Leitersdorf, Philipp Schneider
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. PODC (2024)
Yi-Jun Chang, Oren Hecht, Dean Leitersdorf, Philipp Schneider
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. CoRR (2023)
Yi-Jun Chang, Oren Hecht, Dean Leitersdorf
Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model. CoRR (2023)
Dean Leitersdorf
The Relationship between APSP and Matrix Multiplication in Congested Clique. Bull. EATCS 141 (2023)
Orian Leitersdorf, Dean Leitersdorf, Jonathan Gal, Mor M. Dahan, Ronny Ronen, Shahar Kvatinsky
AritPIM: High-Throughput In-Memory Arithmetic. IEEE Trans. Emerg. Top. Comput. 11 (3) (2023)
Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman
Quantum Distributed Algorithms for Detection of Cliques. CoRR (2022)
Keren Censor-Hillel, Dean Leitersdorf, David Vulakh
Deterministic Near-Optimal Distributed Listing of Cliques. CoRR (2022)
Orian Leitersdorf, Dean Leitersdorf, Jonathan Gal, Mor M. Dahan, Ronny Ronen, Shahar Kvatinsky
AritPIM: High-Throughput In-Memory Arithmetic. CoRR (2022)
Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman
Quantum Distributed Algorithms for Detection of Cliques. ITCS (2022)
Keren Censor-Hillel, Dean Leitersdorf, David Vulakh
Deterministic Near-Optimal Distributed Listing of Cliques. PODC (2022)
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
On Sparsity Awareness in Distributed Computations. CoRR (2021)
Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. CoRR (2021)
Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. PODC (2021)
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Fast approximate shortest paths in the congested clique. Distributed Comput. 34 (6) (2021)
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
On Sparsity Awareness in Distributed Computations. SPAA (2021)
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
Distance Computations in the Hybrid Network Model via Oracle Simulations. STACS (2021)
Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf
Tight Distributed Listing of Cliques. SODA (2021)
Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. DISC (2020)
Keren Censor-Hillel, Dean Leitersdorf, Elia Turner
Sparse matrix multiplication and triangle listing in the Congested Clique model. Theor. Comput. Sci. 809 (2020)
Keren Censor-Hillel, François Le Gall, Dean Leitersdorf
On Distributed Listing of Cliques. PODC (2020)
Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf
Tight Distributed Listing of Cliques. CoRR (2020)
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
Distance Computations in the Hybrid Network Model via Oracle Simulations. CoRR (2020)
Keren Censor-Hillel, François Le Gall, Dean Leitersdorf
On Distributed Listing of Cliques. CoRR (2020)
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Fast Approximate Shortest Paths in the Congested Clique. PODC (2019)
Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz
Hardness of Distributed Optimization. PODC (2019)
Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz
Hardness of Distributed Optimization. CoRR (2019)
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Fast Approximate Shortest Paths in the Congested Clique. CoRR (2019)
Naama Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
PODC 2019 Review. SIGACT News 50 (4) (2019)
Keren Censor-Hillel, Dean Leitersdorf, Elia Turner
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model. OPODIS (2018)
Keren Censor-Hillel, Dean Leitersdorf, Elia Turner
Sparse Matrix Multiplication with Bandwidth Restricted All-to-All Communication. CoRR (2018)
Hyunggu Jung, Victoria Bellotti, Afsaneh Doryab, Dean Leitersdorf, Jiawei Chen, Benjamin V. Hanrahan, Sooyeon Lee, Daniel Turner, Anind K. Dey, John M. Carroll
'MASTerful' Matchmaking in Service Transactions: Inferred Abilities, Needs and Interests versus Activity Histories. CHI (2016)