RESEARCH INTERESTS I am interested in devising practical algorithms with strong theoretical guarantees for important learning and optimization problems — algorithms for systems which reason about and make decisions in complex environments that may be uncertain, only partially observable, and changing over time. Towards that end I draw on ideas from online and no–regret algorithms, approximation algorithms, combinatorial optimization, and statistical learning theory, among other areas. HONORS 2011 Outstanding Paper Award, Conference on Artificial Intelligence (AAAI) 2008 Awarded Research Grant, with Guy Blelloch, from the CMU Center for Computational Thinking, for Improving Privacy via History Independence 2003–2008 Graduate Fellowship at Carnegie Mellon University 2003 & 2004 Honorable Mention, NSF Graduate Fellowship 2003 Finalist, John and Fannie Hertz Foundation Graduate Fellowship 2002 Selected for the team of three students representing Cornell University in the William Lowell Putnam mathematical competition 1998 New Jersey Governor’s School in the Sciences Scholar