Deterministic geoleader election in disoriented anonymous systems
From MaRDI portal
Publication:393108
DOI10.1016/j.tcs.2013.07.033zbMath1301.68029OpenAlexW2018447178MaRDI QIDQ393108
Franck Petit, Yoann Dieudonné, Vincent Villain, Florence Levé
Publication date: 16 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.033
Related Items
Distributed computing by mobile robots: uniform circle formation, The “Runs” Theorem, Explicit Communication Among Stigmergic Robots
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Circle formation of weak robots and Lyndon words
- A public key cryptosystem based on Lyndon words
- Local spreading algorithms for autonomous robot systems
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Coordination without communication: the case of the flocking problem
- Periodic musical sequences and Lyndon words
- Distributed Computing by Mobile Robots: Gathering
- Design and Analysis of Distributed Algorithms
- Leader Election Problem versus Pattern Formation Problem
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Structural Information and Communication Complexity