| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6128570 | 2024-04-15 | Paper |
| Time-optimal construction of overlay networks | 2024-03-26 | Paper |
| Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs | 2024-03-26 | Paper |
| Forming tile shapes with simple robots | 2024-02-09 | Paper |
| Routing schemes for hybrid communication networks | 2024-01-11 | Paper |
| Routing schemes for hybrid communication networks | 2024-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083383 | 2023-12-08 | Paper |
| On the Runtime of Universal Coating for Programmable Matter | 2023-11-30 | Paper |
| Competitive routing in hybrid communication networks | 2023-10-20 | Paper |
| Time-optimal construction of overlay networks | 2023-09-11 | Paper |
| A self-stabilizing hashed Patricia trie | 2023-08-02 | Paper |
| Self-stabilizing overlays for high-dimensional monotonic searchability | 2023-08-02 | Paper |
| On underlay-aware self-stabilizing overlay networks | 2023-08-02 | Paper |
| Relays: a new approach for the finite departure problem in overlay networks | 2023-08-02 | Paper |
| The canonical amoebot model: algorithms and concurrency control | 2023-06-19 | Paper |
| Routing with bounded buffers and hot-potato routing in vertex-symmetric networks | 2023-05-08 | Paper |
| Beep-and-sleep: message and energy efficient set cover | 2023-03-17 | Paper |
| Improved Leader Election for Self-organizing Programmable Matter | 2022-12-09 | Paper |
| A Self-stabilizing General De Bruijn Graph | 2022-11-04 | Paper |
| On the Complexity of Local Graph Transformations | 2022-07-21 | Paper |
| Beep-and-sleep: message and energy efficient set cover | 2022-06-24 | Paper |
| A self-stabilizing Hashed Patricia Trie | 2022-05-17 | Paper |
| Shape recognition by a finite automaton robot | 2021-08-04 | Paper |
| Shortest Paths in a Hybrid Network Model | 2021-02-02 | Paper |
| Distributed Monitoring of Network Properties: The Power of Hybrid Networks | 2020-05-27 | Paper |
| Faster construction of overlay networks | 2020-03-03 | Paper |
| A bounding box overlay for competitive routing in hybrid communication networks | 2020-03-03 | Paper |
| Towards a Universal Approach for the Finite Departure Problem in Overlay Networks | 2020-01-14 | Paper |
| Self-stabilizing metric graphs | 2019-11-22 | Paper |
| Linearization: Locally Self-Stabilizing Sorting in Graphs | 2019-09-11 | Paper |
| Self-stabilizing metric graphs | 2019-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743437 | 2019-05-10 | Paper |
| Forming tile shapes with simple robots | 2018-11-08 | Paper |
| Principles of Robust Medium Access and an Application to Leader Election | 2018-10-30 | Paper |
| Towards a universal approach for monotonic searchability in self-stabilizing overlay networks | 2018-08-16 | Paper |
| Sade: competitive MAC under adversarial SINR | 2018-06-01 | Paper |
| Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures | 2017-09-29 | Paper |
| Towards a universal approach for the finite departure problem in overlay networks | 2017-08-08 | Paper |
| Universal coating for programmable matter | 2017-05-18 | Paper |
| On the Runtime of Universal Coating for Programmable Matter | 2016-11-30 | Paper |
| From static to dynamic routing | 2016-09-29 | Paper |
| Minimum Linear Arrangement of Series-Parallel Graphs | 2015-11-20 | Paper |
| Leader Election and Shape Formation with Self-organizing Programmable Matter | 2015-09-30 | Paper |
| On Stabilizing Departures in Overlay Networks | 2015-09-18 | Paper |
| Peer-to-peer systems for prefix search | 2015-09-04 | Paper |
| SKIP + | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501273 | 2015-08-03 | Paper |
| A deterministic worst-case message complexity optimal solution for resource discovery | 2015-05-22 | Paper |
| A note on the parallel runtime of self-stabilizing graph linearization | 2015-02-05 | Paper |
| Re-Chord: a self-stabilizing chord overlay network | 2015-01-19 | Paper |
| A jamming-resistant MAC protocol for single-hop wireless networks | 2014-12-12 | Paper |
| Competitive and fair throughput for co-existing networks under adversarial interference | 2014-12-05 | Paper |
| A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) | 2014-09-26 | Paper |
| Smoothed analysis of left-to-right maxima with applications | 2014-09-09 | Paper |
| A distributed polylogarithmic time algorithm for self-stabilizing skip graphs | 2014-07-23 | Paper |
| A denial-of-service resistant DHT | 2014-03-13 | Paper |
| Programming for Distributed Computing: From Physical to Logical Networks | 2014-02-21 | Paper |
| Corona: a stabilizing deterministic message-passing skip list | 2014-01-13 | Paper |
| A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery | 2013-12-17 | Paper |
| Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing | 2013-10-21 | Paper |
| Competitive throughput in multi-hop wireless networks despite adaptive jamming | 2013-08-26 | Paper |
| Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs | 2012-10-11 | Paper |
| Tiara: a self-stabilizing deterministic skip list and skip graph | 2012-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113678 | 2012-01-23 | Paper |
| Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems | 2011-02-20 | Paper |
| A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks | 2010-09-10 | Paper |
| How to spread adversarial nodes? | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579433 | 2010-08-06 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization | 2010-04-27 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| A Self-stabilizing and Local Delaunay Graph Construction | 2009-12-17 | Paper |
| Towards a scalable and robust DHT | 2009-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396637 | 2009-09-19 | Paper |
| A Distributed and Oblivious Heap | 2009-07-14 | Paper |
| Robust random number generation for peer-to-peer systems | 2009-03-02 | Paper |
| A Denial-of-Service Resistant DHT | 2008-09-02 | Paper |
| Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks | 2008-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5424477 | 2007-11-05 | Paper |
| Deterministic routing with bounded buffers: turning offline into online protocols | 2007-03-29 | Paper |
| The effect of faults on network expansion | 2007-01-25 | Paper |
| Improved bounds for the unsplittable flow problem | 2006-12-07 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Simple on-line algorithms for the maximum disjoint paths problem | 2004-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828931 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736826 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449248 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542585 | 2002-09-17 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:4521547 Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma] | 2001-07-08 | Paper |
| Efficient communication strategies for ad hoc wireless networks | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952595 | 2001-02-05 | Paper |
| From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228489 | 1999-10-04 | Paper |
| Simple, efficient routing schemes for all-optical networks | 1999-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252279 | 1999-06-17 | Paper |
| Universal continuous routing strategies | 1998-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4397705 | 1998-07-12 | Paper |
| Exploiting storage redundancy to speed up randomized shared memory simulations | 1997-09-10 | Paper |
