Public vs. private randomness in simultaneous multi-party communication complexity

DOI10.1016/j.tcs.2018.04.032zbMath1437.68066OpenAlexW2886079474MaRDI QIDQ2292918

Orr Fischer, Rotem Oshman, Uri Zwick

Publication date: 6 February 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.04.032

zbMATH Keywords

multi-party communication complexitycommunication complexitynumber in handsimultaneous communication complexity

Mathematics Subject Classification ID

Privacy of data (68P27) Communication complexity, information complexity (68Q11)

Cites Work

• Private vs. common random bits in communication complexity
• Communication complexity in a 3-computer model
• The Simultaneous Communication of Disjointness with Applications to Data Streams
• Communication Complexity of Simultaneous Messages
• Communication Complexity
• The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Public vs. private randomness in simultaneous multi-party communication complexity