Pages that link to "Item:Q3579208"
From MaRDI portal
The following pages link to Space lower bounds for distance approximation in the data stream model (Q3579208):
Displayed 13 items.
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- An information statistics approach to data stream and communication complexity (Q598248) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- Sketching information divergences (Q1009269) (← links)
- Hierarchical sampling from sketches: Estimating functions over data streams (Q1016526) (← links)
- Finding frequent items in data streams (Q1884870) (← links)
- Trading information complexity for error. II: The case of a large error and the external information complexity (Q2105437) (← links)
- Finding longest increasing and common subsequences in streaming data (Q2498982) (← links)
- The Andoni–Krauthgamer–Razenshteyn Characterization of Sketchable Norms Fails for Sketchable Metrics (Q3384132) (← links)
- The Simultaneous Communication of Disjointness with Applications to Data Streams (Q3448862) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity (Q4933374) (← links)
- Communication Lower Bounds Via the Chromatic Number (Q5458837) (← links)