📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time (2017)

First Author: Bilke A

Attributed to: Randomized Algorithms for Computer Networks funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1705.01146

Publication URI: https://arxiv.org/abs/1705.01146

Type: Preprint