| Publication | Date of Publication | Type |
|---|
Noisy \(k\)-means++ revisited
| 2025-01-06 | 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 |
Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances
| 2024-05-08 | Paper |
scientific article; zbMATH DE number 7829261 (Why is no real title available?)
| 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 |
Measurable Tilings by Abelian Group Actions
IMRN. International Mathematics Research Notices | 2024-01-25 | Paper |
scientific article; zbMATH DE number 7788511 (Why is no real title available?)
| 2024-01-15 | Paper |
Undirected (1+ 𝜀 )-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 |
Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics
Advances in Mathematics | 2023-09-21 | Paper |
Deterministic Distributed algorithms and Descriptive Combinatorics on \Delta-regular trees
| 2022-04-20 | Paper |
Cut distance identifying graphon parameters over weak* limits
Journal of Combinatorial Theory. Series A | 2022-04-01 | Paper |
On Homomorphism Graphs
| 2021-11-05 | Paper |
Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics
| 2021-03-25 | 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 |
Relating the cut distance and the weak* topology for graphons
Journal of Combinatorial Theory. Series B | 2021-02-03 | Paper |
Polylogarithmic-time deterministic network decomposition and distributed derandomization
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
A version of the Loebl-Komlós-Sós conjecture for skew trees
European Journal of Combinatorics | 2020-06-16 | Paper |
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lov\'asz Local Lemma
| 2020-06-08 | Paper |
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization
| 2019-07-25 | Paper |
A Local Approach to the Erdös--Sós Conjecture
SIAM Journal on Discrete Mathematics | 2019-04-24 | Paper |
Cut distance identifying graphon parameters over weak* limits
| 2018-09-11 | Paper |
A skew version of the Loebl-Komlós-Sós conjecture
| 2018-01-18 | Paper |
Online Locality Meets Distributed Quantum Computing
| N/A | Paper |
