Paul McCabe

Dept. of Computer Science // Sandford Fleming Building // 10 King's College Road // Toronto, Ontario M5S 3G4 // Canada

I am a graduate student of Toniann Pitassi. My research interests are in complexity theory and algorithm design.

Office: SF4301-E

Teaching

• CSC236: Introduction to the Theory of Computation (Summer 2006)
• ECE190: Discrete Mathematics (Fall 2005)
• CSC363: Computational Complexity and Computability (Spring 2005)

Papers

1. Paul McCabe.
   Lower Bounding the Number of Straight-Edge Triangulations of Planar Point Sets.
   M.Sc. Thesis, FR Informatik, Saarland University, 2003.
   [Postscript]
   
   
2. Paul McCabe.
   The space complexity of the reachability problem in undirected graphs (a survey).
   Depth Exam Report, University of Toronto, 2004.
   [Postscript]
   
   
3. Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, and Michael Saks.
   Minimizing DNF formulas and AC^0_d circuits given a truth table.
   To appear in 21st IEEE Conference on Computational Complexity (CCC), 2006.