I am a fourth-year PhD student in theoretical computer science. My adviser is Peter Gacs.

I am interested in computational geometry, algorithms, and complexity theory.

Publications

A Locked Orthogonal Tree, with Erik D. Demaine, Martin L. Demaine, Gregory Price, and Yaa-Lirng Tu.

Hinged Dissections Exist, with Timothy G. Abbott, Zachary Abel, Erik D. Demaine, Martin L. Demaine, and Scott D. Kominers. Submitted.

Lower Bounds for Probably-istic Polynomial Time, K. Burke and D. Charlton (draft, being prepared for the twenty-first IEEE Computational Complexity conference on April 1, 2006) (PS) (PDF)