• PhD in Computer Science, University of Chicago, advisor: Laszlo Babai (2011). Thesis: "Testing Isomorphism of Combinatorial and Algebraic Structures." pdf
• M.S. in Computer Science, University of Chicago (2007). Masters Thesis: 2D Min-Filters with Polygons, pdf , ps.
• B.S. in Mathematics (with honors), University of Chicago (2005)

          I am interested broadly in algorithms. I have done research on approximation algorithms, algorithms relating to vision, and isomorphism problems. I am particularly interested in algorithms that exploit the combinatorial and algebraic structures that might arise.

• Teaching Assistant Prize, University of Chicago CS, 2010.
• Outstanding Student Fellowship, University of Chicago CS, 2008.

• Visiting student with Prof. Sanjeev Khanna at the University of Pennsylvania (Summer 2008).
• Visiting student at the Paradise group, Caltech (Summer 2006).
• Summer Intern supported by SURF Program, Caltech(Summer 2005).
• Computing Beyond Silicon Summer School, Caltech (Summer 2004).
• REU program, University of Chicago (Summer 2003).
• 14th International Olympiad in Informatics. Member of the Italian Team (Korea, 2002).

• Polynomial-Time Isomorphism Test for Groups with no Abelian Normal Subgroups.
  (with Laszlo Babai, and Youming Qiao).
  Accepted, ICALP 2012.
  
  
• The Petersen graph is the smallest 3-cop-win graph.
  (with Andrew Beveridge, Aaron Maurer, John McCauley, and Silviya Valeva).
  In Preparation. Preprint avalable at arxiv.org/abs/1110.0768 .
  
  
• Code Equivalence and Group Isomorphism
  (with Laszlo Babai, Joshua A. Grochow, and Youming Qiao).
  SODA 2011 (pp. 1395-1408).
  
  
• Resource Minimization Job Scheduling (with Julia Chuzhoy),
  APPROX 2009 (pp. 70-83). Full version.
  
  
• Isomorphism of hypergraphs of low rank in moderately exponential time
  (with Laszlo Babai), FOCS 2008 (pp. 667-676).
  
  
• 2D Min-Filters with Polygons (with Pedro Felzenszwalb).
  In the 17th Fall Workshop on Computational Geometry, 2007.
  
  
• Anti-Jamming Schedules for Wireless Data Broadcast Systems
  (with A. Sprintson and J. Bruck).
  In Proceedings of 2006 IEEE International Symposium on Information Theory (ISIT), July 2006, Seattle, Washington (pp. 1856-1860).
  Expanded version available as Caltech TR ETR070 July 2005.
  
  

• Dagstuhl Seminar on: Exact Complexity of NP-hard Problems (seminar 10441).
  Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, and Gregory Sorkin organizers.
  November 2010, Dagstuhl, Germany.
  
  
• Combinatorics, Groups, Algorithms, and Complexity.
  Conference in honor of Laci Babai's 60th birthday.
  March 2010, The Ohio State University, Columbus, Ohio.

• Instructor, Summer 2009: CMSC 15200, Intro to Computer Science 2, Summer 2009.
  
  
• TA, Winter 2006 and 2007: CMSC 27200: Theory of Algorithms
  
  
• TA, Spring 2006 and 2007: CMSC 15400: Introduction to Computer Systems
  
  
• TA, Autumn 2006, 2009 and 2010: CMSC 27100: Discrete Mathematics
  
  
• TA, Winter 2010: CMSC 23700: Introduction to Computer Graphics
  
  
• TA, Winter 2011: CMSC 15200: Introduction to Computer Science 2