


default search action
David P. Woodruff
- > Home > Persons > David P. Woodruff
Publications
- 2025
[c285]Matthew Ding
, Alexandro Garces, Jason Li, Honghao Lin, Jelani Nelson, Vihan Shah, David P. Woodruff:
Space Complexity of Minimum Cut Problems in Single-Pass Streams. ITCS 2025: 43:1-43:23- 2024
[i208]Matthew Ding
, Alexandro Garces, Jason Li, Honghao Lin, Jelani Nelson, Vihan Shah, David P. Woodruff:
Space Complexity of Minimum Cut Problems in Single-Pass Streams. CoRR abs/2412.01143 (2024)- 2021
[i150]Shuchi Chawla, Jelani Nelson, Chris Umans, David P. Woodruff:
Visions in Theoretical Computer Science: A Report on the TCS Visioning Workshop 2020. CoRR abs/2107.02846 (2021)- 2017
[c113]Michael Kapralov
, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh:
Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams. FOCS 2017: 475-486
[c105]Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, Jelani Nelson, Zhengyu Wang, David P. Woodruff:
BPTree: An ℓ2 Heavy Hitters Algorithm Using Constant Memory. PODS 2017: 361-376
[i69]Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh:
Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams. CoRR abs/1704.00633 (2017)- 2016
[c98]Michael B. Cohen
, Jelani Nelson, David P. Woodruff:
Optimal Approximate Matrix Product in Terms of Stable Rank. ICALP 2016: 11:1-11:14
[i52]Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, Jelani Nelson, Zhengyu Wang, David P. Woodruff:
BPTree: an ℓ2 heavy hitters algorithm using constant memory. CoRR abs/1603.00759 (2016)- 2015
[i38]Michael B. Cohen
, Jelani Nelson, David P. Woodruff:
Optimal approximate matrix product in terms of stable rank. CoRR abs/1507.02268 (2015)- 2012
[c52]Jelani Nelson, Huy L. Nguyên, David P. Woodruff:
On Deterministic Sketching and Streaming for Sparse Recovery and Norm Estimation. APPROX-RANDOM 2012: 627-638
[i23]Jelani Nelson, Huy L. Nguyên, David P. Woodruff:
On Deterministic Sketching and Streaming for Sparse Recovery and Norm Estimation. CoRR abs/1206.5725 (2012)- 2011
[c36]Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff:
Fast moment estimation in data streams in optimal space. STOC 2011: 745-754- 2010
[c29]Daniel M. Kane, Jelani Nelson, David P. Woodruff:
An optimal algorithm for the distinct elements problem. PODS 2010: 41-52
[c28]Jelani Nelson, David P. Woodruff:
Fast Manhattan sketches in data streams. PODS 2010: 99-110
[c25]Daniel M. Kane, Jelani Nelson, David P. Woodruff:
On the Exact Space Complexity of Sketching and Streaming Small Norms. SODA 2010: 1161-1178
[i14]Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff:
Fast Moment Estimation in Data Streams in Optimal Space. CoRR abs/1007.4191 (2010)- 2009
[i11]Jelani Nelson, David P. Woodruff:
A Near-Optimal Algorithm for L1-Difference. CoRR abs/0904.2027 (2009)- 2008
[i8]Daniel M. Kane, Jelani Nelson, David P. Woodruff:
Revisiting Norm Estimation in Data Streams. CoRR abs/0811.3648 (2008)

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from
,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from
and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-11-17 01:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID






