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

DOI10.1007/978-3-319-48314-6_5zbMATH Open1437.68065OpenAlexW2547025167MaRDI QIDQ2835017FDOQ2835017

Authors: Orr Fischer, Rotem Oshman, Uri Zwick 

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

Recommendations

• Public vs. private randomness in simultaneous multi-party communication complexity
• scientific article; zbMATH DE number 1769898
• Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
• The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism
• scientific article; zbMATH DE number 1256775

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Communication Complexity
• Communication Complexity of Simultaneous Messages
• Communication complexity in a 3-computer model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism
• The Simultaneous Communication of Disjointness with Applications to Data Streams

Cited In (8)

• On the role of shared randomness in simultaneous communication
• Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
• Title not available (Why is that?)
• Forward induction and public randomization
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism
• The role of randomness in the broadcast congested clique model
• Public vs. private randomness in simultaneous multi-party communication complexity

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

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