Flajolet-Martin algorithm
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Introduced by Philippe Flajolet and G. Nigel Martin in their 1984 article "Probabilistic Counting Algorithms for Data Base Applications".
Proper noun[edit]
- (computing theory) An algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption.