Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity

DOI10.1007/978-3-319-48314-6_5zbMath1437.68065OpenAlexW2547025167MaRDI QIDQ2835017

Uri Zwick, Orr Fischer, Rotem Oshman

Publication date: 1 December 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48314-6_5

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ The role of randomness in the broadcast congested clique model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity