default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen R. Chestnut
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j4]Stephen R. Chestnut, Robert Hildebrand
, Rico Zenklusen:
Sublinear Bounds for a Quantitative Doignon-Bell-Scarf Theorem. SIAM J. Discret. Math. 32(1): 352-371 (2018)- 2017
- [j3]Stephen R. Chestnut, Rico Zenklusen:
Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives. Math. Oper. Res. 42(1): 144-166 (2017) - [j2]Stephen R. Chestnut, Rico Zenklusen:
Hardness and approximation for network flow interdiction. Networks 69(4): 378-387 (2017) - 2016
- [j1]Stephen R. Chestnut, Martin Nägele, Rico Zenklusen:
Refuting a conjecture of Goemans on bounded degree spanning trees. Oper. Res. Lett. 44(6): 766-771 (2016)
Conference and Workshop Papers
- 2018
- [c6]Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Yi Li, David P. Woodruff, Lin F. Yang:
Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order. ICML 2018: 648-657 - 2017
- [c5]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 - [c4]Jaroslaw Blasiok, Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Lin F. Yang:
Streaming symmetric norms via measure concentration. STOC 2017: 716-729 - 2016
- [c3]Vladimir Braverman, Stephen R. Chestnut, David P. Woodruff, Lin F. Yang:
Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors. PODS 2016: 261-276 - [c2]Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, David P. Woodruff:
Beating CountSketch for heavy hitters in insertion streams. STOC 2016: 740-753 - 2015
- [c1]Vladimir Braverman, Stephen R. Chestnut:
Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums. APPROX-RANDOM 2015: 591-605
Informal and Other Publications
- 2016
- [i9]Vladimir Braverman, Stephen R. Chestnut, David P. Woodruff, Lin F. Yang:
Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors. CoRR abs/1601.07473 (2016) - [i8]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) - [i7]Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Lin F. Yang:
Sketches for Matrix Norms: Faster, Smaller and More General. CoRR abs/1609.05885 (2016) - 2015
- [i6]Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, David P. Woodruff:
Beating CountSketch for Heavy Hitters in Insertion Streams. CoRR abs/1511.00661 (2015) - [i5]Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Lin F. Yang:
Streaming Symmetric Norms via Measure Concentration. CoRR abs/1511.01111 (2015) - [i4]Stephen R. Chestnut, Rico Zenklusen:
Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives. CoRR abs/1511.02484 (2015) - [i3]Stephen R. Chestnut, Rico Zenklusen:
Hardness and Approximation for Network Flow Interdiction. CoRR abs/1511.02486 (2015) - 2014
- [i2]Vladimir Braverman, Stephen R. Chestnut:
Streaming sums in sublinear space. CoRR abs/1408.5096 (2014) - 2012
- [i1]Stephen R. Chestnut, Donniell E. Fishkind:
Counting Spanning Trees of Threshold Graphs. CoRR abs/1208.4125 (2012)
Coauthor Index
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 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
