Pages that link to "Item:Q1305928"
From MaRDI portal
The following pages link to The space complexity of approximating the frequency moments (Q1305928):
Displayed 50 items.
- Finding longest increasing and common subsequences in streaming data (Q2498982) (← links)
- On graph problems in a semi-streaming model (Q2581265) (← links)
- Symmetric norm estimation and regression on sliding windows (Q2695322) (← links)
- Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy (Q2796207) (← links)
- Know When to Persist: Deriving Value from a Stream Buffer (Q2830062) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- A Statistical Analysis of Probabilistic Counting Algorithms (Q2911701) (← links)
- Indexing for summary queries (Q2943560) (← links)
- A contact detection algorithm for multi-sphere particles by means of two-level-grid-searching in DEM simulations (Q2952755) (← links)
- Periodicity and Cyclic Shifts via Linear Sketches (Q3088091) (← links)
- Almost Optimal Explicit Johnson-Lindenstrauss Families (Q3088132) (← links)
- (Q3191576) (← links)
- (Q3304130) (← links)
- The Andoni–Krauthgamer–Razenshteyn Characterization of Sketchable Norms Fails for Sketchable Metrics (Q3384132) (← links)
- Taylor Polynomial Estimator for Estimating Frequency Moments (Q3448814) (← links)
- The Simultaneous Communication of Disjointness with Applications to Data Streams (Q3448862) (← links)
- Randomized OBDD-Based Graph Algorithms (Q3460720) (← links)
- Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$ (Q3520061) (← links)
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS (Q3521590) (← links)
- Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression (Q3599110) (← links)
- A Note on Estimating Hybrid Frequency Moment of Data Streams (Q3638451) (← links)
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING (Q3647614) (← links)
- Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8 (Q4562282) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions (Q4915250) (← links)
- Space‐efficient tracking of persistent items in a massive data stream (Q4969927) (← links)
- Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) (← links)
- (Q4998940) (← links)
- (Q4999010) (← links)
- Continuous Monitoring of l_p Norms in Data Streams (Q5002635) (← links)
- High Probability Frequency Moment Sketches (Q5002734) (← links)
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams (Q5002743) (← links)
- (Q5009513) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- A Framework for Adversarially Robust Streaming Algorithms (Q5066953) (← links)
- Median-of-means approach for repeated measures data (Q5078874) (← links)
- Optimal (Euclidean) Metric Compression (Q5080486) (← links)
- Depth First Search in the Semi-streaming Model (Q5090492) (← links)
- Two Party Distribution Testing: Communication and Security (Q5091163) (← links)
- Quantum Chebyshev's Inequality and Applications (Q5091227) (← links)
- Optimality of linear sketching under modular updates (Q5091764) (← links)
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing (Q5098771) (← links)
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet (Q5111729) (← links)
- (Q5121896) (← links)
- (Q5149262) (← links)
- Verifiable Stream Computation and Arthur--Merlin Communication (Q5232326) (← links)
- On Approximating Matrix Norms in Data Streams (Q5244397) (← links)
- Fast Private Norm Estimation and Heavy Hitters (Q5445506) (← links)
- (Q5875509) (← links)