Estimating the range of a function in an online setting

DOI10.1016/S0020-0190(99)00118-0MaRDI QIDQ294695zbMATH OpenOpenAlexFDO

Authors John A. Mount

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019099001180?np=y

zbMATH Keywords

analysis of algorithmsonline algorithmspairwise independencepseudo-random generationrandomized algorithmssampling

Mathematics Subject Classification ID

Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Recommendations

• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
• Two Improved Range-Efficient Algorithms for F 0 Estimation
• Two improved range-efficient algorithms for \(F_0\) estimation
• Dealing with range anxiety in mean estimation via statistical queries
• A sample of samplers: a computational perspective on sampling

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 861531 (Why is no real title available?)
• Random generation of combinatorial structures from a uniform distribution

This page was built for publication: Estimating the range of a function in an online setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294695)