Running time analysis of broadcast consensus protocols

DOI10.1007/978-3-030-71995-1_9OpenAlexW3140862071MaRDI QIDQ2233402FDOQ2233402

Authors: Philipp Czerner, Stefan Jaax 

Publication date: 18 October 2021

Full work available at URL: https://arxiv.org/abs/2101.03780

zbMATH Keywords

distributed computingcomplexity theorybroadcast protocols

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Computation in networks of passively mobile finite-state sensors
• Semigroups, Presburger formulas, and languages
• Fast computation by population protocols with a leader
• Title not available (Why is that?)
• Stably computable predicates are semilinear
• Mediated population protocols
• Title not available (Why is that?)
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• On read-once vs. multiple access to randomness in logspace
• Title not available (Why is that?)
• Fast and exact majority in population protocols
• The power of well-structured systems
• Tail bounds for sums of geometric and exponential variables
• Title not available (Why is that?)
• Large flocks of small birds: on the minimal size of population protocols
• Controlling a population
• Time-space trade-offs in population protocols
• Fast space optimal leader election in population protocols
• Brief Announcement
• Clocked population protocols
• Title not available (Why is that?)
• Optimal time and space leader election in population protocols
• Leader election requires logarithmic time in population protocols

Cited In (1)

• Expressive Power of Broadcast Consensus 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)