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"

3 / 3 papers shown
Title
Stable Leader Election in Population Protocols Requires Linear Time
Stable Leader Election in Population Protocols Requires Linear Time
David Doty
D. Soloveichik
39
112
0
14 Feb 2015
Determining Majority in Networks with Local Interactions and very Small
  Local Memory
Determining Majority in Networks with Local Interactions and very Small Local Memory
George B. Mertzios
Sotiris E. Nikoletseas
Christoforos L. Raptopoulos
Paul G. Spirakis
53
96
0
30 Apr 2014
Tight Bounds for Randomized Load Balancing on Arbitrary Network
  Topologies
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies
Thomas Sauerwald
He Sun
69
54
0
13 Jan 2012
1