On parallel time in population protocols

DOI10.1016/j.ipl.2022.106314OpenAlexW4293574578MaRDI QIDQ2094385

Andrzej Lingas, Artur Czumaj

Publication date: 28 October 2022

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

directed acyclic graphdistributed computingrandomized algorithmspopulation protocolsparallel time complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deriving global virtual time algorithms from conservative simulation protocols
• A note on the majority dynamics in inhomogeneous random graphs
• Computation in networks of passively mobile finite-state sensors
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• On the Expected Depth of Random Circuits
• Optimal time and space leader election in population protocols

This page was built for publication: On parallel time in population protocols