| Publication | Date of Publication | Type |
|---|
Want to gather? No need to chatter!
SIAM Journal on Computing | 2025-01-14 | Paper |
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Almost universal anonymous rendezvous in the plane
Algorithmica | 2023-10-06 | Paper |
| Asynchronous approach in the plane: a deterministic polynomial algorithm | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7561402 (Why is no real title available?) | 2022-07-21 | Paper |
Byzantine gathering in polynomial time
Distributed Computing | 2022-06-21 | Paper |
Byzantine gathering in polynomial time
(available as arXiv preprint) | 2021-07-28 | Paper |
Want to Gather? No Need to Chatter!
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Deterministic treasure hunt in the plane with angular hints
Algorithmica | 2020-10-21 | Paper |
Deterministic treasure hunt in the plane with angular hints
Algorithmica | 2020-10-21 | Paper |
Asynchronous approach in the plane: a deterministic polynomial algorithm
Distributed Computing | 2019-08-13 | Paper |
Asynchronous approach in the plane: a deterministic polynomial algorithm
Distributed Computing | 2019-08-13 | Paper |
Explicit communication among stigmergic robots
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Anonymous Meeting in Networks
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Gathering despite mischief | 2019-05-10 | Paper |
Impact of knowledge on election time in anonymous networks
Algorithmica | 2019-01-11 | Paper |
Gathering despite mischief
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
ACM Transactions on Algorithms | 2018-10-30 | Paper |
On deterministic rendezvous at a node of agents with arbitrary velocities
Information Processing Letters | 2018-03-16 | Paper |
Byzantine gathering in networks
Distributed Computing | 2017-06-22 | Paper |
Rendezvous in networks in spite of delay faults
Distributed Computing | 2016-07-05 | Paper |
Anonymous meeting in networks
Algorithmica | 2016-03-29 | Paper |
Byzantine gathering in networks
Lecture Notes in Computer Science | 2016-01-08 | Paper |
Deterministic polynomial approach in the plane
Distributed Computing | 2015-07-08 | Paper |
How to meet asynchronously at polynomial cost
SIAM Journal on Computing | 2015-06-24 | Paper |
How to meet asynchronously at polynomial cost
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Fault-tolerant rendezvous in networks
Automata, Languages, and Programming | 2014-07-01 | Paper |
Price of asynchrony in mobile agents computing
Theoretical Computer Science | 2014-02-11 | Paper |
Deterministic geoleader election in disoriented anonymous systems
Theoretical Computer Science | 2014-01-16 | Paper |
Deterministic Polynomial Approach in the Plane
Automata, Languages, and Programming | 2013-08-07 | Paper |
Deterministic network exploration by anonymous silent agents with local traffic reports
Automata, Languages, and Programming | 2012-11-01 | Paper |
Deterministic network exploration by a single agent with Byzantine tokens
Information Processing Letters | 2012-07-25 | Paper |
Self-stabilizing gathering with strong multiplicity detection
Theoretical Computer Science | 2012-05-30 | Paper |
Scatter of robots
Parallel Processing Letters | 2010-09-29 | Paper |
Leader election problem versus pattern formation problem
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Circle formation of weak robots and Lyndon words
Information Processing Letters | 2010-01-29 | Paper |
Squaring the Circle with Weak Mobile Robots
Algorithms and Computation | 2009-01-29 | Paper |
Robots and Demons (The Code of the Origins)
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Swing Words to Make Circle Formation Quiescent
Structural Information and Communication Complexity | 2007-11-15 | Paper |
