Uniform Partition in Population Protocol Model Under Weak Fairness

Hiroto Yasumi, Fukuhito Ooshita & Michiko Inoue
We focus on a uniform partition problem in a population protocol model. The uniform partition problem aims to divide a population into k groups of the same size, where k is a given positive integer. In the case of k=2 (called uniform bipartition), a previous work clarified space complexity under various assumptions: 1) an initialized base station (BS) or no BS, 2) weak or global fairness, 3) designated or arbitrary initial states of agents, and...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.