Approximate counting algorithm

id: approximate-counting-algorithm-192-252591
title: Approximate counting algorithm
text: 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. It was fully analyzed in the early 1980s by Philippe Flajolet of INRIA Rocquencourt, who coined the name approximate counting, and strongly contributed to its recognition among the research community. When focused on high quality of approximation and low probability of failure,
brand slug: wiki
category slug: encyclopedia
description:
original url: https://en.wikipedia.org/wiki/Approximate_counting_algorithm
date created:
date modified: 2023-07-21T20:21:11Z
main entity: {"identifier":"Q4781762","url":"https://www.wikidata.org/entity/Q4781762"}
image:
fields total: 13
integrity: 13

Related Entries

Explore Next Part