| Publication | Date of Publication | Type |
|---|
A \((3 + \varepsilon)\)-approximate correlation clustering algorithm in dynamic streams
| 2024-11-28 | Paper |
Optimal deterministic massively parallel connectivity on forests
| 2024-05-14 | Paper |
Sinkless orientation made simple
| 2024-05-14 | Paper |
Distributed Symmetry Breaking on Power Graphs via Sparsification
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Deterministic (1+ 𝜀 )-approximate maximum matching with poly(1/ 𝜀 ) passes in the semi-streaming model and beyond
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
scientific article; zbMATH DE number 7774301 (Why is no real title available?)
| 2023-12-08 | Paper |
Efficient CONGEST Algorithms for the Lovasz Local Lemma
| 2023-12-08 | Paper |
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs
| 2023-12-08 | Paper |
Tight bounds for deterministic high-dimensional grid exploration
| 2023-11-02 | Paper |
Brief announcement: Efficient load-balancing through distributed token dropping
| 2023-11-02 | Paper |
Improved distributed degree splitting and edge coloring
| 2023-02-03 | Paper |
A tight lower bound for semi-synchronous collaborative grid exploration
| 2022-07-21 | Paper |
Distributed recoloring
| 2022-07-21 | Paper |
Fine-grained Lower Bounds on Cops and Robbers
| 2021-08-04 | Paper |
Navigating an Infinite Space with Unreliable Movements
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
A tight lower bound for semi-synchronous collaborative grid exploration
Distributed Computing | 2021-01-22 | Paper |
On the Complexity of Distributed Splitting Problems
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Massively Parallel Computation of Matching and MIS in Sparse Graphs
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory
Theoretical Computer Science | 2020-12-15 | Paper |
A tight lower bound for the capture time of the cops and robbers game
Theoretical Computer Science | 2020-09-03 | Paper |
Improved distributed degree splitting and edge coloring
Distributed Computing | 2020-06-15 | Paper |
A tight lower bound for the capture time of the cops and robbers game
| 2020-05-27 | Paper |
Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory
| 2020-03-03 | Paper |
Dynamic networks of finite state machines
Theoretical Computer Science | 2020-02-06 | Paper |
Distributed edge coloring and a special case of the constructive Lovász local lemma
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Deterministic distributed edge-coloring with fewer colors
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Randomness vs. time in anonymous networks
| 2018-08-24 | Paper |
Exploring an infinite space with finite memory scouts
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
scientific article; zbMATH DE number 6850477 (Why is no real title available?)
| 2018-03-15 | Paper |
scientific article; zbMATH DE number 6784996 (Why is no real title available?)
| 2017-09-29 | Paper |
A lower bound for the distributed Lovász local lemma
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Dynamic networks of finite state machines
Lecture Notes in Computer Science | 2016-12-01 | Paper |
On competitive recommendations
Theoretical Computer Science | 2016-02-26 | Paper |
Lower bounds for the capture time: linear, quadratic, and beyond
Structural Information and Communication Complexity | 2016-01-08 | Paper |
How many ants does it take to find the food?
Theoretical Computer Science | 2015-12-11 | Paper |
Ignorant vs. anonymous recommendations
Algorithms - ESA 2015 | 2015-11-19 | Paper |
How many ants does it take to find the food?
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Solving the ANTS problem with asynchronous finite state machines
Automata, Languages, and Programming | 2014-07-01 | Paper |
On competitive recommendations
Lecture Notes in Computer Science | 2013-11-06 | Paper |
A Local 2-Approximation Algorithm for the Vertex Cover Problem
Lecture Notes in Computer Science | 2009-11-19 | Paper |
