Skip to main content
SpringerLink
Log in

A flexible way of counting large numbers approximately in small registers

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Robert Morris invented a novel, simple probabilistic algorithm for keeping approximate counts of large numbers of events, using small registers. One application is counting the number assigned to each of many categories of a very large number of events. We introduce a new, flexible approach to Morris' method of approximate counting, and provide some analysis of the performance to be expected.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Flajolet, P., Approximate counting: a detailed analysis,BIT,25 (1984), 113–134.

    Article  MathSciNet  Google Scholar 

  2. Flajolet, P., and Martin, G. N., Probabilistic counting,Proceedings of the 24th Annual Symposium on Foundations of Computer Science, November 1983, pp. 76–82.

  3. Flajolet, P., and Martin, G. N., Probabilistic counting algorithms for data base applications,Journal of Computer and System Sciences,31 (1985), 182–209.

    Article  MATH  MathSciNet  Google Scholar 

  4. Kurtz, T., and Manber, U., A probabilistic distributed algorithm for set intersection and its analysis,Proceedings of the International Colloquium on Automata Languages and Programming (ICALP85), Nafplion, Greece, Lecture Notes in Computer Science, vol. 194, Springer-Verlag, Berlin, July 1985, pp. 356–362.

    Google Scholar 

  5. Morris, R., Counting large numbers of events in small registers,Communications of the ACM,21 (1976), 840–842.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Bell Laboratories, 07974, Murray Hill, NJ, USA

    J. B. Kruskal & A. G. Greenberg

Authors
  1. J. B. Kruskal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. G. Greenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Philippe Flajolet.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kruskal, J.B., Greenberg, A.G. A flexible way of counting large numbers approximately in small registers. Algorithmica 6, 590–596 (1991). https://doi.org/10.1007/BF01759062

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01759062

Keywords

Search

Navigation