My primary research interests are in approximation algorithms,
computational complexity, data structures and computability. More
broadly I am interested in machine learning and programming languages,
particularly functional programming languages. Please see my
publications for an overview.
My research is generously supported by the
National Science Foundation under
More information about this work is available on the
Honors Thesis Advising:
- Jaclyn Porfilio. '15 @ McKinsey. A Combanatorial Characterization of Heapability.
- Scott Sanderson '13 @ Demiurge Studios. Generalizing Non-determinism for Algebraic Computation Machines.
- Donny Huang '13. @ University of Washington. Implementing Online Greedy Future.
- Erdem Sahin '11. @ Google. MST algorithms for Map Reduce.
- M. Catalin Iordan '09. Ph.D. @ Stanford. Searching in Dynamic, Tree-Like Partial Orders.
- Michael Gerbush '09. Ph.D. @ UT-Austin. Approximation Algorithms for Stack Cover.
I have also had the great pleasure of working with the following current
and former Williams students:
- Nola Gordon '17
- Kenny Jones '17
- Benno Stein '15
- Carson Eisenach '14
- Brianne Mirecki '14
- T. Andrew Lorezen '12
- Son Ho '07. Ph.D. @ University of Maryland College Park.
- Joel Hilliard '09.
- Austin Stanley '10.