How Many Cooks Spoil the Soup?
From MaRDI portal
Publication:2835012
DOI10.1007/978-3-319-48314-6_1zbMath1482.68057arXiv1604.07187OpenAlexW2891097903MaRDI QIDQ2835012
Othon Michail, Paul G. Spirakis
Publication date: 1 December 2016
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.07187
Related Items (1)
Cites Work
- Deterministic function computation with chemical reaction networks
- Mediated population protocols
- Passively mobile communicating machines that use restricted space
- Probabilistic quorum systems
- The computational power of population protocols
- Computation in networks of passively mobile finite-state sensors
- Survey of local algorithms
- Distributed computation in dynamic networks
- On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols
- Polylogarithmic-Time Leader Election in Population Protocols
- Atomic snapshots of shared memory
- Distributed Computing: A Locality-Sensitive Approach
- Sense of direction: Definitions, properties, and classes
- Leaderless Deterministic Chemical Reaction Networks
- Speed Faults in Computation by Chemical Reaction Networks
- Byzantine agreement with homonyms
- Simple and efficient local codes for distributed stable network construction
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: How Many Cooks Spoil the Soup?
