The Synergy of Finite State Machines
From MaRDI portal
Publication:5091099
DOI10.4230/LIPIcs.OPODIS.2018.22OpenAlexW2912699150MaRDI QIDQ5091099
Yehuda Afek, Noa Kolikant, Yuval Emek
Publication date: 21 July 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/10082/pdf/LIPIcs-OPODIS-2018-22.pdf/
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How many ants does it take to find the food?
- Symmetry breaking in distributed networks
- Dynamic networks of finite state machines
- Computation in networks of passively mobile finite-state sensors
- Beeping a maximal independent set
- On the Runtime of Universal Coating for Programmable Matter
- Collaborative search on the plane without communication
- Anonymous networks
- Leader Election and Shape Formation with Self-organizing Programmable Matter
- A Biological Solution to a Fundamental Distributed Computing Problem
- Deploying Wireless Networks with Beeps
- Complexity of network synchronization
- Distributed Computing: A Locality-Sensitive Approach
- Exploring an Infinite Space with Finite Memory Scouts
- Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
- Solving the ANTS Problem with Asynchronous Finite State Machines
- Stone age distributed computing
- A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems
- Timing in chemical reaction networks
- How Many Ants Does It Take to Find the Food?
This page was built for publication: The Synergy of Finite State Machines
