Distinct Elements Counting is a fundamental computational problem in the field of streaming algorithms that involves determining the number of unique elements in a data stream using limited memory and a small number of passes over the input.
55
Publications
3K
Citations
131
Authors
69
Institutions
Publications per year
2017–2026
12
Parents
Publications
55
An optimal algorithm for the distinct elements problem
Daniel M. Kane, Jelani Nelson, David P. Woodruff · 2010 · 323 citations · Full text
Towards estimation error guarantees for distinct values
Moses Charikar, Surajit Chaudhuri, Rajeev Motwani et al. · 2000 · 233 citations · Full text
On synopses for distinct-value estimation under multiset operations
Kevin Beyer, Peter J. Haas, Berthold Reinwald et al. · 2007 · 183 citations
Philippe Flajolet, G. Nigel Martin · 1983 · 156 citations
1–5 of 55
Authors
131
- SC
4
h-index
- DP
4
h-index
- YZ
4
h-index
- MG
3
h-index
- DT
2
h-index
1–5 of 131
Institutions
69
Google (United States)
Mountain View, United States
4 h-index
10 publications
272 citations
University of Florida
Gainesville, United States
4 h-index
12 publications
316 citations
IBM Research - Almaden
San Jose, United States
4 h-index
8 publications
1.5K citations
University of Siena
Siena, Italy
2 h-index
5 publications
417 citations
Tel Aviv University
Tel Aviv, Israel
2 h-index
2 publications
86 citations
University of Leeds
Leeds, United Kingdom
2 h-index
5 publications
274 citations
Southeast University
Nanjing, China
2 h-index
3 publications
118 citations
Shanghai Jiao Tong University
Shanghai, China
2 h-index
2 publications
63 citations
1–8 of 69
Venues
- Powder Technology
3 publications · 179 citations
3
h-index
- SIAM Journal on Computing
2 publications · 136 citations
2
h-index
- Theoretical Computer Science
2 publications · 77 citations
2
h-index
- International Journal of Rock Mechanics and Mining Sciences
2 publications · 158 citations
2
h-index
- arXiv (Cornell University)
Repository · 2 publications · 41 citations
2
h-index
1–5