scientific article
From MaRDI portal
Publication:3304110
DOI10.4230/LIPIcs.STACS.2018.16zbMath1487.68030arXiv1801.00742MaRDI QIDQ3304110
Michael Blondin, Stefan Jaax, Javier Esparza
Publication date: 5 August 2020
Full work available at URL: https://arxiv.org/abs/1801.00742
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Network protocols (68M12)
Related Items (12)
Population protocols with unreliable communication ⋮ Lower bounds on the state complexity of population protocols ⋮ Fast and succinct population protocols for Presburger arithmetic ⋮ Brief Announcement: Population Protocols Decide Double-exponential Thresholds ⋮ Population protocols: beyond runtime analysis ⋮ Running time analysis of broadcast consensus protocols ⋮ Verification of Immediate Observation Population Protocols ⋮ Automatic Analysis of Expected Termination Time for Population Protocols ⋮ The complexity of verifying population protocols ⋮ Clocked population protocols ⋮ Towards efficient verification of population protocols ⋮ New bounds for the flock-of-birds problem
Cites Work
- Verification of population protocols
- Mediated population protocols
- Computation with finite stochastic chemical reaction networks
- The covering and boundedness problems for vector addition systems
- Population protocols with faulty interactions: the impact of a leader
- The complexity of the word problems for commutative semigroups and polynomial ideals
- The computational power of population protocols
- Fast computation by population protocols with a leader
- Fast and Exact Majority in Population Protocols
- Time-Space Trade-offs in Population Protocols
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
- Clocked Population Protocols
- Brief Announcement
- Computation in networks of passively mobile finite-state sensors
- Stable leader election in population protocols requires linear time
This page was built for publication:
