| Publication | Date of Publication | Type |
|---|
| Fault-tolerant spanners against bounded-degree edge failures: linearly more faults, almost for free | 2024-11-28 | Paper |
| Fully dynamic consistent \(k\)-center clustering | 2024-11-28 | Paper |
| Universally-optimal distributed shortest paths and transshipment via graph-based \(\ell_1\)-oblivious routing | 2024-07-19 | Paper |
| Improved distributed network decomposition, hitting sets, and spanners, via derandomization | 2024-05-14 | Paper |
| Interactive coding with small memory | 2024-05-14 | Paper |
| A simple deterministic distributed low-diameter clustering | 2024-05-14 | Paper |
| Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances | 2024-05-08 | Paper |
| Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast | 2024-05-08 | Paper |
| Low-Congestion Shortcuts for Graphs Excluding Dense Minors | 2024-03-26 | Paper |
| Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver | 2024-03-26 | Paper |
| Sparse Semi-Oblivious Routing: Few Random Paths Suffice | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147247 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147430 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6061683 | 2023-12-08 | Paper |
| Undirected (1+ đ )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms | 2023-12-08 | Paper |
| Circuits resilient to short-circuit errors | 2023-12-08 | Paper |
| Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality | 2023-12-08 | Paper |
| Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts | 2023-11-21 | Paper |
| Hop-constrained oblivious routing | 2023-11-14 | Paper |
| Universally-optimal distributed algorithms for known topologies | 2023-11-14 | Paper |
| Tree embeddings for hop-constrained network design | 2023-11-14 | Paper |
| Efficient Linear and Affine Codes for Correcting Insertions/Deletions | 2023-06-14 | Paper |
| Erasure correction for noisy radio networks | 2023-02-03 | Paper |
| Computation-Aware Data Aggregation. | 2023-02-03 | Paper |
| Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound | 2022-12-08 | Paper |
| A Cut-Matching Game for Constant-Hop Expanders | 2022-11-21 | Paper |
| Allocate-On-Use Space Complexity of Shared-Memory Algorithms | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090925 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092349 | 2022-07-21 | Paper |
| Optimally Resilient Codes for List-Decoding From Insertions and Deletions | 2022-02-17 | Paper |
| Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002755 | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002843 | 2021-07-28 | Paper |
| Synchronization Strings and Codes for Insertions and DeletionsâA Survey | 2021-07-23 | Paper |
| Making Asynchronous Distributed Computations Robust to Channel Noise | 2021-06-15 | Paper |
| Low-congestion shortcuts without embedding | 2021-03-12 | Paper |
| Optimally resilient codes for list-decoding from insertions and deletions | 2021-01-19 | Paper |
| Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes | 2020-09-28 | Paper |
| Near-linear time insertion-deletion codes and (1+ Δ )-approximating edit distance via indexing | 2020-01-30 | Paper |
| Making asynchronous distributed computations robust to noise | 2019-11-27 | Paper |
| Reliable communication over highly connected noisy networks | 2019-11-27 | Paper |
| Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets | 2019-10-15 | Paper |
| Round- and Message-Optimal Distributed Graph Algorithms | 2019-09-19 | Paper |
| Minor Excluded Network Families Admit Fast Distributed Algorithms | 2019-09-19 | Paper |
| Optimal Gossip Algorithms for Exact and Approximate Quantile Computations | 2019-09-19 | Paper |
| Synchronization strings: explicit constructions, local decoding, and applications | 2019-08-22 | Paper |
| Explicit binary tree codes with polylogarithmic size alphabet | 2019-08-22 | Paper |
| Broadcast Throughput in Radio Networks: Routing vs. Network Coding | 2019-06-20 | Paper |
| Near Optimal Leader Election in Multi-Hop Radio Networks | 2019-05-15 | Paper |
| Simple, Fast and Deterministic Gossip and Rumor Spreading | 2019-05-15 | Paper |
| Parallel Algorithms and Concentration Bounds for the LovĂĄsz Local Lemma via Witness DAGs | 2018-11-12 | Paper |
| Tight Bounds on Vertex Connectivity Under Sampling | 2018-11-05 | Paper |
| Rank-Balanced Trees | 2018-10-30 | Paper |
| Explicit Capacity Approaching Coding for Interactive Communication | 2018-09-19 | Paper |
| Optimal strategies for patrolling fences | 2018-09-18 | Paper |
| Near-optimal low-congestion shortcuts on bounded parameter graphs | 2018-08-16 | Paper |
| Simple, Fast and Deterministic Gossip and Rumor Spreading | 2018-08-02 | Paper |
| Constant-Rate Coding for Multiparty Interactive Communication Is Impossible | 2018-08-02 | Paper |
| Analyzing Network Coding (Gossip) Made Easy | 2018-08-02 | Paper |
| Towards Optimal Deterministic Coding for Interactive Communication | 2018-07-16 | Paper |
| Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut | 2018-07-16 | Paper |
| Parallel Algorithms and Concentration Bounds for the LovĂĄsz Local Lemma via Witness DAGs | 2018-07-16 | Paper |
| Bridging the Capacity Gap Between Interactive and One-Way Communication | 2018-07-16 | Paper |
| Synchronization Strings: List Decoding for Insertions and Deletions | 2018-02-23 | Paper |
| Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication | 2018-01-17 | Paper |
| Broadcasting in Noisy Radio Networks | 2017-10-11 | Paper |
| Capacity of Interactive Communication over Erasure Channels and Channels with Feedback | 2017-10-05 | Paper |
| Tight Bounds on Vertex Connectivity Under Vertex Sampling | 2017-10-05 | Paper |
| Constant-rate coding for multiparty interactive communication is impossible | 2017-09-29 | Paper |
| Reliable Communication over Highly Connected Noisy Networks | 2017-09-29 | Paper |
| Distributed Algorithms for Planar Networks I | 2017-09-29 | Paper |
| Low-Congestion Shortcuts without Embedding | 2017-09-29 | Paper |
| A Faster Distributed Radio Broadcast Primitive | 2017-09-29 | Paper |
| Communication with Partial Noiseless Feedback | 2017-08-31 | Paper |
| Capacity of Interactive Communication over Erasure Channels and Channels with Feedback | 2017-08-18 | Paper |
| Synchronization strings | 2017-08-17 | Paper |
| Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback | 2017-05-19 | Paper |
| Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback | 2017-04-28 | Paper |
| Rumor Spreading with No Dependence on Conductance | 2017-02-15 | Paper |
| Discovery through gossip | 2016-06-10 | Paper |
| Distributed resource discovery in sub-logarithmic time | 2016-03-23 | Paper |
| Randomized broadcast in radio networks with collision detection | 2016-01-06 | Paper |
| Bounded-contention coding for the additive network model | 2015-10-20 | Paper |
| Faster information dissemination in dynamic networks via network coding | 2015-09-11 | Paper |
| Breathe before speaking | 2015-09-03 | Paper |
| Optimal gossip with direct addressing | 2015-09-03 | Paper |
| Optimal error rates for interactive coding I | 2015-06-26 | Paper |
| Self-adjusting grid networks to minimize expected path length | 2015-05-22 | Paper |
| Randomized broadcast in radio networks with collision detection | 2015-03-02 | Paper |
| Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance | 2014-09-09 | Paper |
| Analyzing network coding gossip made easy | 2014-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417683 | 2014-05-22 | Paper |
| Global computation in a poorly connected world | 2014-05-13 | Paper |
| Deterministic Algorithms for the LovĂĄsz Local Lemma | 2014-04-11 | Paper |
| Beeping a maximal independent set | 2014-03-25 | Paper |
| New Constructive Aspects of the LovĂĄsz Local Lemma | 2014-02-17 | Paper |
| Self-adjusting Grid Networks to Minimize Expected Path Length | 2013-12-17 | Paper |
| Planarity Algorithms via PQ-Trees (Extended Abstract) | 2013-06-28 | Paper |
| Testing Simultaneous Planarity when the Common Graph is 2-Connected | 2013-04-09 | Paper |
| Bounds on Contention Management in Radio Networks | 2013-03-13 | Paper |
| Lower Bounds on Information Dissemination in Dynamic Networks | 2013-03-13 | Paper |
| Bounded-Contention Coding for Wireless Networks in the High SNR Regime | 2013-03-13 | Paper |
| Rank-Pairing Heaps | 2012-03-15 | Paper |
| Online Stochastic Weighted Matching: Improved Approximation Algorithms | 2011-12-05 | Paper |
| Beeping a maximal independent set | 2011-10-28 | Paper |
| Lower bounds on van der Waerden numbers: randomized- and deterministic-constructive | 2011-06-01 | Paper |
| Testing Simultaneous Planarity When the Common Graph Is 2-Connected | 2010-12-09 | Paper |
| Rank-Pairing Heaps | 2009-10-29 | Paper |
| Rank-Balanced Trees | 2009-10-20 | Paper |
| Finding a feasible flow in a strongly connected network | 2009-03-04 | Paper |
| Faster Algorithms for Incremental Topological Ordering | 2008-08-28 | Paper |
