scientific article; zbMATH DE number 6850453
From MaRDI portal
Publication:4608038
zbMath1403.68062arXiv1704.04947MaRDI QIDQ4608038
James Aspnes, Dan Alistarh, Rati Gelashvili
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1704.04947
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Network protocols (68M12)
Related Items (22)
On convergence and threshold properties of discrete Lotka-Volterra population protocols ⋮ Leader Election Requires Logarithmic Time in Population Protocols ⋮ Lower bounds on the state complexity of population protocols ⋮ Parameterized Analysis of Immediate Observation Petri Nets ⋮ Unnamed Item ⋮ Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model ⋮ Population protocols: beyond runtime analysis ⋮ Unnamed Item ⋮ Simple and Efficient Leader Election ⋮ Fault-tolerant simulation of population protocols ⋮ Expressive Power of Broadcast Consensus Protocols ⋮ Running time analysis of broadcast consensus protocols ⋮ Uniform bipartition in the population protocol model with arbitrary graphs ⋮ A survey of size counting in population protocols ⋮ Time-space trade-offs in population protocols for the majority problem ⋮ The complexity of verifying population protocols ⋮ Data collection in population protocols with non-uniformly random scheduler ⋮ Loosely-stabilizing leader election with polylogarithmic convergence time ⋮ A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States ⋮ Composable computation in discrete chemical reaction networks ⋮ Noisy rumor spreading and plurality consensus ⋮ Distributed computation with continual population growth
This page was built for publication: