scientific article; zbMATH DE number 1769898
From MaRDI portal
Publication:4540518
Recommendations
- The communication complexity of private simultaneous messages, revisited
- The communication complexity of private simultaneous messages, revisited
- Communication Complexity of Simultaneous Messages
- scientific article; zbMATH DE number 7532
- Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation
- Publication:4508377
- On the role of shared randomness in simultaneous communication
- scientific article; zbMATH DE number 2083798
- On the message complexity of distributed problems
- Communication complexity with defective randomness
Cited in
(47)- A general 4-words inequality with consequences for 2-way communication complexity
- Communication complexity of two decision problems
- On randomized one-round communication complexity
- Quantum communication and complexity.
- A communication-randomness tradeoff for two-processor systems
- The role of randomness in the broadcast congested clique model
- On public-coin zero-error randomized communication complexity
- Simulation theorems via pseudo-random properties
- Public vs. private randomness in simultaneous multi-party communication complexity
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back
- Fooling pairs in randomized communication complexity
- Public vs. private randomness in simultaneous multi-party communication complexity
- Randomized communication complexity for linear algebra problems over finite fields
- Equality, revisited
- Certifying equality with limited interaction
- The garden-hose model
- Tight bounds on communication complexity of symmetric XOR functions in one-way and SMP models
- Solving the \textsc{induced subgraph} problem in the randomized multiparty simultaneous messages model
- scientific article; zbMATH DE number 1256775 (Why is no real title available?)
- scientific article; zbMATH DE number 1263236 (Why is no real title available?)
- Communication Complexity of Simultaneous Messages
- scientific article; zbMATH DE number 1512689 (Why is no real title available?)
- scientific article; zbMATH DE number 1559552 (Why is no real title available?)
- Simultaneous messages vs. communication
- Lower bounds for elimination via weak regularity
- scientific article; zbMATH DE number 2083798 (Why is no real title available?)
- Amortized communication complexity of an equality predicate
- Simultaneous multiparty communication protocols for composed functions
- Distinguishing two probability ensembles with one sample from each ensemble
- Half-duplex communication complexity
- Optimality of linear sketching under modular updates
- Equality alone does not simulate randomness
- On the role of shared randomness in simultaneous communication
- Simulation beats richness: new data-structure lower bounds
- The garden hose complexity for the equality function
- Unbounded-Error Classical and Quantum Communication Complexity
- Mathematical Foundations of Computer Science 2005
- Approximate F₂-Sketching of Valuation Functions
- LATIN 2004: Theoretical Informatics
- Nearly optimal property preserving hashing
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
- Communication complexity under product and nonproduct distributions
- Shared versus private randomness in distributed interactive proofs
- SNARK lower bounds via communication complexity
- Shared randomness in locally checkable problems: the role of computational assumptions
- The communication complexity of the Hamming distance problem
- A characterization of average case communication complexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540518)
