David Tench

Orcid: 0000-0002-7542-9800

According to our database1, David Tench authored at least 10 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
GraphZeppelin: How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive).
ACM Trans. Database Syst., September, 2024

Adaptive Quotient Filters.
Proc. ACM Manag. Data, September, 2024

Exploring the Landscape of Distributed Graph Sketching.
CoRR, 2024

2022
GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2021
PredictRoute: A Network Path Prediction Toolkit.
Proc. ACM Meas. Anal. Comput. Syst., 2021

Maximum Coverage in the Data Stream Model: Parameterized and Generalized.
Proceedings of the 24th International Conference on Database Theory, 2021

Mitigating False Positives in Filters: to Adapt or to Cache?
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

2019
Mesh: compacting memory management for C/C++ applications.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

2015
Vertex and Hyperedge Connectivity in Dynamic Graph Streams.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Densest Subgraph in Dynamic Graph Streams.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015


  Loading...