Bounds on tradeoffs between randomness and communication complexity
From MaRDI portal
Publication:687507
DOI10.1007/BF01200118zbMath0783.68053MaRDI QIDQ687507
Publication date: 18 October 1993
Published in: Computational Complexity (Search for Journal in Brave)
Related Items
Bounds on tradeoffs between randomness and communication complexity, On multi-partition communication complexity
Cites Work
- Probabilistic communication complexity
- Bounds on tradeoffs between randomness and communication complexity
- Factoring polynomials using fewer random bits
- Routing, merging, and sorting on parallel models of computation
- Private vs. common random bits in communication complexity
- Randomness in interactive proofs
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- A Time-Randomness Trade-Off for Oblivious Routing
- Impossibility of distributed consensus with one faulty process
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- A Scheme for Fast Parallel Communication
- Amortized Communication Complexity
- Probability Inequalities for Sums of Bounded Random Variables