Reservoir-sampling algorithms of time complexity O ( n (1 + log( N / n )))

DOI10.1145/198429.198435zbMath0889.65147OpenAlexW2027002571MaRDI QIDQ4371721

No author found.

Publication date: 25 January 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1994-20/

zbMATH Keywords

reservoir-sampling algorithms

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Probabilistic methods, stochastic differential equations (65C99)

Related Items (6)

Hierarchical and modularly-minimal vertex colorings ⋮ Optimal sampling from sliding windows ⋮ Weighted sampling without replacement from data streams ⋮ Sampling in space restricted settings ⋮ Sampling streaming data with replacement ⋮ Weighted random sampling with a reservoir

Uses Software

• IMSL Numerical Libraries

This page was built for publication: Reservoir-sampling algorithms of time complexity O ( n (1 + log( N / n )))