| Publication | Date of Publication | Type |
|---|
| A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States | 2024-03-26 | Paper |
| Deterministic Fault-Tolerant Connectivity Labeling Scheme | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083413 | 2023-12-08 | Paper |
| Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles | 2023-06-12 | Paper |
| Atomic cross-chain swaps with improved space, time and local time complexities | 2023-05-19 | Paper |
| Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications | 2023-04-21 | Paper |
| Efficient Dispersion of Mobile Agents without Global Knowledge | 2023-03-21 | Paper |
| Time-Optimal Self-stabilizing Leader Election on Rings in Population Protocols | 2023-03-21 | Paper |
| Tight bounds on distributed exploration of temporal graphs | 2023-02-07 | Paper |
| Self-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs | 2022-11-04 | Paper |
| How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults | 2022-11-04 | Paper |
| Loosely-stabilizing maximal independent set algorithms with unreliable communications | 2022-10-24 | Paper |
| The Power of Global Knowledge on Self-stabilizing Population Protocols | 2022-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091108 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091109 | 2022-07-21 | Paper |
| Leader Election Requires Logarithmic Time in Population Protocols | 2022-07-08 | Paper |
| Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees | 2022-07-04 | Paper |
| Exploration of dynamic networks: tight bounds on the number of agents | 2021-09-17 | Paper |
| A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets | 2021-06-22 | Paper |
| Logarithmic Expected-Time Leader Election in Population Protocol Model | 2021-01-20 | Paper |
| Exploration of dynamic tori by multiple agents | 2020-12-16 | Paper |
| Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings | 2020-05-23 | Paper |
| Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings | 2020-03-03 | Paper |
| A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault | 2020-03-03 | Paper |
| Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings | 2020-01-29 | Paper |
| Loosely-stabilizing leader election with polylogarithmic convergence time | 2020-01-16 | Paper |
| Constant-space self-stabilizing token distribution in trees | 2019-01-30 | Paper |
| Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings | 2019-01-30 | Paper |
| Move-optimal partial gathering of mobile agents in asynchronous trees | 2017-11-16 | Paper |
| Uniform Deployment of Mobile Agents in Asynchronous Rings | 2017-09-29 | Paper |
| Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers | 2017-09-29 | Paper |
| Maximum Matching for Anonymous Trees with Constant Space per Process | 2017-09-29 | Paper |
| Partial gathering of mobile agents in asynchronous unidirectional rings | 2016-01-28 | Paper |
| Analysis of Distributed Token Circulation Algorithm with Faulty Random Number Generator | 2015-12-18 | Paper |
| Fast and compact self-stabilizing verification, computation, and fault detection of an MST | 2015-09-29 | Paper |
| Fast and compact self-stabilizing verification, computation, and fault detection of an MST | 2015-09-11 | Paper |
| Maximum metric spanning tree made Byzantine tolerant | 2015-09-03 | Paper |
| Move-Optimal Partial Gathering of Mobile Agents in Asynchronous Trees | 2014-08-07 | Paper |
| Linear time and space gathering of anonymous mobile agents in asynchronous trees | 2013-06-06 | Paper |
| Loosely-stabilizing leader election in a population protocol model | 2012-08-10 | Paper |
| Maximum metric spanning tree made Byzantine tolerant | 2011-10-28 | Paper |
| RELIABLE COMMUNICATION ON EMULATED CHANNELS RESILIENT TO TRANSIENT FAULTS | 2011-10-10 | Paper |
| Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures | 2011-07-22 | Paper |
| The Impact of Topology on Byzantine Containment in Stabilization | 2010-09-10 | Paper |
| Timer-based composition of fault-containing self-stabilizing protocols | 2010-07-20 | Paper |
| Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees | 2010-06-17 | Paper |
| Quiescence of self-stabilizing gossiping among mobile agents in graphs | 2010-04-06 | Paper |
| Loosely-Stabilizing Leader Election in Population Protocol Model | 2010-02-24 | Paper |
| A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems | 2010-01-29 | Paper |
| Timer-Based Composition of Fault-Containing Self-stabilizing Protocols | 2009-03-12 | Paper |
| Calibrating an Embedded Protocol on an Asynchronous System | 2009-03-12 | Paper |
| One-Step Consensus Solvability | 2008-09-09 | Paper |
| Output Stability Versus Time Till Output | 2008-09-02 | Paper |
| Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs | 2008-07-10 | Paper |
| Move-optimal gossiping among mobile agents | 2008-04-15 | Paper |
| Optimal Moves for Gossiping Among Mobile Agents | 2007-11-15 | Paper |
| Self-stabilization in Spite of Frequent Changes of Networks: Case Study of Mutual Exclusion on Dynamic Rings | 2007-09-25 | Paper |
| Adaptive timeliness of consensus in presence of crash and timing faults | 2007-06-04 | Paper |
| Principles of Distributed Systems | 2005-12-15 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Synchronous Condition-Based Consensus Adapting to Input-Vector Legality | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457227 | 2004-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4446606 | 2004-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436046 | 2003-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436060 | 2003-11-23 | Paper |
| A latency optimal superstabilizing mutual exclusion protocol in unidirectional rings | 2002-10-16 | Paper |
| A cost optimal parallel algorithm for weighted distance transforms. | 2002-07-25 | Paper |
| Available stabilizing heaps | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331304 | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250795 | 2000-11-06 | Paper |
| An algorithm for finding the causal distributed breakpoint | 1997-10-28 | Paper |
| An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images | 1997-02-28 | Paper |
| An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees | 1987-01-01 | Paper |
