Optimal Bounds for Approximate Counting
Summary: Randomized space Θ(log log N + log(1/ε) + log log(1/δ)) bits suffices for (1+ε)-approximate counting w.p. 1−δ, exponentially improving prior log(1/δ) dependence. Also shows Morris Counter (with minor tweak) attains this and proves a matching lower bound (optimal up to ≤3+o(1) factor) with explicit constants. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jelani Nelson
- 2. Huacheng Yu
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,004 | Finding Heavy-Hitters with Optimal State Changes | 2026 | PODS | 5.1725247e-05 |
| 10,874 | PolyBase: Adapting to Data Affinity Changes in Geo-Replicated Database via Row-Level Consensus-Group Affiliation Re-Assignment | 2025 | VLDB | 5.1725247e-05 |
| 10,905 | Streaming Algorithms with Few State Changes | 2024 | PODS | 5.1725247e-05 |
| 11,172 | Applications of Sketching and Pathways to Impact | 2023 | PODS | 5.1725247e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 447 | Mergeable Summaries | 2012 | PODS | 0.00018364636 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,568 | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model | 2019 | PODS | 5.6519497e-05 |
| 6,321 | An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems | 2016 | PODS | 5.9738105e-05 |
| 83 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD | 0.00036461682 |
| 6,759 | Continuous Distributed Counting for Non-monotonic Streams | 2012 | PODS | 5.8386832e-05 |
| 5,556 | A Tight Lower Bound for Comparison-Based Quantile Summaries | 2020 | PODS | 6.2357201e-05 |
| 11,323 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS | 5.1725247e-05 |
| 4,425 | Relative Error Streaming Quantiles | 2021 | PODS | 6.7704846e-05 |
| 4,124 | Towards Tight Bounds for the Streaming Set Cover Problem | 2016 | PODS | 6.9485903e-05 |
| 1,643 | Space-optimal Heavy Hitters with Strong Error Bounds | 2009 | PODS | 0.00010200355 |
| 680 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS | 0.00015150785 |