Publication:4607897
From MaRDI portal
zbMath1403.68064arXiv1704.07649MaRDI QIDQ4607897
Grzegorz Stachowiak, Leszek Gąsieniec
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1704.07649
68Q25: Analysis of algorithms and problem complexity
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68M14: Distributed systems
68M12: Network protocols
Related Items
Unnamed Item, Unnamed Item, Leader Election Requires Logarithmic Time in Population Protocols, A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States, Simple and Efficient Leader Election, Unnamed Item, Unnamed Item, Time-space trade-offs in population protocols for the majority problem, Composable computation in discrete chemical reaction networks, Simple and fast approximate counting and leader election in populations, ppsim: a software package for efficiently simulating and visualizing population protocols, On convergence and threshold properties of discrete Lotka-Volterra population protocols, Running time analysis of broadcast consensus protocols, A survey of size counting in population protocols, Data collection in population protocols with non-uniformly random scheduler, Loosely-stabilizing leader election with polylogarithmic convergence time
