New bounds for the flock-of-birds problem

DOI10.1007/978-3-031-09574-0_14MaRDI QIDQ2097227zbMATH OpenOpenAlexFDO

Authors Alexander Kozachinskiy

Publication date 11 November 2022

Full work available at URL https://arxiv.org/abs/2110.12452

zbMATH Keywords

population protocolsPresburger arithmeticthreshold predicates

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• scientific article; zbMATH DE number 5605125 (Why is no real title available?)
• Large flocks of small birds: on the minimal size of population protocols
• Succinct Population Protocols for Presburger Arithmetic
• The computational power of population protocols
• Time-space trade-offs in population protocols

Cited in

(1)

• Secretive birds: privacy in population protocols

This page was built for publication: New bounds for the flock-of-birds problem

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