I graduated in May of 2012. My thesis is available here.
The university newspaper has an article that talks about our research group.
Many of my papers are available on-line, along with the presentations for them.
I'm very interested in understanding heuristic search algorithms, particularly those which return solutions within a bounded factor of optimal. Recently, I've been doing work with anytime algorithms and greedy search, two areas that are strongly related to the first.
If you're looking for a crash course in my research area, you should take a look at some videos I've posted explaining some of the fundamental algorithms in the area.
If you don't like moving pictures, I've got some still images that demonstrate some interesting behaviors of search algorithms here.
If you're looking for an informal way to learn about AI, feel free to drop in at the UNH AI Group meetings.
I've been working on a plotting tool for use inside and outside of OCaml called SPT. It's what I use to generate all of the plots in my papers now.