Dean Leitersdorf

MaRDI QIDQ2064056zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Deterministic near-optimal distributed listing of cliques Distributed Computing	2025-01-08	Paper
scientific article; zbMATH DE number 7829267 (Why is no real title available?)	2024-04-09	Paper
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing	2024-03-26	Paper
Deterministic Near-Optimal Distributed Listing of Cliques Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing	2024-03-26	Paper
scientific article; zbMATH DE number 7800886 (Why is no real title available?)	2024-02-06	Paper
scientific article; zbMATH DE number 7788509 (Why is no real title available?)	2024-01-15	Paper
Fast distributed algorithms for girth, cycles and small subgraphs	2023-11-02	Paper
Sparse matrix multiplication and triangle listing in the congested clique model	2022-07-21	Paper
Fast approximate shortest paths in the congested clique Distributed Computing	2022-01-04	Paper
On Distributed Listing of Cliques Proceedings of the 39th Symposium on Principles of Distributed Computing	2021-03-15	Paper
Fast Approximate Shortest Paths in the Congested Clique Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing	2021-01-20	Paper
Hardness of Distributed Optimization Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing	2021-01-20	Paper
Sparse matrix multiplication and triangle listing in the congested clique model Theoretical Computer Science	2020-01-29	Paper

Research outcomes over time

This page was built for person: Dean Leitersdorf