| Publication | Date of Publication | Type |
|---|
Approximation hardness of domination problems on generalized convex graphs
Theoretical Computer Science | 2025-01-16 | Paper |
| Exploration of dynamic ring networks by a single agent with the H-hops and S-time steps view | 2024-04-19 | Paper |
| Atomic cross-chain swaps with improved space and local time complexity | 2024-04-19 | Paper |
| \textit{Improved-Zigzag}: an improved local-information-based self-optimizing routing algorithm in virtual grid networks | 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 |
A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Deterministic Fault-Tolerant Connectivity Labeling Scheme
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
scientific article; zbMATH DE number 7774291 (Why is no real title available?)
(available as arXiv preprint) | 2023-12-08 | Paper |
| Communication efficient self-stabilizing leader election | 2023-11-02 | 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 |
| 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
Lecture Notes in Computer Science | 2022-11-04 | Paper |
How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults
Lecture Notes in Computer Science | 2022-11-04 | Paper |
Loosely-stabilizing maximal independent set algorithms with unreliable communications
Theoretical Computer Science | 2022-10-24 | Paper |
The Power of Global Knowledge on Self-stabilizing Population Protocols
Structural Information and Communication Complexity | 2022-09-01 | Paper |
| scientific article; zbMATH DE number 7561458 (Why is no real title available?) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561459 (Why is no real title available?) | 2022-07-21 | Paper |
Leader election requires logarithmic time in population protocols
Parallel Processing Letters | 2022-07-08 | Paper |
Constant space self-stabilizing center finding algorithms in chains and trees
Parallel Processing Letters | 2022-07-04 | Paper |
Exploration of dynamic networks: tight bounds on the number of agents
Journal of Computer and System Sciences | 2021-09-17 | Paper |
A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets
Theoretical Computer Science | 2021-06-22 | 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 |
| A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault | 2020-03-03 | Paper |
| Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings | 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 |
| Constant-space self-stabilizing token distribution in trees | 2019-01-30 | Paper |
Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings
Structural Information and Communication Complexity | 2019-01-30 | 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 |
| Maximum matching for anonymous trees with constant space per process | 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 |
Fast and compact self-stabilizing verification, computation, and fault detection of an MST
Distributed Computing | 2015-09-29 | Paper |
Fast and compact self stabilizing verification, computation, and fault detection of an MST
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Maximum metric spanning tree made Byzantine tolerant
Algorithmica | 2015-09-03 | Paper |
Move-Optimal Partial Gathering of Mobile Agents in Asynchronous Trees
Structural Information and Communication Complexity | 2014-08-07 | 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 |
Maximum metric spanning tree made Byzantine tolerant
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Reliable communication on emulated channels resilient to transient faults
International Journal of Foundations of Computer Science | 2011-10-10 | Paper |
Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures
Theoretical Computer Science | 2011-07-22 | Paper |
The impact of topology on Byzantine containment in stabilization
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Timer-based composition of fault-containing self-stabilizing protocols
Information Sciences | 2010-07-20 | Paper |
Space-optimal rendezvous of mobile agents in asynchronous trees
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 |
Loosely-stabilizing leader election in population protocol model
Structural Information and Communication Complexity | 2010-02-24 | Paper |
A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
Information Processing Letters | 2010-01-29 | Paper |
Timer-Based Composition of Fault-Containing Self-stabilizing Protocols
Studies in Computational Intelligence | 2009-03-12 | Paper |
Calibrating an Embedded Protocol on an Asynchronous System
Studies in Computational Intelligence | 2009-03-12 | Paper |
One-Step Consensus Solvability
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Output Stability Versus Time Till Output
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs
Structural Information and Communication Complexity | 2008-07-10 | 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 |
Adaptive timeliness of consensus in presence of crash and timing faults
Journal of Parallel and Distributed Computing | 2007-06-04 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Synchronous Condition-Based Consensus Adapting to Input-Vector Legality
Lecture Notes in Computer Science | 2005-08-17 | Paper |
| scientific article; zbMATH DE number 2061545 (Why is no real title available?) | 2004-03-21 | Paper |
| scientific article; zbMATH DE number 2036576 (Why is no real title available?) | 2004-02-02 | Paper |
| scientific article; zbMATH DE number 2006648 (Why is no real title available?) | 2003-11-23 | Paper |
| scientific article; zbMATH DE number 2006661 (Why is no real title available?) | 2003-11-23 | Paper |
A latency optimal superstabilizing mutual exclusion protocol in unidirectional rings
Journal of Parallel and Distributed Computing | 2002-10-16 | Paper |
Available stabilizing heaps
Information Processing Letters | 2002-07-25 | Paper |
A cost optimal parallel algorithm for weighted distance transforms.
Parallel Computing | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1741108 (Why is no real title available?) | 2002-05-15 | Paper |
| scientific article; zbMATH DE number 1304101 (Why is no real title available?) | 2000-11-06 | Paper |
An algorithm for finding the causal distributed breakpoint
Journal of Parallel and Distributed Computing | 1997-10-28 | Paper |
An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
Information Processing Letters | 1997-02-28 | Paper |
An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees
Discrete Applied Mathematics | 1987-01-01 | Paper |
