| Publication | Date of Publication | Type |
|---|
Brief Announcement: Probabilistic Dynamic Input/Output Automata
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Game Theoretical Framework for Analyzing Blockchains Robustness | 2023-12-08 | Paper |
| Brief announcement: Game theoretical framework for analyzing blockchains robustness | 2023-11-02 | Paper |
Lower and upper bounds for deterministic convergecast with labeling schemes
Theoretical Computer Science | 2023-03-24 | Paper |
Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps
Theoretical Computer Science | 2022-12-21 | Paper |
| Foremost non-stop journey arrival in linear time | 2022-11-11 | Paper |
Correctness of Tendermint-Core Blockchains
(available as arXiv preprint) | 2022-07-21 | Paper |
Parameterized verification of algorithms for oblivious robots on a ring
Formal Methods in System Design | 2021-02-08 | Paper |
Self-stabilizing gathering of mobile robots under crash or Byzantine faults
Distributed Computing | 2020-10-16 | Paper |
| Flocking with oblivious robots | 2019-11-22 | 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 |
On time complexity for connectivity-preserving scattering of mobile robots
Theoretical Computer Science | 2018-06-18 | Paper |
Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register
Theoretical Computer Science | 2017-12-20 | 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 |
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 |
Stabilizing server-based storage in Byzantine asynchronous message-passing systems (extended abstract)
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Tight bound on mobile Byzantine agreement
Theoretical Computer Science | 2015-12-08 | Paper |
Practically stabilizing SWMR atomic memory in message-passing systems
Journal of Computer and System Sciences | 2015-02-20 | Paper |
A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees
Theoretical Computer Science | 2013-12-19 | Paper |
Stabilizing data-link over non-FIFO channels with optimal fault-resilience
Information Processing Letters | 2013-04-04 | Paper |
Self-stabilizing Byzantine asynchronous unison
Journal of Parallel and Distributed Computing | 2012-10-23 | Paper |
The cost of probabilistic agreement in oblivious robot networks
Information Processing Letters | 2012-01-18 | Paper |
Physical expander in virtual tree overlay
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Self-stabilizing minimum degree spanning tree within one from the optimal degree
Journal of Parallel and Distributed Computing | 2011-08-19 | Paper |
Dynamic FTSS in asynchronous systems: the case of unison
Theoretical Computer Science | 2011-07-14 | Paper |
Exclusive perpetual ring exploration without chirality
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Fast self-stabilizing minimum spanning tree construction. Using compact nearest common ancestor labeling scheme
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 |
Optimal deterministic ring exploration with oblivious asynchronous robots
Structural Information and Communication Complexity | 2010-06-17 | Paper |
A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
Lecture Notes in Computer Science | 2009-11-19 | Paper |
