Scalable byzantine reliable broadcast (extended version)
Byzantine reliable broadcast is a powerful primitive that allows a set of processes to agree
on a message from a designated sender, even if some processes (including the sender) are …
on a message from a designated sender, even if some processes (including the sender) are …
Space-optimal majority in population protocols
Population protocols are a popular model of distributed computing, in which n agents with
limited local state interact randomly, and cooperate to collectively compute global …
limited local state interact randomly, and cooperate to collectively compute global …
Fast space optimal leader election in population protocols
L Gasieniec, G Stachowiak - arXiv preprint arXiv:1704.07649, 2017 - arxiv.org
The model of population protocols refers to the growing in popularity theoretical framework
suitable for studying pairwise interactions within a large collection of simple …
suitable for studying pairwise interactions within a large collection of simple …
Almost logarithmic-time space optimal leader election in population protocols
The model of population protocols refers to a large collection of simple indistinguishable
entities, frequently called\em agents. The agents communicate and perform computation …
entities, frequently called\em agents. The agents communicate and perform computation …
Recent algorithmic advances in population protocols
D Alistarh, R Gelashvili - ACM SIGACT News, 2018 - dl.acm.org
Population protocols are a popular model of distributed computing, introduced by Angluin,
Aspnes, Diamadi, Fischer, and Peralta [6] a little over a decade ago. In the meantime, the …
Aspnes, Diamadi, Fischer, and Peralta [6] a little over a decade ago. In the meantime, the …
A Population Protocol for Exact Majority with O (log5/3 n) Stabilization Time and Theta (log n) States
P Berenbrink, R Elsässer, T Friedetzky… - 32nd International …, 2018 - drops.dagstuhl.de
A population protocol is a sequence of pairwise interactions of n agents. During one
interaction, two randomly selected agents update their states by applying a deterministic …
interaction, two randomly selected agents update their states by applying a deterministic …
Nearly-tight analysis for 2-choice and 3-majority consensus dynamics
M Ghaffari, J Lengler - Proceedings of the 2018 ACM Symposium on …, 2018 - dl.acm.org
We present improved analyses for two of the well-studied randomized dynamics of
stabilizing consensus, namely 2-choice and 3-majority. The resulting bounds are tight up to …
stabilizing consensus, namely 2-choice and 3-majority. The resulting bounds are tight up to …
Asynchronous opinion dynamics in social networks
Opinion spreading in a society decides the fate of elections, the success of products, and the
impact of political or social movements. A prominent model to study opinion formation …
impact of political or social movements. A prominent model to study opinion formation …
Fast plurality consensus in regular expanders
Pull voting is a classic method to reach consensus among $ n $ vertices with differing
opinions in a distributed network: each vertex at each step takes on the opinion of a random …
opinions in a distributed network: each vertex at each step takes on the opinion of a random …
Enhanced phase clocks, population protocols, and fast space optimal leader election
L Gąsieniec, G Stachowiak - Journal of the ACM (JACM), 2020 - dl.acm.org
The model of population protocols refers to the growing in popularity theoretical framework
suitable for studying pairwise interactions within a large collection of simple …
suitable for studying pairwise interactions within a large collection of simple …