My primiary research interests are in approximation algorithms, computational complexity, data structures and computability. More broadly I am interested in machine learning and programming languages, particuarly functional programming languages. Please see my publications for an overview.

Student Research

Honors Thesis Advising:

• 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:

• Son Ho '07. Ph.D. @ University of Maryland College Park.
• Joel Hilliard '09.
• Austin Stanley '10.

Funding

My research is generously supported by the National Science Foundation under award number 0812514. More information about this work is available on the project page.