Loosely-stabilizing phase clocks and the adaptive majority problem

DOI10.4230/LIPICS.SAND.2022.7MaRDI QIDQ7395542zbMATH OpenFDO

Authors Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser

Publication date 2022

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAND.2022.7

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites work

• A simple population protocol for fast robust approximate majority
• Approximate majority analyses using tri-molecular chemical reaction networks
• Approximate majority with catalytic inputs
• Balanced allocations: a simple proof for the heavily loaded case
• Clocked population protocols
• Comparison Dynamics in Population Protocols
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• scientific article; zbMATH DE number 6850453 (Why is no real title available?)
• Loosely-stabilizing leader election in a population protocol model
• Optimal time and space leader election in population protocols
• Probability and Computing
• Robust detection in leak-prone population protocols
• Self-stabilizing clock synchronization in the presence of Byzantine faults
• Stable leader election in population protocols requires linear time
• Stably computable predicates are semilinear
• The computational power of population protocols
• Time-Optimal Self-Stabilizing Leader Election in Population Protocols
• Time-space trade-offs in population protocols for the majority problem

This page was built for publication: Loosely-stabilizing phase clocks and the adaptive majority problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7395542)