Pages that link to "Item:Q2848223"
From MaRDI portal
The following pages link to How to Compress Interactive Communication (Q2848223):
Displaying 19 items.
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- Direct sum fails for zero-error average communication (Q343859) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- Information complexity and applications. (Q1731897) (← links)
- Trading information complexity for error. II: The case of a large error and the external information complexity (Q2105437) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- Fooling Pairs in Randomized Communication Complexity (Q2835016) (← links)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
- Making Randomness Public in Unbounded-Round Information Complexity (Q3194724) (← links)
- (Q4577913) (← links)
- (Q4612484) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- (Q5091221) (← links)
- (Q5091781) (← links)
- Parallel Repetition of Two-Prover One-Round Games: An Exposition (Q5135260) (← links)
- The work of Mark Braverman (Q6200321) (← links)
- Communication and information complexity (Q6200329) (← links)
