REVIEW 1 cited by
Leader Election Requires Logarithmic Time in Population Protocols
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Leader Election Requires Logarithmic Time in Population Protocols
read the original abstract
This paper shows that every leader election protocol requires logarithmic stabilization time both in expectation and with high probability in the population protocol model. This lower bound holds even if each agent has knowledge of the exact size of a population and is allowed to use an arbitrarily large number of agent states. This lower bound concludes that the protocol given in [Sudo et al., SSS 2019] is time-optimal in expectation.
Forward citations
Cited by 1 Pith paper
-
Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs
In two random temporal graph models, each fixed δ-temporal motif has an existence threshold determined by the sparsity min |V|/(|E|−1) over subgraphs.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.