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.

Previously, while I was at McGill University, my research was primarily focused on algorithms for strings, with application to the analysis of the human genome.

Improved bounds for testing juntas
Manuscript

Polynomial regression under arbitrary product spaces
with R. O'Donnell, and K. Wimmer
Proc. 21st Annual Conference on Learning Theory (COLT), 2008

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

Inferring gene orders from gene maps using the breakpoint method
with G. Blin, P. Guillon, M. Blanchette, and N. El-Mabrouk
Proc. 4th RECOMB Comparative Genomics Satellite Workshop (Springer LNCS 4205), 2006

Common substrings in random strings
Master's Thesis, McGill University, 2006

Common substrings in random strings
with M. Blanchette
Proc. 17th Symposium on Combinatorial Pattern Matching (Springer LNCS 4009), 2006

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