| Publication | Date of Publication | Type |
|---|
| Near-optimal distributed dominating set in bounded arboricity graphs | 2025-01-08 | Paper |
| A distributed palette sparsification theorem | 2024-11-28 | Paper |
| Simplified and space-optimal semi-streaming \((2+\varepsilon)\)-approximate matching | 2024-08-26 | Paper |
| Improved distributed network decomposition, hitting sets, and spanners, via derandomization | 2024-05-14 | Paper |
| A nearly time-optimal distributed approximation of minimum cost \(k\)-edge-connected spanning subgraph | 2024-05-14 | Paper |
| Local distributed rounding: generalized to MIS, matching, set cover, and beyond | 2024-05-14 | Paper |
| Faster deterministic distributed MIS and approximate matching | 2024-05-08 | Paper |
| Low-Congestion Shortcuts for Graphs Excluding Dense Minors | 2024-03-26 | Paper |
| Strong-Diameter Network Decomposition | 2024-03-26 | Paper |
| Node and Edge Averaged Complexities of Local Graph Problems | 2024-03-26 | Paper |
| Universally-Optimal Distributed Exact Min-Cut | 2024-03-26 | Paper |
| Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs | 2024-03-26 | Paper |
| Distributed MIS with Low Energy and Time Complexities | 2024-03-26 | Paper |
| A Near-Optimal Deterministic Distributed Synchronizer | 2024-03-26 | Paper |
| Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions | 2024-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147430 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147431 | 2024-01-15 | Paper |
| Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality | 2023-12-08 | Paper |
| Node and edge averaged complexities of local graph problems | 2023-11-21 | Paper |
| Hop-constrained oblivious routing | 2023-11-14 | Paper |
| Improved MPC algorithms for MIS, matching, and coloring on trees and beyond | 2023-11-02 | Paper |
| Simple and near-optimal distributed coloring for sparse graphs | 2023-02-03 | Paper |
| Sublogarithmic distributed algorithms for Lovász local lemma, and the complexity hierarchy | 2023-02-03 | Paper |
| Near-optimal distributed DFS in planar graphs | 2023-02-03 | Paper |
| Distributed algorithms for low stretch spanning trees | 2023-02-03 | Paper |
| Improved distributed degree splitting and edge coloring | 2023-02-03 | Paper |
| Improved network decompositions using small messages with applications on MIS, neighborhood covers, and beyond | 2023-02-03 | Paper |
| A Cut-Matching Game for Constant-Hop Expanders | 2022-11-21 | Paper |
| Network Decomposition and Distributed Derandomization (Invited Paper) | 2022-09-01 | Paper |
| Distributed MST and broadcast with fewer messages, and faster gossiping | 2022-07-21 | Paper |
| Derandomizing distributed algorithms with small messages: spanners and dominating set | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090923 | 2022-07-21 | Paper |
| Distributed set cover approximation: primal-dual with optimal locality | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090918 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092346 | 2022-07-21 | Paper |
| Improved distributed \(\Delta\)-coloring | 2021-09-06 | Paper |
| A tight analysis of the parallel undecided-state dynamics with two colors | 2021-08-04 | Paper |
| Massively Parallel Algorithms for Minimum Cut | 2021-03-15 | Paper |
| Faster Algorithms for Edge Connectivity via Random 2-Out Contractions | 2021-02-02 | Paper |
| On the Complexity of Distributed Splitting Problems | 2021-01-20 | Paper |
| On the Use of Randomness in Local Distributed Graph Algorithms | 2021-01-20 | Paper |
| Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph | 2021-01-20 | Paper |
| The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation | 2021-01-20 | Paper |
| Polylogarithmic-time deterministic network decomposition and distributed derandomization | 2021-01-19 | Paper |
| Improved distributed degree splitting and edge coloring | 2020-06-15 | Paper |
| Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation | 2019-10-15 | Paper |
| Distributed Maximal Independent Set using Small Messages | 2019-10-15 | Paper |
| Congested Clique Algorithms for the Minimum Cut Problem | 2019-09-19 | Paper |
| Nearly-tight analysis for 2-choice and 3-majority consensus dynamics | 2019-09-19 | Paper |
| Improved massively parallel computation algorithms for MIS, matching, and vertex cover | 2019-09-19 | Paper |
| Improved distributed delta-coloring | 2019-09-19 | Paper |
| Improved distributed algorithms for exact shortest paths | 2019-08-22 | Paper |
| Deterministic distributed edge-coloring with fewer colors | 2019-08-22 | Paper |
| Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization | 2019-07-25 | Paper |
| Broadcast throughput in radio networks: routing vs. network coding | 2019-06-20 | Paper |
| A new perspective on vertex connectivity | 2019-06-20 | Paper |
| Near optimal leader election in multi-hop radio networks | 2019-05-15 | Paper |
| Near-optimal distributed maximum flow | 2018-12-05 | Paper |
| Tight Bounds on Vertex Connectivity Under Sampling | 2018-11-05 | Paper |
| How to discreetly spread a rumor in a crowd | 2018-08-16 | Paper |
| An Improved Distributed Algorithm for Maximal Independent Set | 2018-07-16 | Paper |
| Distributed degree splitting, edge coloring, and orientations | 2018-07-16 | Paper |
| Distributed algorithms for planar networks. II: Low-congestion shortcuts, MST, and Min-Cut | 2018-07-16 | Paper |
| Random contractions and sampling for hypergraph and hedge connectivity | 2018-07-16 | Paper |
| Leader election in unreliable radio networks | 2017-12-19 | Paper |
| Distributed MST and routing in almost mixing time | 2017-10-11 | Paper |
| Distributed approximation of maximum independent set and maximum matching | 2017-10-11 | Paper |
| Distributed MIS via all-to-all communication | 2017-10-11 | Paper |
| Tight bounds on vertex connectivity under vertex sampling | 2017-10-05 | Paper |
| A polylogarithmic gossip algorithm for plurality consensus | 2017-09-29 | Paper |
| Distributed algorithms for planar networks. I: Planar embedding | 2017-09-29 | Paper |
| MST in log-star rounds of congested clique | 2017-09-29 | Paper |
| On the complexity of local distributed graph problems | 2017-08-17 | Paper |
| Near-optimal scheduling of distributed algorithms | 2016-03-23 | Paper |
| Near-optimal distributed maximum flow (extended abstract) | 2016-03-23 | Paper |
| Distributed house-hunting in ant colonies | 2016-03-23 | Paper |
| Randomized broadcast in radio networks with collision detection | 2016-01-06 | Paper |
| Distributed Broadcast Revisited: Towards Universal Optimality | 2015-11-04 | Paper |
| Multi-message broadcast with abstract MAC layers and unreliable links | 2015-09-03 | Paper |
| Distributed connectivity decomposition | 2015-09-03 | Paper |
| Optimal error rates for interactive coding. I: Adaptivity and other settings | 2015-06-26 | Paper |
| Maximal independent sets in multichannel radio networks | 2015-03-02 | Paper |
| The cost of radio network broadcast for different models of unreliable links | 2015-03-02 | Paper |
| Randomized broadcast in radio networks with collision detection | 2015-03-02 | Paper |
| Distributed minimum cut approximation | 2014-09-29 | Paper |
| Near-optimal distributed approximation of minimum-weight connected dominating set | 2014-07-01 | Paper |
| Bounds on contention management in radio networks | 2013-03-13 | Paper |
| Leader election using loneliness detection | 2013-02-04 | Paper |
| Leader election using loneliness detection | 2011-10-28 | Paper |
