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

Stable Leader Election in Population Protocols Requires Linear Time

14 February 2015
David Doty
D. Soloveichik
ArXiv (abs)PDFHTML

Papers citing "Stable Leader Election in Population Protocols Requires Linear Time"

4 / 54 papers shown
Title
Democratic, Existential, and Consensus-Based Output Conventions in
  Stable Computation by Chemical Reaction Networks
Democratic, Existential, and Consensus-Based Output Conventions in Stable Computation by Chemical Reaction Networks
R. Brijder
David Doty
D. Soloveichik
15
2
0
13 Apr 2016
Time-Space Trade-offs in Population Protocols
Time-Space Trade-offs in Population Protocols
Dan Alistarh
J. Aspnes
David Eisenstat
Rati Gelashvili
Ronald L. Rivest
OT
61
4
0
25 Feb 2016
Minimizing Message Size in Stochastic Communication Patterns: Fast
  Self-Stabilizing Protocols with 3 bits
Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits
Lucas Boczkowski
Amos Korman
Emanuele Natale
77
30
0
14 Feb 2016
Polylogarithmic-Time Leader Election in Population Protocols Using
  Polylogarithmic States
Polylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States
Dan Alistarh
Rati Gelashvili
56
0
0
19 Feb 2015
Previous
12