| Publication | Date of Publication | Type |
|---|
| A breezing proof of the KMW bound | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126259 | 2024-04-09 | Paper |
| A Recursive Early-Stopping Phase King Protocol | 2024-03-26 | Paper |
| Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver | 2024-03-26 | Paper |
| Optimal Clock Synchronization with Signatures | 2024-03-26 | Paper |
| Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions | 2024-03-19 | Paper |
| Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts | 2023-11-21 | Paper |
| On specifications and proofs of timed circuits | 2023-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6161057 | 2023-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875752 | 2023-02-03 | Paper |
| Near-optimal approximate shortest paths and transshipment in distributed and streaming models | 2023-02-03 | Paper |
| Distributed algorithms for low stretch spanning trees | 2023-02-03 | Paper |
| Self-stabilising Byzantine clock synchronisation is almost as easy as consensus | 2023-02-03 | Paper |
| Robust Routing Made Easy | 2022-11-04 | Paper |
| Approximate minimum directed spanning trees under congestion | 2022-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5008248 | 2021-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002766 | 2021-07-28 | Paper |
| Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models | 2021-05-27 | Paper |
| Fooling views: a new lower bound technique for distributed computations under congestion | 2021-01-22 | Paper |
| Fault Tolerant Gradient Clock Synchronization | 2021-01-20 | Paper |
| Locality of not-so-weak coloring | 2020-03-03 | Paper |
| On the Complexity of Hazard-free Circuits | 2020-02-11 | Paper |
| Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus | 2020-02-11 | Paper |
| Optimal Metastability-Containing Sorting via Parallel Prefix Computation | 2020-01-28 | Paper |
| Algebraic methods in the congested clique | 2019-11-27 | Paper |
| Near-optimal self-stabilising counting and firing squads | 2019-11-22 | Paper |
| Self-stabilizing Byzantine clock synchronization with optimal precision | 2019-11-22 | Paper |
| On the complexity of hazard-free circuits | 2019-08-22 | Paper |
| Near-optimal self-stabilising counting and firing squads | 2019-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967183 | 2019-07-03 | Paper |
| Self-stabilizing Byzantine clock synchronization with optimal precision | 2019-06-21 | Paper |
| Distributed distance computation and routing with small messages | 2019-06-20 | Paper |
| Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford | 2019-02-25 | Paper |
| Near-Optimal Distributed Maximum Flow | 2018-12-05 | Paper |
| Metastability-Containing Circuits | 2018-09-20 | Paper |
| Efficient counting with optimal resilience | 2018-08-24 | Paper |
| Efficient Counting with Optimal Resilience | 2017-09-25 | Paper |
| Searching without communicating: tradeoffs between performance and selection complexity | 2017-08-31 | Paper |
| Tight bounds for parallel randomized load balancing | 2016-05-23 | Paper |
| HEX: scaling honeycombs is easier than scaling clock trees | 2016-04-18 | Paper |
| Fast partial distance estimation and applications | 2016-03-23 | Paper |
| Towards optimal synchronous counting | 2016-03-23 | Paper |
| Algebraic methods in the congested clique | 2016-03-23 | Paper |
| Near-optimal distributed maximum flow (extended abstract) | 2016-03-23 | Paper |
| Synchronous counting and computational algorithm design | 2015-12-11 | Paper |
| MIS on trees | 2015-09-11 | Paper |
| Trade-offs between selection complexity and performance when searching the plane without communication | 2015-09-03 | Paper |
| Improved distributed steiner forest construction | 2015-09-03 | Paper |
| Fault-tolerant algorithms for tick-generation in asynchronous logic | 2015-08-14 | Paper |
| Optimal deterministic routing and sorting on the congested clique | 2015-03-02 | Paper |
| Optimal gradient clock synchronization in dynamic networks | 2015-03-02 | Paper |
| Efficient distributed source detection with limited bandwidth | 2015-03-02 | Paper |
| Early-deciding consensus is expensive | 2015-03-02 | Paper |
| Fast routing table construction using small messages | 2014-08-07 | Paper |
| Tight bounds for clock synchronization | 2014-07-23 | Paper |
| Tight bounds for parallel randomized load balancing | 2014-06-05 | Paper |
| Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip | 2014-02-13 | Paper |
| Distributed minimum dominating set approximations in restricted families of graphs | 2013-08-26 | Paper |
| “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting | 2013-03-13 | Paper |
| Coupling molecular dynamics and continua with weak constraints | 2012-08-11 | Paper |
| Distributed algorithms for sensor networks | 2012-06-04 | Paper |
| Minimum Dominating Set Approximation in Graphs of Bounded Arboricity | 2010-09-10 | Paper |
| Tight bounds for clock synchronization | 2010-07-14 | Paper |
| Leveraging Linial’s Locality Limit | 2008-11-20 | Paper |
