Dean Leitersdorf

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