Running time analysis of broadcast consensus protocols
From MaRDI portal
Publication:2233402
Cites work
- scientific article; zbMATH DE number 5605125 (Why is no real title available?)
- scientific article; zbMATH DE number 1954380 (Why is no real title available?)
- scientific article; zbMATH DE number 2080048 (Why is no real title available?)
- scientific article; zbMATH DE number 6850453 (Why is no real title available?)
- scientific article; zbMATH DE number 1392309 (Why is no real title available?)
- scientific article; zbMATH DE number 7204593 (Why is no real title available?)
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Brief Announcement
- Clocked population protocols
- Computation in networks of passively mobile finite-state sensors
- Controlling a population
- Fast and exact majority in population protocols
- Fast computation by population protocols with a leader
- Fast space optimal leader election in population protocols
- Large flocks of small birds: on the minimal size of population protocols
- Leader election requires logarithmic time in population protocols
- Mediated population protocols
- On read-once vs. multiple access to randomness in logspace
- Optimal time and space leader election in population protocols
- Semigroups, Presburger formulas, and languages
- Stably computable predicates are semilinear
- Tail bounds for sums of geometric and exponential variables
- The power of well-structured systems
- Time-space trade-offs in population protocols
This page was built for publication: Running time analysis of broadcast consensus protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233402)
