Welcome!

I'm a fifth-year PhD Student at UMass Amherst in the College of Information and Computer Science. Advised by Andrew McGregor, I study CS theory - particularly graphs, randomized algorithms, complexity, and applications of these topics to systems and networking problems.

Latest publication

"MESH: Compacting Memory Management for C/C++ Applications" (arxiv) to appear in PLDI 2019. MESH is free and open source. Check out the repo!

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!

Conference talk slides

for "Finding Densest Subgraphs in the Streaming Model" presented at MFCS 2015.

Finding Densest Subgraphs in the Streaming Model

MFCS 2015

Streaming Vertex and Hyperedge Connectivity

PODS 2015

You can learn a little about my non-work interests if you like.

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] protonmail [dot] ch.