Latest publication
"MESH: Compacting Memory Management for C/C++ Applications" (arxiv) in PLDI 2019. MESH is free and open source. Check out the press release.
Welcome!
I'm a postdoctoral researcher in Computer Science at Stony Brook University advised by Michael Bender and Martin Farach-Colton . I completed my PhD at UMass Amherst in the College of Information and Computer Science, where I was advised by Andrew McGregor. I study CS theory - particularly graphs, randomized algorithms, complexity, and applications of these topics to real-world problems in areas like external memory, filesystems, and networking.
Watch two presentations
of our MESH project by coauthors Bobby Powers at Strange Loop 2019 and Emery Berger at CppCon 2019.
An explanatory notebook
of the "shuffle vector" data structure from our recent memory compaction paper MESH. Notebook w/ JS implementation by Job van der Zwan. EDIT: a rust implementation by Matt Woelk as well!
Check out the slides
from my recent presentation to the NSF "Algorithms in the Field" grant committee.
Conference talk slides
for "Finding Densest Subgraphs in the Streaming Model" presented at MFCS 2015.
Finding Densest Subgraphs in the Streaming Model
Streaming Vertex and Hyperedge Connectivity
Get In Touch
If you don't want to bother with email, why not send me a message via this convenient web form? It's powered by formspree.io. If you want to contact me very securely, email me at dtench [at] pm [dot] me.