Fast and succinct population protocols for Presburger arithmetic
From MaRDI portal
Publication:6142599
DOI10.1016/j.jcss.2023.103481arXiv2202.11601MaRDI QIDQ6142599
Martin Helfrich, Philipp Czerner, Javier Esparza, Roland Guttenberg
Publication date: 4 January 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.11601
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Understanding and using linear programming
- Computation with finite stochastic chemical reaction networks
- The computational power of population protocols
- Time-space trade-offs in population protocols for the majority problem
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Fast and Exact Majority in Population Protocols
- On the complexity of integer programming
- Time-Space Trade-offs in Population Protocols
- Optimal time and space leader election in population protocols
- Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols
- Brief Announcement
- Computation in networks of passively mobile finite-state sensors
- Succinct Population Protocols for Presburger Arithmetic
- Expressive Power of Broadcast Consensus Protocols
- Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks
This page was built for publication: Fast and succinct population protocols for Presburger arithmetic
