default search action
David Tench
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Richard Wen
, Hunter McCoy
Adaptive Quotient Filters. Proc. ACM Manag. Data 2(4): 192:1-192:28 (2024) - [j2]David Tench, Evan West, Victor Zhang, Michael A. Bender, Abiyaz Chowdhury, Daniel DeLayo, J. Ahmed Dellas, Martín Farach-Colton, Tyler Seip, Kenny Zhang:
GraphZeppelin: How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive). ACM Trans. Database Syst. 49(3): 9:1-9:31 (2024) - [i6]Richard Wen, Hunter McCoy, David Tench, Guido Tagliavini, Michael A. Bender, Alex Conway, Martin Farach-Colton, Rob Johnson, Prashant Pandey:
Adaptive Quotient Filters. CoRR abs/2405.10253 (2024) - [i5]David Tench, Evan T. West, Kenny Zhang, Michael Bender, Daniel DeLayo, Martin Farach-Colton, Gilvir Gill, Tyler Seip, Victor Zhang:
Exploring the Landscape of Distributed Graph Sketching. CoRR abs/2410.07518 (2024) - 2022
- [c7]David Tench
GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams. SIGMOD Conference 2022: 325-339 - [i4]David Tench, Evan West, Victor Zhang, Michael A. Bender, Abiyaz Chowdhury, J. Ahmed Dellas, Martin Farach-Colton, Tyler Seip, Kenny Zhang:
GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams. CoRR abs/2203.14927 (2022) - 2021
- [j1]Rachee Singh, David Tench
PredictRoute: A Network Path Prediction Toolkit. Proc. ACM Meas. Anal. Comput. Syst. 5(2): 23:1-23:24 (2021) - [c6]Michael A. Bender, Rathish Das, Martin Farach-Colton, Tianchi Mo, David Tench
Mitigating False Positives in Filters: to Adapt or to Cache? APOCS 2021: 16-24 - [c5]Andrew McGregor, David Tench
Maximum Coverage in the Data Stream Model: Parameterized and Generalized. ICDT 2021: 12:1-12:20 - [c4]Rachee Singh, David Tench, Phillipa Gill, Andrew McGregor:
PredictRoute: A Network Path Prediction Toolkit. SIGMETRICS (Abstracts) 2021: 21-22 - [i3]Andrew McGregor, David Tench, Hoa T. Vu:
Maximum Coverage in the Data Stream Model: Parameterized and Generalized. CoRR abs/2102.08476 (2021)
2010 – 2019
- 2019
- [c3]Bobby Powers, David Tench
Mesh: compacting memory management for C/C++ applications. PLDI 2019: 333-346 - [i2]Bobby Powers, David Tench, Emery D. Berger, Andrew McGregor:
Mesh: Compacting Memory Management for C/C++ Applications. CoRR abs/1902.04738 (2019) - 2015
- [c2]Andrew McGregor, David Tench
Densest Subgraph in Dynamic Graph Streams. MFCS (2) 2015: 472-482 - [c1]Sudipto Guha, Andrew McGregor, David Tench
Vertex and Hyperedge Connectivity in Dynamic Graph Streams. PODS 2015: 241-247 - [i1]Andrew McGregor, David Tench, Sofya Vorotnikova, Hoa T. Vu:
Densest Subgraph in Dynamic Graph Streams. CoRR abs/1506.04417 (2015)
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-12-05 20:46 CET 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: