A flexible way of counting large numbers approximately in small registers

DOI10.1007/BF01759062zbMath0739.68045OpenAlexW1979975165MaRDI QIDQ1175630

Joseph B. Kruskal, Albert G. Greenberg

Publication date: 25 June 1992

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01759062

zbMATH Keywords

performance analysisapproximate counting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Asymptotic enumeration (05A16)

Cites Work

• Approximate counting: a detailed analysis
• Probabilistic counting algorithms for data base applications
• Counting large numbers of events in small registers
• Unnamed Item

This page was built for publication: A flexible way of counting large numbers approximately in small registers