Pages that link to "Item:Q5259551"
From MaRDI portal
The following pages link to Turnstile streaming algorithms might as well be linear sketches (Q5259551):
Displaying 16 items.
- The Simultaneous Communication of Disjointness with Applications to Data Streams (Q3448862) (← links)
- Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791) (← links)
- Maximum Matching in Turnstile Streams (Q3452845) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- Practical Sketching Algorithms for Low-Rank Matrix Approximation (Q4598337) (← links)
- Deterministic Heavy Hitters with Sublinear Query Time (Q5009510) (← links)
- A Framework for Adversarially Robust Streaming Algorithms (Q5066953) (← links)
- Querying a Matrix Through Matrix-Vector Products. (Q5091255) (← links)
- Optimality of linear sketching under modular updates (Q5091764) (← links)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481) (← links)
- (Q5121896) (← links)
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation (Q5230655) (← links)
- On Approximating Matrix Norms in Data Streams (Q5244397) (← links)
- Perfect $L_p$ Sampling in a Data Stream (Q5858643) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)