Distributed computation of the mode

From MaRDI portal

Revision as of 20:15, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2934328

Jump to:navigation, search

DOI10.1145/1400751.1400756zbMath1301.68258OpenAlexW2157070369MaRDI QIDQ2934328

Fabian Kuhn, Stefan Schmid, Thomas Locher

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

aggregation distributed algorithms mode most frequent element

Mathematics Subject Classification ID

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

Related Items (2)

Distributed Graph Algorithms and their Complexity: An Introduction ⋮ The Complexity of Data Aggregation in Directed Networks

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2934328&oldid=15920579"