Back to authors
David Woodruff
- Author ID
- 4357
- ORCID
-
0000-0002-2158-1380
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Carnegie Mellon University
- Pagerank
- 0.20282239
- Overall Rank
- 278 | 98.68%
- Paper Count
- 26
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 26 of 26 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 482 |
An Optimal Algorithm for the Distinct Elements Problem |
2010 |
PODS |
0.00017772185 |
| 3,795 |
Is Min-Wise Hashing Optimal for Summarizing Set Intersection? |
2014 |
PODS |
7.1200458e-05 |
| 3,974 |
Epistemic Privacy |
2008 |
PODS |
6.9803508e-05 |
| 4,248 |
Multi-Tuple Deletion Propagation: Approximations and Complexity |
2013 |
VLDB |
6.8052749e-05 |
| 4,291 |
A Framework for Adversarially Robust Streaming Algorithms |
2020 |
PODS |
6.7786745e-05 |
| 4,370 |
Fast Manhattan Sketches in Data Streams |
2010 |
PODS |
6.7387541e-05 |
| 4,755 |
Rectangle-Efficient Aggregation in Spatial Data Streams |
2012 |
PODS |
6.5226838e-05 |
| 5,068 |
Weighted Reservoir Sampling from Distributed Streams |
2019 |
PODS |
6.3770298e-05 |
| 5,669 |
Data Streams with Bounded Deletions |
2018 |
PODS |
6.1278944e-05 |
| 5,996 |
The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication |
2015 |
PODS |
6.0150613e-05 |
| 6,110 |
Clustering via Matrix Powering |
2004 |
PODS |
5.9728946e-05 |
| 6,275 |
BPTree: an ℓ2 Heavy Hitters Algorithm Using Constant Memory |
2017 |
PODS |
5.9299343e-05 |
| 6,454 |
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems |
2016 |
PODS |
5.8746921e-05 |
| 7,918 |
Subspace Exploration: Bounds on Projected Frequency Estimation |
2021 |
PODS |
5.5181056e-05 |
| 9,537 |
Finding Heavy-Hitters with Optimal State Changes |
2026 |
PODS |
5.2528121e-05 |
| 9,821 |
Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors |
2016 |
PODS |
5.214913e-05 |
| 10,162 |
On Sketching Trimmed Statistics |
2026 |
PODS |
5.093636e-05 |
| 10,168 |
Tight Lower Bounds for l2 Sampling |
2026 |
PODS |
5.093636e-05 |
| 10,171 |
Unbiased Insights: Optimal Streaming Algorithms for l_p Sampling, the Forget Model, and Beyond |
2026 |
PODS |
5.093636e-05 |
| 10,646 |
Perfect Sampling in Turnstile Streams Beyond Small Moments |
2025 |
PODS |
5.093636e-05 |
| 11,123 |
Streaming Algorithms with Few State Changes |
2024 |
PODS |
5.093636e-05 |
| 11,125 |
Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut |
2024 |
PODS |
5.093636e-05 |
| 11,519 |
Truly Perfect Samplers for Data Streams and Sliding Windows |
2022 |
PODS |
5.093636e-05 |
| 11,531 |
The White-Box Adversarial Data Stream Model |
2022 |
PODS |
5.093636e-05 |
| 11,894 |
Distributed Statistical Estimation of Matrix Products with Applications |
2018 |
PODS |
5.093636e-05 |
| 12,305 |
Space-Efficient Estimation of Statistics over Sub-Sampled Streams |
2012 |
PODS |
5.093636e-05 |
Frequent Co-authors
Co-authored at least 5 papers.
| Co-author |
Shared Papers |
Rank |
Pagerank |
|
Rajesh Jayaram
|
5 |
1,185 |
0.062459297 |