An optimal lower bound for distinct elements in the message passing model

DOI10.1137/1.9781611973402.54MaRDI QIDQ5384015zbMATH OpenOpenAlexFDO

Authors David P. Woodruff, Qin Zhang

Publication date 20 June 2019

Published in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973402.54

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Tight bounds for distributed functional monitoring
• Communication complexity of approximate maximum matching in the message-passing model
• An information statistics approach to data stream and communication complexity
• The Simultaneous Communication of Disjointness with Applications to Data Streams
• Tribes is hard in the message passing model

Cited in

(7)

• Communication complexity of approximate maximum matching in the message-passing model
• Lower bounds for number-in-hand multiparty communication complexity, made easy
• The Range of Topological Effects on Communication
• The Communication Complexity of Distributed epsilon-Approximations
• Dense limit of the Dawid–Skene model for crowdsourcing and regions of sub-optimality of message passing algorithms
• scientific article; zbMATH DE number 7559107 (Why is no real title available?)
• The communication complexity of distributed maximization

This page was built for publication: An optimal lower bound for distinct elements in the message passing model

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