Distinct Elements Estimation is a computational problem in sublinear algorithms that seeks to approximate the number of distinct elements in a data stream using an algorithm whose space complexity is strictly sublinear in the size of the input domain.
50
Publications
2.5K
Citations
110
Authors
67
Institutions
Publications per year
2017–2026
9
Parents
Publications
50
An optimal algorithm for the distinct elements problem
Daniel M. Kane, Jelani Nelson, David P. Woodruff · 2010 · 323 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 50
Authors
110
- YZ
4
h-index
- SC
4
h-index
- DP
4
h-index
- ST
3
h-index
- PJ
3
h-index
1–5 of 110
Institutions
67
IBM Research - Almaden
San Jose, United States
5 h-index
12 publications
1.2K citations
University of Florida
Gainesville, United States
4 h-index
12 publications
316 citations
IBM (United States)
Armonk, United States
3 h-index
5 publications
462 citations
Google (United States)
Mountain View, United States
3 h-index
7 publications
239 citations
Stanford University
Stanford, United States
2 h-index
4 publications
366 citations
Technische Universität Dresden
Dresden, Germany
2 h-index
3 publications
233 citations
Philadelphia University
Philadelphia, United States
2 h-index
4 publications
308 citations
Southeast University
Nanjing, China
2 h-index
3 publications
118 citations
1–8 of 67
Venues
- SIAM Journal on Computing
3 publications · 166 citations
3
h-index
- Theoretical Computer Science
2 publications · 77 citations
2
h-index
- IEEE/ACM Transactions on Networking
TON · 1 publications · 36 citations
1
h-index
- Advanced Powder Technology
1 publications · 20 citations
1
h-index
- Geophysical Journal International
GJI · 1 publications · 39 citations
1
h-index
1–5