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. 1906.11121
  4. Cited By
Leader Election Requires Logarithmic Time in Population Protocols
v1v2v3v4 (latest)

Leader Election Requires Logarithmic Time in Population Protocols

25 June 2019
Y. Sudo
Toshimitsu Masuzawa
ArXiv (abs)PDFHTML

Papers citing "Leader Election Requires Logarithmic Time in Population Protocols"

4 / 4 papers shown
Title
Near-Optimal Leader Election in Population Protocols on Graphs
Near-Optimal Leader Election in Population Protocols on Graphs
Dan Alistarh
Joel Rybicki
S. Voitovych
106
5
0
25 May 2022
Running Time Analysis of Broadcast Consensus Protocols
Running Time Analysis of Broadcast Consensus Protocols
P. Czerner
Stefan Jaax
73
0
0
11 Jan 2021
Time-optimal self-stabilizing leader election in population protocols
Time-optimal self-stabilizing leader election in population protocols
Janna Burman
Ho-Lin Chen
Hsueh-Ping Chen
David Doty
Thomas Nowak
Eric E. Severson
Chuan Xu
113
29
0
13 Jul 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
99
23
0
29 Dec 2018
1