Data Collection in Population Protocols with Non-uniformly Random Scheduler
From MaRDI portal
Publication:5056046
DOI10.1007/978-3-319-72751-6_2zbMath1503.68025OpenAlexW2779439838MaRDI QIDQ5056046
Chuan Xu, Shay Kutten, Thomas Nowak, Janna Burman, Joffroy Beauquier
Publication date: 9 December 2022
Published in: Algorithms for Sensor Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-72751-6_2
random schedulerexpected convergence timeclassical coupon collectorgood time complexityprotocol population
Related Items (2)
Data Collection in Population Protocols with Non-uniformly Random Scheduler ⋮ Data collection in population protocols with non-uniformly random scheduler
Cites Work
- Unnamed Item
- A simple population protocol for fast robust approximate majority
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Computation in networks of passively mobile finite-state sensors
- The coupon subset collection problem
- Fast and Exact Majority in Population Protocols
- The collector's problem with group drawings
- Fast Computation by Population Protocols with a Leader
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Time-Space Trade-offs in Population Protocols
- Introduction to Distributed Algorithms
- Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- Data Collection in Population Protocols with Non-uniformly Random Scheduler
- On utilizing speed in networks of mobile agents
- Coupon collector's problem with unlike probabilities
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
- Computation in networks of passively mobile finite-state sensors
This page was built for publication: Data Collection in Population Protocols with Non-uniformly Random Scheduler
