ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1705.01146
  4. Cited By
Population protocols for leader election and exact majority with O(log^2
  n) states and O(log^2 n) convergence time

Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time

2 May 2017
Andreas Bilke
C. Cooper
Robert Elsässer
T. Radzik
ArXiv (abs)PDFHTML

Papers citing "Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time"

5 / 5 papers shown
Title
Uniform Partition in Population Protocol Model under Weak Fairness
Uniform Partition in Population Protocol Model under Weak Fairness
Hiroto Yasumi
Fukuhito Ooshita
M. Inoue
61
3
0
12 Nov 2019
Leader Election Requires Logarithmic Time in Population Protocols
Leader Election Requires Logarithmic Time in Population Protocols
Y. Sudo
Toshimitsu Masuzawa
116
17
0
25 Jun 2019
Communication cost of consensus for nodes with limited memory
Communication cost of consensus for nodes with limited memory
Giulia Fanti
N. Holden
Yuval Peres
G. Ranade
53
9
0
07 Jan 2019
Logarithmic Expected-Time Leader Election in Population Protocol Model
Logarithmic Expected-Time Leader Election in Population Protocol Model
Y. Sudo
Fukuhito Ooshita
Taisuke Izumi
H. Kakugawa
Toshimitsu Masuzawa
93
23
0
29 Dec 2018
Space-Optimal Majority in Population Protocols
Space-Optimal Majority in Population Protocols
Dan Alistarh
J. Aspnes
Rati Gelashvili
92
109
0
17 Apr 2017
1