| Publication | Date of Publication | Type |
|---|
| Deterministic Fault-Tolerant Connectivity Labeling Scheme | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083413 | 2023-12-08 | Paper |
| A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching | 2023-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874267 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874294 | 2023-02-07 | Paper |
| Loosely-stabilizing maximal independent set algorithms with unreliable communications | 2022-10-24 | Paper |
| Low-congestion shortcut and graph parameters | 2021-11-08 | Paper |
| Low-congestion shortcuts without embedding | 2021-03-12 | Paper |
| Fault-tolerant simulation of population protocols | 2021-01-22 | Paper |
| Logarithmic Expected-Time Leader Election in Population Protocol Model | 2021-01-20 | Paper |
| Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model | 2021-01-20 | Paper |
| Message Reduction in the LOCAL Model is a Free Lunch | 2021-01-20 | Paper |
| Distributed Minimum Degree Spanning Trees | 2021-01-20 | Paper |
| Distributed Graph Algorithms and their Complexity: An Introduction | 2020-11-19 | Paper |
| Uniform distribution for Pachinko | 2020-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3301016 | 2020-08-11 | Paper |
| Flocking with oblivious robots | 2019-11-22 | Paper |
| Population protocols with faulty interactions: the impact of a leader | 2018-12-04 | Paper |
| Near-optimal low-congestion shortcuts on bounded parameter graphs | 2018-08-16 | Paper |
| On time complexity for connectivity-preserving scattering of mobile robots | 2018-06-18 | Paper |
| Triangle Finding and Listing in CONGEST Networks | 2017-10-11 | Paper |
| Low-Congestion Shortcuts without Embedding | 2017-09-29 | Paper |
| Population protocols with faulty interactions: the impact of a leader | 2017-07-21 | Paper |
| Improving the lower bound on opaque sets for equilateral triangle | 2016-09-12 | Paper |
| Listing Center Strings Under the Edit Distance Metric | 2016-02-05 | Paper |
| On Space and Time Complexity of Loosely-Stabilizing Leader Election | 2016-01-08 | Paper |
| Depth-First Search Using $$O(n)$$ Bits | 2015-09-11 | Paper |
| Approximability of minimum certificate dispersal with tree structures | 2015-07-13 | Paper |
| Filling Logarithmic Gaps in Distributed Complexity for Global Problems | 2015-02-20 | Paper |
| Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances | 2014-12-02 | Paper |
| Space-efficient self-stabilizing counting population protocols on mobile sensor networks | 2014-09-10 | Paper |
| Randomized Lower Bound for Distributed Spanning-Tree Verification | 2014-08-07 | Paper |
| ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS | 2012-12-12 | Paper |
| THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING | 2012-12-12 | Paper |
| How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model | 2012-12-06 | Paper |
| The optimal tolerance of uniform observation error for mobile robot convergence | 2012-08-10 | Paper |
| Minimum Certificate Dispersal with Tree Structures | 2012-07-16 | Paper |
| On the approximability and hardness of minimum topic connected overlay and its special instances | 2012-05-30 | Paper |
| The Gathering Problem for Two Oblivious Robots with Unreliable Compasses | 2012-05-30 | Paper |
| The cost of probabilistic agreement in oblivious robot networks | 2012-01-18 | Paper |
| Physical Expander in Virtual Tree Overlay | 2011-10-28 | Paper |
| On the Approximability of Minimum Topic Connected Overlay and Its Special Instances | 2011-08-17 | Paper |
| Oracle-based flocking of mobile robots in crash-recovery model | 2011-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3084819 | 2011-03-25 | Paper |
| Approximability and inapproximability of the minimum certificate dispersal problem | 2010-07-07 | Paper |
| Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings | 2010-06-17 | Paper |
| Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents | 2010-02-24 | Paper |
| Convergence of Mobile Robots with Uniformly-Inaccurate Sensors | 2010-02-24 | Paper |
| A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems | 2010-01-29 | Paper |
| Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem | 2009-07-23 | Paper |
| One-Step Consensus Solvability | 2008-09-09 | Paper |
| Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result | 2008-09-02 | Paper |
| Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses | 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 |
| Adaptive timeliness of consensus in presence of crash and timing faults | 2007-06-04 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Synchronous Condition-Based Consensus Adapting to Input-Vector Legality | 2005-08-17 | Paper |
