'MASTerful' Matchmaking in Service Transactions: Inferred Abilities, Needs and Interests versus Activity Histories. - Hyunggu Jung; Victoria Bellotti; Afsaneh Doryab; Dean Leitersdorf; Jiawei Chen 003; Benjamin V. Hanrahan; Sooyeon Lee; Daniel Turner; Anind K. Dey; John M. Carroll 001 (CHI, 2016)

Sparse Matrix Multiplication with Bandwidth Restricted All-to-All Communication. - Keren Censor-Hillel; Dean Leitersdorf; Elia Turner (CoRR, 2018)

Hardness of Distributed Optimization. - Nir Bachrach; Keren Censor-Hillel; Michal Dory; Yuval Efron; Dean Leitersdorf; Ami Paz (PODC, 2019)

PODC 2019 Review. - Naama Ben-David; Yi-Jun Chang; Michal Dory; Dean Leitersdorf (SIGACT News, 2019)

On Distributed Listing of Cliques. - Keren Censor-Hillel; François Le Gall; Dean Leitersdorf (PODC, 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 (DISC, 2020)

Sparse matrix multiplication and triangle listing in the Congested Clique model. - Keren Censor-Hillel; Dean Leitersdorf; Elia Turner (Theor. Comput. Sci., 2020)

Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. - Michal Dory; Orr Fischer; Seri Khoury; Dean Leitersdorf (PODC, 2021)

Tight Distributed Listing of Cliques. - Keren Censor-Hillel; Yi-Jun Chang; François Le Gall; Dean Leitersdorf (SODA, 2021)

On Sparsity Awareness in Distributed Computations. - Keren Censor-Hillel; Dean Leitersdorf; Volodymyr Polosukhin (SPAA, 2021)

Distance Computations in the Hybrid Network Model via Oracle Simulations. - Keren Censor-Hillel; Dean Leitersdorf; Volodymyr Polosukhin (STACS, 2021)

Fast approximate shortest paths in the congested clique. - Keren Censor-Hillel; Michal Dory; Janne H. Korhonen; Dean Leitersdorf (Distributed Comput., 2021)

Quantum Distributed Algorithms for Detection of Cliques. - Keren Censor-Hillel; Orr Fischer; François Le Gall; Dean Leitersdorf; Rotem Oshman (ITCS, 2022)

Fast Distributed Algorithms via Sparsity Awareness. - Dean Leitersdorf (2022)

Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model. - Yi-Jun Chang; Oren Hecht; Dean Leitersdorf (CoRR, 2023)

The Relationship between APSP and Matrix Multiplication in Congested Clique. - Dean Leitersdorf (Bull. EATCS, 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)

Improved All-Pairs Approximate Shortest Paths in Congested Clique. - Hong Duc Bui; Shashwat Chandra; Yi-Jun Chang; Michal Dory; Dean Leitersdorf (PODC, 2024)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. - Yi-Jun Chang; Oren Hecht; Dean Leitersdorf; Philipp Schneider (PODC, 2024)

Fast Broadcast in Highly Connected Networks. - Shashwat Chandra; Yi-Jun Chang; Michal Dory; Mohsen Ghaffari 001; Dean Leitersdorf (SPAA, 2024)

Deterministic near-optimal distributed listing of cliques. - Keren Censor-Hillel; Dean Leitersdorf; David Vulakh (Distributed Comput., 2024)

Bounded Memory in Distributed Networks. - Ran Ben Basat; Keren Censor-Hillel; Yi-Jun Chang; Wenchen Han; Dean Leitersdorf; Gregory Schwartzman (SPAA, 2025)