| Publication | Date of Publication | Type |
|---|
| Deterministic near-optimal distributed listing of cliques | 2025-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126262 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126264 | 2024-04-09 | Paper |
| Distributed computations in fully-defective networks | 2024-03-26 | Paper |
| Deterministic Near-Optimal Distributed Listing of Cliques | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147429 | 2024-01-15 | Paper |
| Locally checkable labelings with small messages | 2023-12-08 | Paper |
| Distributed computations in fully-defective networks | 2023-11-21 | Paper |
| Correction to: ``Distributed computations in fully-defective networks | 2023-11-21 | Paper |
| Fast distributed algorithms for girth, cycles and small subgraphs | 2023-11-02 | Paper |
| A Generic Undo Support for State-Based CRDTs | 2023-02-07 | Paper |
| Quadratic and near-quadratic lower bounds for the CONGEST model | 2023-02-03 | Paper |
| Derandomizing local distributed algorithms under bandwidth restrictions | 2023-02-03 | Paper |
| Erasure correction for noisy radio networks | 2023-02-03 | Paper |
| Fast Distributed Approximation for Max-Cut | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091074 | 2022-07-21 | Paper |
| The Sparsest Additive Spanner via Multiple Weighted BFS Trees | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092335 | 2022-07-21 | Paper |
| Distributed Reconfiguration of Maximal Independent Sets | 2022-07-21 | Paper |
| Near-optimal scheduling in the congested clique | 2022-03-22 | Paper |
| Smaller Cuts, Higher Lower Bounds | 2022-02-22 | Paper |
| Fast approximate shortest paths in the congested clique | 2022-01-04 | Paper |
| Distributed Spanner Approximation | 2021-06-29 | Paper |
| Making Asynchronous Distributed Computations Robust to Channel Noise | 2021-06-15 | Paper |
| On Distributed Listing of Cliques | 2021-03-15 | Paper |
| Distributed Approximation on Power Graphs | 2021-03-15 | Paper |
| Fooling views: a new lower bound technique for distributed computations under congestion | 2021-01-22 | Paper |
| Fast Approximate Shortest Paths in the Congested Clique | 2021-01-20 | Paper |
| Hardness of Distributed Optimization | 2021-01-20 | Paper |
| The sparsest additive spanner via multiple weighted BFS trees | 2020-09-17 | Paper |
| Fast Distributed Approximation for TAP and 2-Edge-Connectivity | 2020-07-30 | Paper |
| Derandomizing local distributed algorithms under bandwidth restrictions | 2020-06-15 | Paper |
| Distributed reconfiguration of maximal independent sets | 2020-06-09 | Paper |
| Fast distributed approximation for TAP and 2-edge-connectivity | 2020-04-23 | Paper |
| Approximate proof-labeling schemes | 2020-02-13 | Paper |
| Sparse matrix multiplication and triangle listing in the congested clique model | 2020-01-29 | Paper |
| Making asynchronous distributed computations robust to noise | 2019-11-27 | Paper |
| Algebraic methods in the congested clique | 2019-11-27 | Paper |
| Distributed Spanner Approximation | 2019-09-19 | Paper |
| Distributed connectivity decomposition | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633853 | 2019-05-06 | Paper |
| Fast distributed algorithms for testing graph properties | 2019-03-21 | Paper |
| Erratum | 2019-02-25 | Paper |
| On fast and robust information spreading in the vertex-congest model | 2018-11-29 | Paper |
| Tight Bounds on Vertex Connectivity Under Sampling | 2018-11-05 | Paper |
| Computing in additive networks with bounded-information codes | 2018-08-24 | Paper |
| Near-linear lower bounds for distributed distance computations, even in sparse networks | 2018-08-16 | Paper |
| Distributed construction of purely additive spanners | 2018-08-16 | Paper |
| Fast distributed algorithms for testing graph properties | 2018-08-16 | Paper |
| Are Lock-Free Concurrent Algorithms Practically Wait-Free? | 2018-08-02 | Paper |
| Distributed construction of purely additive spanners | 2018-06-01 | Paper |
| A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds | 2018-05-17 | Paper |
| Approximate proof-labeling schemes | 2018-04-12 | Paper |
| Broadcasting in Noisy Radio Networks | 2017-10-11 | Paper |
| Distributed Approximation of Maximum Independent Set and Maximum Matching | 2017-10-11 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| Tight Bounds on Vertex Connectivity Under Vertex Sampling | 2017-10-05 | Paper |
| A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds | 2017-09-29 | Paper |
| Optimal Dynamic Distributed MIS | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365054 | 2017-09-29 | Paper |
| Rumor Spreading with No Dependence on Conductance | 2017-02-15 | Paper |
| Concurrent Use of Write-Once Memory | 2016-12-01 | Paper |
| Lower Bounds for Restricted-Use Objects | 2016-06-16 | Paper |
| Algebraic methods in the congested clique | 2016-03-23 | Paper |
| The one-out-of-\(k\) retrieval problem and linear network coding | 2016-03-11 | Paper |
| On fast and robust information spreading in the vertex-congest model | 2016-01-08 | Paper |
| The One-Out-of-k Retrieval Problem and Linear Network Coding | 2016-01-07 | Paper |
| Tight bounds for asynchronous randomized consensus | 2015-11-11 | Paper |
| Bounded-contention coding for the additive network model | 2015-10-20 | Paper |
| Optimal-time adaptive strong renaming, with applications to counting | 2015-09-11 | Paper |
| Structuring unreliable radio networks | 2015-09-11 | Paper |
| Order optimal information spreading using algebraic gossip | 2015-09-11 | Paper |
| Distributed connectivity decomposition | 2015-09-03 | Paper |
| Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity | 2015-08-14 | Paper |
| Are Lock-Free Concurrent Algorithms Practically Wait-Free? | 2015-06-26 | Paper |
| Partial information spreading with application to distributed maximum coverage | 2015-03-02 | Paper |
| Lower bounds for randomized consensus under a weak adversary | 2014-12-12 | Paper |
| Randomized consensus in expected O(n log n) individual work | 2014-12-12 | Paper |
| Faster than optimal snapshots (for a while) | 2014-12-05 | Paper |
| Approximate shared-memory counting despite a strong adversary | 2014-11-18 | Paper |
| Tight Bounds for Asynchronous Renaming | 2014-09-12 | Paper |
| Max registers, counters, and monotone circuits | 2014-07-23 | Paper |
| Structuring unreliable radio networks | 2014-07-11 | Paper |
| Global computation in a poorly connected world | 2014-05-13 | Paper |
| Polylogarithmic concurrent data structures from monotone circuits | 2014-02-17 | Paper |
| Order optimal information spreading using algebraic gossip | 2013-08-26 | Paper |
| Fast Information Spreading in Graphs with Large Weak Conductance | 2013-03-19 | Paper |
| Bounded-Contention Coding for Wireless Networks in the High SNR Regime | 2013-03-13 | Paper |
| Combining shared-coin algorithms | 2012-03-07 | Paper |
| Lower Bounds for Randomized Consensus under a Weak Adversary | 2011-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549610 | 2009-01-05 | Paper |
| The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels | 2008-12-21 | Paper |
