Följ
David Tench
David Tench
Postdoctoral Researcher, Stony Brook University
Verifierad e-postadress på cs.stonybrook.edu - Startsida
Titel
Citeras av
Citeras av
År
Densest subgraph in dynamic graph streams
A McGregor, D Tench, S Vorotnikova, HT Vu
International Symposium on Mathematical Foundations of Computer Science, 472-482, 2015
712015
Vertex and hyperedge connectivity in dynamic graph streams
S Guha, A McGregor, D Tench
Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2015
632015
Mesh: Compacting memory management for C/C++ applications
B Powers, D Tench, ED Berger, A McGregor
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language …, 2019
142019
Mitigating False Positives in Filters: to Adapt or to Cache?
MA Bender, R Das, M Farach-Colton, T Mo, D Tench, Y Ping Wang
Symposium on Algorithmic Principles of Computer Systems (APOCS), 16-24, 2021
32021
PredictRoute: A Network Path Prediction Toolkit
R Singh, D Tench, P Gill, A McGregor
Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2 …, 2021
12021
Maximum Coverage in the Data Stream Model: Parameterized and Generalized
A McGregor, D Tench, HT Vu
arXiv preprint arXiv:2102.08476, 2021
12021
GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams
D Tench, E West, V Zhang, MA Bender, A Chowdhury, JA Dellas, ...
arXiv preprint arXiv:2203.14927, 2022
2022
ALGORITHMS FOR MASSIVE, EXPENSIVE, OR OTHERWISE INCONVENIENT GRAPHS
D Tench
2020
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–8