I am a Ph.D. student in the Computer Science Department at CMU. My research advisor is Ryan O'Donnell.

My area of research is theoretical computer science. I am particularly interested in complexity theory, with an emphasis on property testing and the analysis of boolean functions.

k+ decision trees (pdf)
with J. Aspnes, M. Demirbas, R. O'Donnell, A. Rudra, and S. Uurtamo
Submitted

Longest common subsequences in sets of permutations
with P. Beame and D.-T. Huynh-Ngoc
Manuscript

Testing juntas nearly optimally (pdf)
STOC '09

Improved bounds for testing juntas (pdf)
RANDOM '08

Polynomial regression under arbitrary product spaces
with R. O'Donnell and K. Wimmer
COLT '08

Gene maps linearization using genomic rearrangement distances
with G. Blin, D. Hermelin, P. Guillon, M. Blanchette, and N. El-Mabrouk
Journal of Computational Biology, 2007
(Conference version, RECOMB Comparative Genomics '06)

Common substrings in random strings
Master's Thesis, McGill University, 2006
(Conference version with M. Blanchette, CPM '06)

On the inference of parsimonious indel scenarios
with L. Chindelevitch, Z. Li, and M. Blanchette
Journal of Bioinformatics and Computational Biology, 2006

Graphics processing method and system
with I. Ameline
U.S. patent application 20060087518 (10/969,878), 2004

I have been a teaching assistant for the following classes.

Intensive Introduction to Computational Complexity Theory
V. Guruswami and R. O'Donnell (Spring 2009)

Probability and Computing
M. Harchol-Balter and R. O'Donnell (Fall 2008)

Algorithms for Mining Biological Sequences
M. Blanchette (Spring 2006)

Algorithms and Data Structures
C. Crépeau (Spring 2005)

Introduction to Computer Science
M. Blanchette (Fall 2004, 2005)