A three-party communication problem

DOI10.1006/JCSS.1998.1603MaRDI QIDQ1278045zbMATH OpenOpenAlexFDO

Authors Leonard J. Schulman

Publication date 21 February 1999

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcss.1998.1603

zbMATH Keywords

deterministic communication complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
• Lower bounds on the multiparty communication complexity
• Upper bounds on multiparty communication complexity of shifts
• Optimal lower bounds on the multiparty communication complexity

Cites work

• scientific article; zbMATH DE number 4197419 (Why is no real title available?)
• Communication Complexity

Cited in

(8)

• Estimating the density of a conditional expectation
• Algorithms and Data Structures
• Upper bounds on multiparty communication complexity of shifts
• Three messages are not optimal in worst case interactive communication
• A communication problem and directed triple systems
• Choosing, agreeing, and eliminating in communication complexity
• Mathematical Foundations of Computer Science 2005
• A 3-party simultaneous protocol for SUM-INDEX

This page was built for publication: A three-party communication problem

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