scientific article; zbMATH DE number 6850328
From MaRDI portal
Publication:4607897
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Network protocols (68M12)
Related Items (19)
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 ⋮ Leader Election Requires Logarithmic Time in Population Protocols ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Simple and Efficient Leader Election ⋮ Running time analysis of broadcast consensus protocols ⋮ A survey of size counting in population protocols ⋮ Unnamed Item ⋮ Time-space trade-offs in population protocols for the majority problem ⋮ Unnamed Item ⋮ Data collection in population protocols with non-uniformly random scheduler ⋮ Loosely-stabilizing leader election with polylogarithmic convergence time ⋮ Message complexity of population protocols ⋮ Models of smoothing in dynamic networks ⋮ Logarithmic expected-time leader election in population protocol model ⋮ 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
This page was built for publication:
