| Publication | Date of Publication | Type |
|---|
| Distributed Symmetry Breaking on Power Graphs via Sparsification | 2024-03-26 | Paper |
| Massively Parallel Correlation Clustering in Bounded Arboricity Graphs | 2023-12-08 | Paper |
| Efficient CONGEST Algorithms for the Lovasz Local Lemma | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083432 | 2023-12-08 | Paper |
| Deterministic (1+ 𝜀 )-approximate maximum matching with poly(1/ 𝜀 ) passes in the semi-streaming model and beyond | 2023-12-08 | Paper |
| Improved distributed degree splitting and edge coloring | 2023-02-03 | Paper |
| Distributed Recoloring | 2022-07-21 | Paper |
| A tight lower bound for semi-synchronous collaborative grid exploration | 2022-07-21 | Paper |
| Fine-grained Lower Bounds on Cops and Robbers | 2021-08-04 | Paper |
| Navigating an Infinite Space with Unreliable Movements | 2021-02-02 | Paper |
| A tight lower bound for semi-synchronous collaborative grid exploration | 2021-01-22 | Paper |
| On the Complexity of Distributed Splitting Problems | 2021-01-20 | Paper |
| A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma | 2021-01-20 | Paper |
| The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation | 2021-01-20 | Paper |
| Massively Parallel Computation of Matching and MIS in Sparse Graphs | 2021-01-20 | Paper |
| Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory | 2020-12-15 | Paper |
| A tight lower bound for the capture time of the cops and robbers game | 2020-09-03 | Paper |
| Improved distributed degree splitting and edge coloring | 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 | 2020-02-06 | Paper |
| Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma | 2019-12-02 | Paper |
| Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation | 2019-10-15 | Paper |
| Deterministic distributed edge-coloring with fewer colors | 2019-08-22 | Paper |
| Randomness vs. time in anonymous networks | 2018-08-24 | Paper |
| Exploring an Infinite Space with Finite Memory Scouts | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608064 | 2018-03-15 | Paper |
| A lower bound for the distributed Lovász local lemma | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363800 | 2017-09-29 | Paper |
| Dynamic networks of finite state machines | 2016-12-01 | Paper |
| On competitive recommendations | 2016-02-26 | Paper |
| Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond | 2016-01-08 | Paper |
| How many ants does it take to find the food? | 2015-12-11 | Paper |
| Ignorant vs. Anonymous Recommendations | 2015-11-19 | Paper |
| How Many Ants Does It Take to Find the Food? | 2014-08-07 | Paper |
| Solving the ANTS Problem with Asynchronous Finite State Machines | 2014-07-01 | Paper |
| On Competitive Recommendations | 2013-11-06 | Paper |
| A Local 2-Approximation Algorithm for the Vertex Cover Problem | 2009-11-19 | Paper |
