Flajolet-Martin algorithm
Flajolet-Martin algorithm proper noun: an algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption.
Proper noun
Flajolet-Martin algorithm
- An algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption.
Origin of Flajolet-Martin algorithm
Introduced by Philippe Flajolet and G. Nigel Martin in their 1984 article "Probabilistic Counting Algorithms for Data Base Applications".
Questions about Flajolet-Martin algorithm
- What does Flajolet-Martin algorithm mean?
- Flajolet-Martin algorithm means an algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption.
- What part of speech is Flajolet-Martin algorithm?
- Flajolet-Martin algorithm is a proper noun.
Words near Flajolet-Martin algorithm in the dictionary
Source and license
Adapted from Wiktionary: Flajolet-Martin algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Flajolet-Martin algorithm.” Word.ws, https://word.ws/flajolet-martin_algorithm. Based on Wiktionary, CC BY-SA 4.0.
