| Publication | Date of Publication | Type |
|---|
| Near-optimal deterministic network decomposition and ruling set, and improved MIS | 2026-06-23 | Paper |
| Parallel, distributed, and quantum exact single-source shortest paths with negative edge weights | 2026-05-26 | Paper |
Local distributed rounding: generalized to MIS, matching, set cover, and beyond
ACM Transactions on Algorithms | 2025-11-03 | Paper |
| Work-efficient parallel derandomization. I: Chernoff-like concentrations via pairwise independence | 2025-08-15 | Paper |
| Deterministic low-diameter decompositions for weighted graphs and distributed and parallel applications | 2025-08-15 | Paper |
| Noisy k-means++ revisited | 2025-01-06 | Paper |
Deterministic Distributed Algorithms and Measurable Combinatorics on Δ-Regular Forests
(available as arXiv preprint) | 2025-01-01 | Paper |
| Fully dynamic consistent k-center clustering | 2024-11-28 | Paper |
| A nearly tight analysis of greedy \(k\)-means++ | 2024-05-14 | Paper |
| Improved distributed network decomposition, hitting sets, and spanners, via derandomization | 2024-05-14 | Paper |
| Local distributed rounding: generalized to MIS, matching, set cover, and beyond | 2024-05-14 | Paper |
| A simple deterministic distributed low-diameter clustering | 2024-05-14 | Paper |
| Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances | 2024-05-08 | Paper |
| Faster deterministic distributed MIS and approximate matching | 2024-05-08 | Paper |
scientific article; zbMATH DE number 7829261 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
The Randomized Local Computation Complexity of the Lovász Local Lemma
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
The Landscape of Distributed Complexities on Trees and Beyond
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
scientific article; zbMATH DE number 7788511 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Undirected (1+ <i>𝜀</i> )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Improved MPC algorithms for MIS, matching, and coloring on trees and beyond | 2023-11-02 | Paper |
| Deterministic Distributed algorithms and Descriptive Combinatorics on \Delta-regular trees | 2022-04-20 | Paper |
| On Homomorphism Graphs | 2021-11-05 | Paper |
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Improved Local Computation Algorithm for Set Cover via Sparsification
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lov\'asz Local Lemma
(available as arXiv preprint) | 2020-06-08 | Paper |
