Pages that link to "Item:Q5390003"
From MaRDI portal
The following pages link to Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness (Q5390003):
Displaying 16 items.
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- Partition arguments in multiparty communication complexity (Q541668) (← links)
- Tradeoff lower lounds for stack machines (Q744614) (← links)
- Connectivity and connected components in the number-in-hand computation model (Q2086717) (← links)
- The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model (Q2817860) (← links)
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index (Q3088117) (← links)
- Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Continuous Monitoring of l_p Norms in Data Streams (Q5002635) (← links)
- (Q5090444) (← links)
- (Q5091258) (← links)
- Towards Optimal Moment Estimation in Streaming and Distributed Models (Q5875483) (← links)
- (Q5875509) (← links)
- Information complexity of the AND function in the two-party and multi-party settings (Q5919672) (← links)
- Forty years of frequent items (Q6198649) (← links)
