Approximate Counting
Approximate Counting is a probabilistic algorithmic technique in sublinear algorithms that belongs to the class of streaming algorithms, distinguished by its ability to estimate the number of distinct elements or events in a data stream using significantly less memory than exact counting, typically with bounded approximation error.
174
Publications
12.4K
Citations
330
Authors
161
Institutions
Publications per year
2017–2026
38
Parents
174
Probabilistic Inference Using Markov Chain Monte Carlo Methods
Radford M. Neal · 2011 · 1.1K citations
Maintaining Stream Statistics over Sliding Windows
Mayur Datar, Aristides Gionis, Piotr Indyk et al. · SIAM Journal on Computing · 2002 · 846 citations
1–5 of 174
330
11
h-index
7
h-index
6
h-index
5
h-index
5
h-index
1–5 of 330
161

University of Leeds
Leeds, United Kingdom
8 h-index
12 publications
605 citations

Tel Aviv University
Tel Aviv, Israel
8 h-index
12 publications
416 citations
University of California, Berkeley
Berkeley, United States
8 h-index
13 publications
983 citations
Georgia Institute of Technology
Atlanta, United States
7 h-index
11 publications
511 citations

University of Edinburgh
Edinburgh, United Kingdom
7 h-index
9 publications
2.3K citations

University of Rochester
Rochester, United States
6 h-index
10 publications
303 citations
University of Oxford
Oxford, United Kingdom
5 h-index
11 publications
347 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
6 publications
201 citations
1–8 of 161
10 publications · 1.3K citations
10
h-index
Repository · 9 publications · 189 citations
9
h-index
TALG · 5 publications · 65 citations
5
h-index
Conference · 5 publications · 153 citations
5
h-index
4 publications · 229 citations
4
h-index
1–5