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. 1802.06867
  4. Cited By
Almost logarithmic-time space optimal leader election in population
  protocols

Almost logarithmic-time space optimal leader election in population protocols

19 February 2018
L. Gąsieniec
Grzegorz Stachowiak
P. Uznański
ArXivPDFHTML

Papers citing "Almost logarithmic-time space optimal leader election in population protocols"

9 / 9 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
50
5
0
25 May 2022
Byzantine-Resilient Population Protocols
Byzantine-Resilient Population Protocols
C. Busch
Dariusz R. Kowalski
29
0
0
15 May 2021
A stable majority population protocol using logarithmic time and states
David Doty
Mahsa Eftekhari
Eric E. Severson
32
6
0
31 Dec 2020
An $O(\log^{3/2}n)$ Parallel Time Population Protocol for Majority with
  $O(\log n)$ States
An O(log⁡3/2n)O(\log^{3/2}n)O(log3/2n) Parallel Time Population Protocol for Majority with O(log⁡n)O(\log n)O(logn) States
Stav Ben-Nun
T. Kopelowitz
Matan Kraus
E. Porat
OT
31
24
0
25 Nov 2020
Time and Space Optimal Exact Majority Population Protocols
Leszek Gkasieniec
Grzegorz Stachowiak
P. Uznański
OT
30
3
0
14 Nov 2020
A Distributed Hierarchy Framework for Enhancing Cyber Security of
  Control Center Applications
A Distributed Hierarchy Framework for Enhancing Cyber Security of Control Center Applications
Kuraganti Chetan Kumar
Paul Robert Bryan
G. Gurrala
Ashish Joglekar
Arun Babu Puthuparambil
R. Sundaresan
Himanshu Tyagi
17
1
0
10 Oct 2020
Approximate Majority With Catalytic Inputs
Approximate Majority With Catalytic Inputs
Talley Amir
J. Aspnes
John Lazarsfeld
44
3
0
18 Sep 2020
Leader Election Requires Logarithmic Time in Population Protocols
Leader Election Requires Logarithmic Time in Population Protocols
Y. Sudo
Toshimitsu Masuzawa
44
16
0
25 Jun 2019
A population protocol for exact majority with $O(\log^{5/3} n)$
  stabilization time and asymptotically optimal number of states
A population protocol for exact majority with O(log⁡5/3n)O(\log^{5/3} n)O(log5/3n) stabilization time and asymptotically optimal number of states
Petra Berenbrink
Robert Elsässer
T. Friedetzky
Dominik Kaaser
Peter Kling
T. Radzik
40
22
0
14 May 2018
1