The following pages link to (Q4440423):
Displaying 28 items.
- Estimating hybrid frequency moments of data streams (Q431931) (← links)
- Streaming techniques and data aggregation in networks of tiny artefacts (Q465668) (← links)
- Boosting distinct random sampling for basic counting on the union of distributed streams (Q497679) (← links)
- Exponential time improvement for min-wise based algorithms (Q716331) (← links)
- A second look at counting triangles in graph streams (Q740973) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- Spatially-decaying aggregation over a network (Q878748) (← links)
- Order statistics and estimating cardinalities of massive data sets (Q1003691) (← links)
- Two improved range-efficient algorithms for \(F_0\) estimation (Q1007249) (← links)
- Chebyshev polynomials, moment matching, and optimal estimation of the unseen (Q1731061) (← links)
- Sample complexity of the distinct elements problem (Q1737973) (← links)
- Better size estimation for sparse matrix products (Q2249750) (← links)
- Give me some slack: efficient network measurements (Q2272404) (← links)
- Arthur-Merlin streaming complexity (Q2347803) (← links)
- Counting distinct items over update streams (Q2371800) (← links)
- Robust lower bounds for communication and stream computation (Q2830872) (← links)
- A statistical analysis of probabilistic counting algorithms (Q2911701) (← links)
- Testing properties of collections of distributions (Q3191576) (← links)
- A Note on Estimating Hybrid Frequency Moment of Data Streams (Q3638451) (← links)
- Range‐Efficient Counting of Distinct Elements in a Massive Data Stream (Q5386204) (← links)
- Approximate set union via approximate randomization (Q5918258) (← links)
- Approximate set union via approximate randomization (Q5919116) (← links)
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. (Q6058197) (← links)
- (Q6062160) (← links)
- Revisiting maximum satisfiability and related problems in data streams (Q6199395) (← links)
- Spiking neural networks through the lens of streaming algorithms (Q6535007) (← links)
- Model counting meets \(F_0\) estimation (Q6535267) (← links)
- Adversarially robust streaming algorithms via differential privacy (Q6551258) (← links)
