Stably Computing Order Statistics with Arithmetic Population Protocols

DOI10.4230/LIPICS.MFCS.2016.68MaRDI QIDQ4608631zbMATH OpenOpenAlexFDO

Authors George B. Mertzios, Christoforos L. Raptopoulos, Sotiris E. Nikoletseas, P. G. Spirakis

Publication date 21 March 2018

Full work available at URL https://doi.org/10.4230/LIPIcs.MFCS.2016.68

zbMATH Keywords

\(k\)-minimum elementarithmetic population protocolsmedianorder statistics

Mathematics Subject Classification ID

Order statistics; empirical distribution functions (62G30) Network protocols (68M12) Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 962463
• A Combinatorial Characterization of Self-stabilizing Population Protocols
• A combinatorial characterization of self-stabilizing population protocols
• The computational power of population protocols
• Succinct Population Protocols for Presburger Arithmetic
• Fast and exact majority in population protocols
• A self-stabilizing algorithm for the st-order problem
• Computing distributions of order statistics

This page was built for publication: Stably Computing Order Statistics with Arithmetic Population Protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608631)