The Synergy of Finite State Machines
From MaRDI portal
Recommendations
Cites work
- A biological solution to a fundamental distributed computing problem
- A Markov chain algorithm for compression in self-organizing particle systems
- Anonymous networks, randomization = 2-hop coloring
- Collaborative search on the plane without communication
- Complexity of network synchronization
- Computation in networks of passively mobile finite-state sensors
- Deploying wireless networks with beeps
- Distributed Computing: A Locality-Sensitive Approach
- Exploring an infinite space with finite memory scouts
- How many ants does it take to find the food?
- How many ants does it take to find the food?
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 6784996 (Why is no real title available?)
- Introduction to algorithms.
- Leader election and shape formation with self-organizing programmable matter
- Memory lower bounds for randomized collaborative search and implications for biology
- Solving the ANTS problem with asynchronous finite state machines
- Stone age distributed computing
- Symmetry breaking in distributed networks
- Timing in chemical reaction networks
Cited in
(2)
This page was built for publication: The Synergy of Finite State Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091099)
