Distributed computation of the mode

DOI10.1145/1400751.1400756MaRDI QIDQ2934328zbMATH OpenOpenAlexFDO

Authors Fabian Kuhn, Thomas Locher, Stefan Schmid

Publication date 12 December 2014

Published in Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1400751.1400756

zbMATH Keywords

aggregationdistributed algorithmsmodemost frequent element

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• In-network estimation of frequency moments
• Finding mode using equality comparisons
• Distributing frequency-dependent data stream computations
• Distributed data summarization in well-connected networks
• A fast and simple algorithm for finding the modes of a multinomial distribution

Cited in

(6)

• Finding modes with equality comparisons
• Finding mode using equality comparisons
• The complexity of data aggregation in directed networks
• Distributed graph algorithms and their complexity: an introduction
• Distributed data summarization in well-connected networks
• Two algorithms for distributed mode computing based on blended dynamics approach

This page was built for publication: Distributed computation of the mode

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