| Publication | Date of Publication | Type |
|---|
| Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874301 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092351 | 2022-07-21 | Paper |
| Navigating in Trees with Permanently Noisy Advice | 2022-02-16 | Paper |
| Searching a Tree with Permanently Noisy Advice | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993318 | 2021-06-15 | Paper |
| Multi-round cooperative search games with multiple players | 2020-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111412 | 2020-05-27 | Paper |
| Parallel Bayesian Search with No Coordination | 2019-11-21 | Paper |
| Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits | 2019-07-11 | Paper |
| The Dependent Doors Problem | 2019-03-28 | Paper |
| Dynamic routing schemes for graphs with low local density | 2018-11-05 | Paper |
| Label-guided graph exploration by a finite automaton | 2018-11-05 | Paper |
| An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets | 2018-08-02 | Paper |
| Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits | 2018-07-16 | Paper |
| Parallel search with no coordination | 2018-04-12 | Paper |
| Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication | 2018-01-17 | Paper |
| On the additive constant of the \(k\)-server work function algorithm | 2017-11-03 | Paper |
| Parallel exhaustive search without coordination | 2017-09-29 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365131 | 2017-09-29 | Paper |
| The ANTS problem | 2017-08-31 | Paper |
| Fast rendezvous on a cycle by agents with different speeds | 2017-06-19 | Paper |
| Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach | 2016-01-08 | 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 |
| Toward more localized local algorithms | 2015-09-11 | Paper |
| Breathe before speaking | 2015-09-03 | Paper |
| On the Impact of Identifiers on Local Decision | 2015-08-05 | Paper |
| Proof labeling schemes | 2015-03-10 | Paper |
| Distributed verification of minimum spanning trees | 2015-03-10 | Paper |
| What can be decided locally without identifiers? | 2015-03-02 | Paper |
| Efficient threshold detection in a distributed environment | 2015-03-02 | Paper |
| Randomized distributed decision | 2015-02-23 | Paper |
| Improved compact routing schemes for dynamic trees | 2014-12-12 | Paper |
| Collaborative search on the plane without communication | 2014-12-05 | Paper |
| Labeling schemes for vertex connectivity | 2014-11-18 | Paper |
| An optimal ancestry scheme and small universal posets | 2014-08-13 | Paper |
| Local Distributed Decision | 2014-07-30 | Paper |
| Distributed verification and hardness of distributed approximation | 2014-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417638 | 2014-05-22 | Paper |
| Toward more localized local algorithms: removing assumptions concerning global knowledge | 2014-03-28 | Paper |
| Controller and estimator for dynamic networks | 2014-03-13 | Paper |
| Towards a complexity theory for local distributed computing | 2014-02-17 | Paper |
| Tight bounds for distributed minimum-weight spanning tree verification | 2013-10-21 | Paper |
| Compact separator decompositions in dynamic trees and applications to labeling schemes | 2013-07-04 | Paper |
| Proof labeling schemes | 2013-06-28 | Paper |
| General compact labeling schemes for dynamic trees | 2013-06-20 | Paper |
| Distributed verification of minimum spanning trees | 2013-06-20 | Paper |
| Controller and estimator for dynamic networks | 2013-06-06 | Paper |
| Randomized distributed decision | 2013-03-13 | Paper |
| Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology | 2013-03-13 | Paper |
| Distributed Verification and Hardness of Distributed Approximation | 2013-02-04 | Paper |
| New bounds for the controller problem | 2012-02-06 | Paper |
| Tight bounds for distributed minimum-weight spanning tree verification | 2012-01-23 | Paper |
| Online computation with advice | 2011-06-07 | Paper |
| Local MST computation with short advice | 2010-12-17 | Paper |
| Constructing labeling schemes through universal matrices | 2010-05-28 | Paper |
| On the Additive Constant of the k-Server Work Function Algorithm | 2010-05-11 | Paper |
| New Bounds for the Controller Problem | 2009-11-19 | Paper |
| Online Computation with Advice | 2009-07-14 | Paper |
| Labeling schemes for tree representation | 2009-05-13 | Paper |
| A note on models for graph representations | 2009-03-30 | Paper |
| Dynamic Routing Schemes for General Graphs | 2009-03-12 | Paper |
| Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes | 2008-09-02 | Paper |
| Constructing Labeling Schemes Through Universal Matrices | 2008-04-24 | Paper |
| Labeling schemes for weighted dynamic trees | 2007-12-10 | Paper |
| Labeling Schemes for Vertex Connectivity | 2007-11-28 | Paper |
| Labeling Schemes with Queries | 2007-11-15 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Labeling Schemes for Flow and Connectivity | 2005-02-21 | Paper |
| Labeling schemes for dynamic tree networks | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829032 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736829 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449189 | 2004-02-08 | Paper |
