default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDean Leitersdorf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Yi-Jun Chang
, Oren Hecht, Dean Leitersdorf, Philipp Schneider:
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. PODC 2024: 380-390- [c14]Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf:
Improved All-Pairs Approximate Shortest Paths in Congested Clique. PODC 2024: 391-400 - [c13]Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf:
Fast Broadcast in Highly Connected Networks. SPAA 2024: 331-343 - [i15]Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf:
Fast Broadcast in Highly Connected Networks. CoRR abs/2404.12930 (2024) - [i14]Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf:
Improved All-Pairs Approximate Shortest Paths in Congested Clique. CoRR abs/2405.02695 (2024) - 2023
- [j5]Dean Leitersdorf:
The Relationship between APSP and Matrix Multiplication in Congested Clique. Bull. EATCS 141 (2023) - [j4]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): 720-735 (2023) - [i13]Yi-Jun Chang, Oren Hecht, Dean Leitersdorf:
Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model. CoRR abs/2304.06317 (2023) - [i12]Yi-Jun Chang, Oren Hecht, Dean Leitersdorf, Philipp Schneider:
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. CoRR abs/2311.09548 (2023) - 2022
- [b1]Dean Leitersdorf:
Fast Distributed Algorithms via Sparsity Awareness. Technion - Israel Institute of Technology, Israel, 2022 - [c12]Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Quantum Distributed Algorithms for Detection of Cliques. ITCS 2022: 35:1-35:25 - [c11]Keren Censor-Hillel, Dean Leitersdorf, David Vulakh:
Deterministic Near-Optimal Distributed Listing of Cliques. PODC 2022: 271-280 - [i11]Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Quantum Distributed Algorithms for Detection of Cliques. CoRR abs/2201.03000 (2022) - [i10]Keren Censor-Hillel, Dean Leitersdorf, David Vulakh:
Deterministic Near-Optimal Distributed Listing of Cliques. CoRR abs/2205.09245 (2022) - [i9]Orian Leitersdorf, Dean Leitersdorf, Jonathan Gal, Mor M. Dahan, Ronny Ronen, Shahar Kvatinsky:
AritPIM: High-Throughput In-Memory Arithmetic. CoRR abs/2206.04218 (2022) - 2021
- [j3]Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf:
Fast approximate shortest paths in the congested clique. Distributed Comput. 34(6): 463-487 (2021) - [c10]Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf:
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. PODC 2021: 223-233 - [c9]Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf:
Tight Distributed Listing of Cliques. SODA 2021: 2878-2891 - [c8]Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin:
On Sparsity Awareness in Distributed Computations. SPAA 2021: 151-161 - [c7]Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin:
Distance Computations in the Hybrid Network Model via Oracle Simulations. STACS 2021: 21:1-21:19 - [i8]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 abs/2101.07590 (2021) - [i7]Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin:
On Sparsity Awareness in Distributed Computations. CoRR abs/2105.06068 (2021) - 2020
- [j2]Keren Censor-Hillel, Dean Leitersdorf, Elia Turner:
Sparse matrix multiplication and triangle listing in the Congested Clique model. Theor. Comput. Sci. 809: 45-60 (2020) - [c6]Keren Censor-Hillel, François Le Gall, Dean Leitersdorf:
On Distributed Listing of Cliques. PODC 2020: 474-482 - [c5]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: 33:1-33:17 - [i6]Keren Censor-Hillel, François Le Gall, Dean Leitersdorf:
On Distributed Listing of Cliques. CoRR abs/2007.05316 (2020) - [i5]Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin:
Distance Computations in the Hybrid Network Model via Oracle Simulations. CoRR abs/2010.13831 (2020) - [i4]Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf:
Tight Distributed Listing of Cliques. CoRR abs/2011.07405 (2020)
2010 – 2019
- 2019
- [j1]Naama Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf:
PODC 2019 Review. SIGACT News 50(4): 33-45 (2019) - [c4]Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf:
Fast Approximate Shortest Paths in the Congested Clique. PODC 2019: 74-83 - [c3]Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz:
Hardness of Distributed Optimization. PODC 2019: 238-247 - [i3]Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf:
Fast Approximate Shortest Paths in the Congested Clique. CoRR abs/1903.05956 (2019) - [i2]Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz:
Hardness of Distributed Optimization. CoRR abs/1905.10284 (2019) - 2018
- [c2]Keren Censor-Hillel, Dean Leitersdorf, Elia Turner:
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model. OPODIS 2018: 4:1-4:17 - [i1]Keren Censor-Hillel, Dean Leitersdorf, Elia Turner:
Sparse Matrix Multiplication with Bandwidth Restricted All-to-All Communication. CoRR abs/1802.04789 (2018) - 2016
- [c1]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: 1644-1655
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
