Simple and Fast Approximate Counting and Leader Election in Populations

Lecture Notes in Computer Science - Stabilization, Safety, and Security of Distributed Systems ◽

10.1007/978-3-030-03232-6_11 ◽

2018 ◽

pp. 154-169 ◽

Cited By ~ 2

Author(s):

Othon Michail ◽

Paul G. Spirakis ◽

Michail Theofilatos

Keyword(s):

Leader Election ◽

Approximate Counting

Download Full-text

Simple and fast approximate counting and leader election in populations

Information and Computation ◽

10.1016/j.ic.2021.104698 ◽

2021 ◽

pp. 104698

Author(s):

Othon Michail ◽

Paul G. Spirakis ◽

Michail Theofilatos

Keyword(s):

Leader Election ◽

Approximate Counting

Download Full-text

Brief Announcement: Fast Approximate Counting and Leader Election in Populations

Structural Information and Communication Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-030-01325-7_7 ◽

2018 ◽

pp. 38-42

Author(s):

Othon Michail ◽

Paul G. Spirakis ◽

Michail Theofilatos

Keyword(s):

Leader Election ◽

Approximate Counting

Download Full-text

Self-Stabilizing Leader Election in Regular Graphs

Proceedings of the 39th Symposium on Principles of Distributed Computing ◽

10.1145/3382734.3405733 ◽

2020 ◽

Cited By ~ 1

Author(s):

Hsueh-Ping Chen ◽

Ho-Lin Chen

Keyword(s):

Leader Election ◽

Regular Graphs

Download Full-text

Deterministic Leader Election in Anonymous Radio Networks

Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures ◽

10.1145/3350755.3400276 ◽

2020 ◽

Author(s):

Avery Miller ◽

Andrzej Pelc ◽

Ram Narayan Yadav

Keyword(s):

Radio Networks ◽

Leader Election

Download Full-text

Time-Optimal Self-Stabilizing Leader Election in Population Protocols

Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing ◽

10.1145/3465084.3467898 ◽

2021 ◽

Author(s):

Janna Burman ◽

Ho-Lin Chen ◽

Hsueh-Ping Chen ◽

David Doty ◽

Thomas Nowak ◽

...

Keyword(s):

Leader Election ◽

Population Protocols ◽

Time Optimal

Download Full-text

Fair Leader Election for Rational Agents in Asynchronous Rings and Networks

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18 ◽

10.1145/3212734.3212767 ◽

2018 ◽

Cited By ~ 3

Author(s):

Assaf Yifrach ◽

Yishay Mansour

Keyword(s):

Leader Election ◽

Rational Agents

Download Full-text

Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election

Journal of the ACM ◽

10.1145/3424659 ◽

2021 ◽

Vol 68 (1) ◽

pp. 1-21

Author(s):

Leszek Gąsieniec ◽

Grzegorz Stachowiak

Keyword(s):

Leader Election ◽

Population Protocols

Download Full-text

Top K-Leader Election in Wireless Ad Hoc Networks

2008 Proceedings of 17th International Conference on Computer Communications and Networks ◽

10.1109/icccn.2008.ecp.35 ◽

2008 ◽

Cited By ~ 11

Author(s):

V. Raychoudhury ◽

Jiannong Cao ◽

Weigang Wu

Keyword(s):

Ad Hoc Networks ◽

Wireless Ad Hoc Networks ◽

Ad Hoc ◽

Leader Election ◽

Hoc Networks

Download Full-text

Average Execution Time Analysis of a Self-stabilizing Leader Election Algorithm

2007 IEEE International Parallel and Distributed Processing Symposium ◽

10.1109/ipdps.2007.370455 ◽

2007 ◽

Author(s):

Juan Paulo Alvarado-Magana ◽

Jose Alberto Fernandez-Zepeda

Keyword(s):

Execution Time ◽

Leader Election ◽

Time Analysis ◽

Election Algorithm ◽

Leader Election Algorithm

Download Full-text

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

2010 IEEE 25th Annual Conference on Computational Complexity ◽

10.1109/ccc.2010.13 ◽

2010 ◽

Cited By ~ 1

Author(s):

Dan Gutfreund ◽

Akinori Kawachi

Keyword(s):

Lower Bounds ◽

Approximate Counting ◽

Exponential Size

Download Full-text