Approximate counting algorithm

The approximate counting algorithm allows the counting of a large number of events using a small amount of memory. Invented in 1977 by Robert Morris of Bell Labs, it uses probabilistic techniques to increment the counter.

Source: Wikipedia — Approximate counting algorithm (CC BY-SA 4.0)

Approximate counting algorithm

The approximate counting algorithm allows the counting of a large number of events using a small amount of memory. Invented in 1977 by Robert Morris of Bell Labs, it uses probabilistic techniques to increment the counter.

Source: Wikipedia "Approximate counting algorithm" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy