| Publication | Date of Publication | Type |
|---|
Pattern formation of mobile agents in dynamic grids
Theoretical Computer Science | 2026-08-25 | Paper |
| A timestamp based transformation of self-stabilizing programs for distributed computing environments | 2024-07-11 | Paper |
| Atomic cross-chain swaps with improved space and local time complexity | 2024-04-19 | Paper |
| Logarithmic expected-time leader election in population protocol model | 2024-04-19 | Paper |
| A self-stabilizing 1-maximal independent set algorithm | 2024-04-19 | Paper |
Self-stabilizing 2-minimal dominating set algorithms based on loop composition
Theoretical Computer Science | 2024-01-05 | Paper |
Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles
Lecture Notes in Computer Science | 2023-06-12 | Paper |
Atomic cross-chain swaps with improved space, time and local time complexities
Information and Computation | 2023-05-19 | Paper |
| Efficient Dispersion of Mobile Agents without Global Knowledge | 2023-03-21 | Paper |
How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults
Lecture Notes in Computer Science | 2022-11-04 | Paper |
| scientific article; zbMATH DE number 7561458 (Why is no real title available?) | 2022-07-21 | Paper |
Logarithmic Expected-Time Leader Election in Population Protocol Model
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Exploration of dynamic tori by multiple agents
Theoretical Computer Science | 2020-12-16 | Paper |
Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings
Theoretical Computer Science | 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
Theoretical Computer Science | 2020-01-29 | Paper |
Loosely-stabilizing leader election with polylogarithmic convergence time
Theoretical Computer Science | 2020-01-16 | Paper |
Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings
Structural Information and Communication Complexity | 2019-01-30 | Paper |
An asynchronous message-passing distributed algorithm for the generalized local critical section problem
Algorithms | 2018-08-20 | Paper |
Move-optimal partial gathering of mobile agents in asynchronous trees
Theoretical Computer Science | 2017-11-16 | Paper |
Uniform Deployment of Mobile Agents in Asynchronous Rings
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| Loosely-stabilizing leader election on arbitrary graphs in population protocols without identifiers nor random numbers | 2017-09-29 | Paper |
Partial gathering of mobile agents in asynchronous unidirectional rings
Theoretical Computer Science | 2016-01-28 | Paper |
Analysis of distributed token circulation algorithm with faulty random number generator
Parallel Processing Letters | 2015-12-18 | Paper |
Self-stabilizing distributed algorithm for local mutual inclusion
Information Processing Letters | 2015-05-21 | Paper |
On the family of critical section problems
Information Processing Letters | 2014-10-07 | Paper |
Move-Optimal Partial Gathering of Mobile Agents in Asynchronous Trees
Structural Information and Communication Complexity | 2014-08-07 | Paper |
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
Journal of Combinatorial Optimization | 2013-06-28 | Paper |
Linear time and space gathering of anonymous mobile agents in asynchronous trees
Theoretical Computer Science | 2013-06-06 | Paper |
Loosely-stabilizing leader election in a population protocol model
Theoretical Computer Science | 2012-08-10 | Paper |
A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
Theoretical Computer Science | 2012-05-30 | Paper |
Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures
Theoretical Computer Science | 2011-07-22 | 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 |
Timer-based composition of fault-containing self-stabilizing protocols
Information Sciences | 2010-07-20 | Paper |
A self-stabilizing distributed approximation algorithm for the minimum connected dominating set
International Journal of Foundations of Computer Science | 2010-06-18 | Paper |
Space-optimal rendezvous of mobile agents in asynchronous trees
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Loosely-stabilizing leader election in population protocol model
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Timer-Based Composition of Fault-Containing Self-stabilizing Protocols
Studies in Computational Intelligence | 2009-03-12 | Paper |
Move-optimal gossiping among mobile agents
Theoretical Computer Science | 2008-04-15 | Paper |
Optimal Moves for Gossiping Among Mobile Agents
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Self-stabilization in Spite of Frequent Changes of Networks: Case Study of Mutual Exclusion on Dynamic Rings
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Uniform and self-stabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon
Journal of Parallel and Distributed Computing | 2002-10-16 | Paper |
| scientific article; zbMATH DE number 1788704 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1398059 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398096 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398097 (Why is no real title available?) | 2000-02-03 | Paper |
A distributed k-mutual exclusion algorithm using k-coterie
Information Processing Letters | 1994-04-05 | Paper |
