| Publication | Date of Publication | Type |
|---|
| Uniform bipartition in the population protocol model with arbitrary communication graphs | 2026-03-31 | Paper |
On time-travel planning in dynamic graphs
Theoretical Computer Science | 2025-10-17 | Paper |
| The reduced automata technique for graph exploration space lower bounds | 2025-03-19 | Paper |
Gathering on rings for myopic asynchronous robots with lights
Theory of Computing Systems | 2025-02-28 | Paper |
Stand-up indulgent gathering on lines
Theoretical Computer Science | 2024-10-07 | Paper |
Resource efficient stabilization for local tasks despite unknown capacity links
Theoretical Computer Science | 2024-10-01 | Paper |
| Fun with Fun | 2024-05-16 | Paper |
scientific article; zbMATH DE number 7832750 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-15 | Paper |
Reliable broadcast in dynamic networks with locally bounded Byzantine failures
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Arbitrary pattern formation with four robots
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Ring exploration with myopic luminous robots
Lecture Notes in Computer Science | 2023-08-02 | Paper |
| Meeting Times of Non-atomic Random Walks | 2023-05-19 | Paper |
| The Agreement Power of Disagreement | 2023-04-21 | Paper |
The agreement power of disagreement
Theoretical Computer Science | 2023-04-12 | Paper |
| Boosting the Efficiency of Byzantine-Tolerant Reliable Communication | 2023-03-21 | Paper |
| Partial Gathering of Mobile Robots from Multiplicity-Allowed Configurations in Rings | 2023-03-21 | Paper |
| Stand Up Indulgent Rendezvous | 2023-03-21 | Paper |
scientific article; zbMATH DE number 7650877 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps
Theoretical Computer Science | 2022-12-21 | Paper |
Stand up indulgent gathering
Theoretical Computer Science | 2022-11-17 | Paper |
An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon for arbitrary networks
Lecture Notes in Computer Science | 2022-11-04 | Paper |
Mobile robots with uncertain visibility sensors: possibility results and lower bounds
Parallel Processing Letters | 2022-07-08 | Paper |
Stand up indulgent gathering
Algorithms for Sensor Systems | 2022-06-24 | Paper |
Ring exploration with myopic luminous robots
Information and Computation | 2022-05-17 | Paper |
Uniform bipartition in the population protocol model with arbitrary graphs
Theoretical Computer Science | 2021-10-21 | Paper |
Parameterized verification of algorithms for oblivious robots on a ring
Formal Methods in System Design | 2021-02-08 | Paper |
Optimal torus exploration by oblivious robots
Computing | 2021-01-15 | Paper |
Self-stabilization with \(r\)-operators
Distributed Computing | 2020-12-03 | Paper |
| Mobile robots with uncertain visibility sensors | 2020-03-03 | Paper |
Compact self-stabilizing leader election for general networks
(available as arXiv preprint) | 2020-02-12 | Paper |
The complexity of data aggregation in static and dynamic wireless sensor networks
Lecture Notes in Computer Science | 2020-01-14 | Paper |
Automated Analysis of Impact of Scheduling on Performance of Self-stabilizing Protocols
Lecture Notes in Computer Science | 2020-01-14 | Paper |
| An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers | 2019-11-22 | Paper |
Synchronous gathering without multiplicity detection: a certified algorithm
Lecture Notes in Computer Science | 2019-11-22 | Paper |
Packet efficient implementation of the Omega failure detector
Lecture Notes in Computer Science | 2019-11-22 | Paper |
Synchronous gathering without multiplicity detection: a certified algorithm
Theory of Computing Systems | 2019-06-21 | Paper |
Packet efficient implementation of the Omega failure detector
Theory of Computing Systems | 2019-06-21 | Paper |
Approximate agreement under mobile Byzantine faults
Theoretical Computer Science | 2019-01-10 | Paper |
On asynchronous rendezvous in general graphs
Theoretical Computer Science | 2018-11-29 | Paper |
Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
(available as arXiv preprint) | 2018-08-16 | Paper |
On time complexity for connectivity-preserving scattering of mobile robots
Theoretical Computer Science | 2018-06-18 | Paper |
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
Distributed Computing | 2018-04-11 | Paper |
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
Distributed Computing | 2018-04-11 | Paper |
Automated synthesis of distributed self-stabilizing protocols
(available as arXiv preprint) | 2018-02-20 | Paper |
Tolerating Random Byzantine Failures in an Unbounded Network
Parallel Processing Letters | 2017-12-15 | Paper |
Brief Announcement
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Optimal mobile Byzantine fault tolerant distributed storage (extended abstract)
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
The random bit complexity of mobile robots scattering
International Journal of Foundations of Computer Science | 2017-08-17 | Paper |
The complexity of data aggregation in static and dynamic wireless sensor networks
Information and Computation | 2017-08-08 | Paper |
Formal verification of mobile robot protocols
Distributed Computing | 2017-06-22 | Paper |
Gathering fat mobile robots with slim omnidirectional cameras
Theoretical Computer Science | 2016-06-27 | Paper |
Wait-free gathering without chirality
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Weak vs. self vs. probabilistic stabilization
International Journal of Foundations of Computer Science | 2015-09-29 | Paper |
Maximum metric spanning tree made Byzantine tolerant
Algorithmica | 2015-09-03 | Paper |
Evaluating complex MAC protocols for sensor networks with APMC
Electronic Notes in Theoretical Computer Science | 2015-03-18 | Paper |
Practically stabilizing SWMR atomic memory in message-passing systems
Journal of Computer and System Sciences | 2015-02-20 | Paper |
On the self-stabilization of mobile oblivious robots in uniform rings
Theoretical Computer Science | 2015-01-28 | Paper |
Impossibility of gathering, a certification
Information Processing Letters | 2014-12-15 | Paper |
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
Theoretical Computer Science | 2014-01-10 | Paper |
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
Journal of Combinatorial Optimization | 2013-06-28 | Paper |
Transient fault detectors
Distributed Computing | 2013-06-20 | Paper |
Stabilizing data-link over non-FIFO channels with optimal fault-resilience
Information Processing Letters | 2013-04-04 | Paper |
On Byzantine broadcast in loosely connected networks
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Self-stabilizing Byzantine asynchronous unison
Journal of Parallel and Distributed Computing | 2012-10-23 | Paper |
Gathering an even number of robots in an odd ring without global multiplicity detection
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Snap-stabilization in message-passing systems
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
Maximum metric spanning tree made Byzantine tolerant
Lecture Notes in Computer Science | 2011-10-28 | Paper |
A self-stabilizing 23-approximation algorithm for the maximum matching problem
Theoretical Computer Science | 2011-10-10 | Paper |
Deterministic secure positioning in wireless sensor networks
Theoretical Computer Science | 2011-09-12 | Paper |
Dynamic FTSS in asynchronous systems: the case of unison
Theoretical Computer Science | 2011-07-14 | Paper |
The impact of topology on Byzantine containment in stabilization
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Exclusive perpetual ring exploration without chirality
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Optimal Byzantine-resilient convergence in uni-dimensional robot networks
Theoretical Computer Science | 2010-08-11 | Paper |
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Optimal deterministic ring exploration with oblivious asynchronous robots
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Quiescence of self-stabilizing gossiping among mobile agents in graphs
Theoretical Computer Science | 2010-04-06 | Paper |
Ascending runs in dependent uniformly distributed random variables: application to wireless networks
Methodology and Computing in Applied Probability | 2010-03-15 | Paper |
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
Structural Information and Communication Complexity | 2010-02-24 | Paper |
A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
Lecture Notes in Computer Science | 2009-11-19 | Paper |
A new self-stabilizing maximal matching algorithm
Theoretical Computer Science | 2009-03-30 | Paper |
Discovering Network Topology in the Presence of Byzantine Faults
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs
Structural Information and Communication Complexity | 2008-07-10 | Paper |
A new self-stabilizing maximal matching algorithm
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Self-stabilization with r-Operators Revisited
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Algorithmic Aspects of Wireless Sensor Networks
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
Lecture Notes in Computer Science | 2005-08-17 | Paper |
| scientific article; zbMATH DE number 2090662 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2061548 (Why is no real title available?) | 2004-03-21 | Paper |
| scientific article; zbMATH DE number 2036580 (Why is no real title available?) | 2004-02-02 | Paper |
Self-stabilization with path algebra
Theoretical Computer Science | 2003-05-14 | Paper |
Tolerating transient and intermittent failures
Journal of Parallel and Distributed Computing | 2002-10-16 | Paper |
SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS
Parallel Algorithms and Applications | 2001-08-30 | Paper |
| scientific article; zbMATH DE number 1304099 (Why is no real title available?) | 1999-06-17 | Paper |
