Berenbrink, PetraPetraBerenbrinkKaaser, DominikDominikKaaserRadzik, TomaszTomaszRadzik2025-02-252025-02-252019-07Proceedings of the 38th ACM Symposium on Principles of Distributed Computing: 43-52 (2019)978-1-4503-6670-0978-1-4503-6217-7https://hdl.handle.net/11420/54455We consider the problem of counting the population size in the population model. In this model, we are given a distributed system of n identical agents which interact in pairs with the goal to solve a common task. In each time step, the two interacting agents are selected uniformly at random. In this paper, we consider so-called uniform protocols, where the actions of two agents upon an interaction may not depend on the population size n. We present two population protocols to count the size of the population: protocol Approximate, which computes with high probability either [log n] or [log n], and protocol CountExact, which computes the exact population size in optimal O(log n) interactions, using Õ (n) states. Both protocols can also be converted to stable protocols that give a correct result with probability 1 by using an additional multiplicative factor of O(log n) states.enpopulation protocols | population size | counting | Computer Science - Distributed | Parallel | Cluster ComputingTechnology::600: TechnologyConference Paper10.1145/3293611.3331631905.11962v1Conference Paper