Succinct Population Protocols for Presburger Arithmetic

DOI10.4230/LIPICS.STACS.2020.40OpenAlexW3013273637MaRDI QIDQ5874313FDOQ5874313

Authors: Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax 

Publication date: 7 February 2023

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

zbMATH Keywords

population protocolsPresburger arithmeticstate complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (7)

• Stably Computing Order Statistics with Arithmetic Population Protocols
• Fast and succinct population protocols for Presburger arithmetic
• Lower bounds on the state complexity of population protocols
• Brief Announcement: Population Protocols Decide Double-exponential Thresholds
• The complexity of verifying population protocols
• Population protocols: beyond runtime analysis
• New bounds for the flock-of-birds problem

This page was built for publication: Succinct Population Protocols for Presburger Arithmetic

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