Visiting member of the Institute for Advanced Study
I recently received my Ph.D at the CSD of Carnegie Mellon University under the advisorship of Guy Blelloch. This is also where I got my Master's degree from.
In 2003 I graduated from the California Institute of Technology with a BS in Mathematics and E&AS (=CS).
Here is my CV.: [ps] [pdf],
and my thesis abstract.
My interests lie in graph theory and algorithms. My major interest is in designing fast algorithms on weighted graphs. The problems I have mostly been considering are related to finding shortest paths, or small subgraphs. My current interests also include predecessor search data structures, problems in tournaments, and some problems in approximation algorithms such as vertex cover and shortest superstring.
Click here for a list of my publications.
Click here for some descriptions of my research topics.
Click here for a list of classes I have taught or taken at CMU.
Click here for a list of some of my talks.
In case you are interested in my personal ... STUFF.