Pages that link to "Item:Q598248"
From MaRDI portal
The following pages link to An information statistics approach to data stream and communication complexity (Q598248):
Displaying 48 items.
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index (Q3088117) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Relative Discrepancy Does not Separate Information and Communication Complexity (Q3448811) (← links)
- Taylor Polynomial Estimator for Estimating Frequency Moments (Q3448814) (← links)
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (Q3448852) (← links)
- The Simultaneous Communication of Disjointness with Applications to Data Streams (Q3448862) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- A Note on Estimating Hybrid Frequency Moment of Data Streams (Q3638451) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Trading information complexity for error (Q4568116) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- (Q4612484) (← links)
- Compressing Interactive Communication Under Product Distributions (Q4637503) (← links)
- The Communication Complexity of Distributed epsilon-Approximations (Q4978194) (← links)
- A candidate for a strong separation of information and communication (Q4993274) (← links)
- Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem (Q4997308) (← links)
- Exponential Separation of Communication and External Information (Q4997310) (← links)
- Continuous Monitoring of l_p Norms in Data Streams (Q5002635) (← links)
- Simultaneous multiparty communication protocols for composed functions (Q5005112) (← links)
- (Q5009503) (← links)
- A Framework for Adversarially Robust Streaming Algorithms (Q5066953) (← links)
- (Q5090444) (← links)
- Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895) (← links)
- (Q5091167) (← links)
- (Q5091258) (← links)
- (Q5091781) (← links)
- Distributed Testing of Distance-k Colorings (Q5100965) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- (Q5121897) (← links)
- On Approximating Matrix Norms in Data Streams (Q5244397) (← links)
- Fast Evaluation of Union-Intersection Expressions (Q5387808) (← links)
- Communication Lower Bounds Via the Chromatic Number (Q5458837) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- (Q5743415) (← 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)
- Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond (Q6062144) (← links)
- Secure sampling with sublinear communication (Q6114277) (← links)
- Forty years of frequent items (Q6198649) (← links)
- The work of Mark Braverman (Q6200321) (← links)
- Communication and information complexity (Q6200329) (← links)
- Constructive separations and their consequences (Q6566463) (← links)