The following pages link to (Q4540518):
Displaying 25 items.
- Distinguishing two probability ensembles with one sample from each ensemble (Q503466) (← links)
- Communication complexity under product and nonproduct distributions (Q623504) (← links)
- The communication complexity of the Hamming distance problem (Q845704) (← links)
- A characterization of average case communication complexity (Q845939) (← links)
- A general 4-words inequality with consequences for 2-way communication complexity (Q1118569) (← links)
- Communication complexity of two decision problems (Q1201105) (← links)
- On randomized one-round communication complexity (Q1300607) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- A communication-randomness tradeoff for two-processor systems (Q1891144) (← links)
- The role of randomness in the broadcast congested clique model (Q2051760) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- Public vs. private randomness in simultaneous multi-party communication complexity (Q2292918) (← links)
- Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity (Q2835017) (← links)
- Randomized communication complexity for linear algebra problems over finite fields (Q2904786) (← links)
- Equality, Revisited (Q2946382) (← links)
- Certifying Equality With Limited Interaction. (Q2969646) (← links)
- Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729) (← links)
- Public vs. private coin flips in one round communication games. (Extended abstract) (Q4228511) (← links)
- Simultaneous multiparty communication protocols for composed functions (Q5005112) (← links)
- Optimality of linear sketching under modular updates (Q5091764) (← links)
- The Garden Hose Complexity for the Equality Function (Q5251639) (← links)
- Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
- LATIN 2004: Theoretical Informatics (Q5901664) (← links)
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols (Q6163951) (← links)