Steven
Perron

Department of Computer Science, University Of
Toronto.__10 King's College Road, Toronto, Ontario, M5S 3G4,
CANADA __

I am a graduate student at the University of Toronto. Currently, I am studying quantified propositional proof systems, bounded arithmetic, and computational complexity. This is work I am doing with my current supervisor Stephen Cook. I use to do research in error-correcting codes. This is work I did during my undergraduate degree at Saint Mary's University under the supervision of Stavros Konstantinidis. I am also interested in finite model theory. Below is a list of my publications.

In my spare time, I like to play ultimate, travel, and get
involved with my local church. See my Web
Album for pictures from my trips.

Journal
Articles

Steven Perron 2008,

*Quantiﬁed Propositional Logspace Reasoning.*Submitted (arXiv)Steven Perron 2007,

*Examining Fragments of the Quantified Propositional Calculus.*To Appear (PS,PDF)S. Konstantinidis, S. Perron, L. A. Wilcox-O'Hearn, 2003.

*On a Simple Method for Detecting Synchronization Errors in Coded Messages.*Published in: IEEE Transactions on Information Theory, 49, pp. 1355-1363. (PS)

Conference Articles

Steven James Perron, 2007,

*Examining The Fragments of G,*LICS 2007: 225-234. (PS,PDF)Steven Perron, 2005.

*A Propositional Proof System for Log Space.*CSL 2005: 509-524 (PS,PDF)Lila Kari, Stavros Konstantinidis, Steven Perron, Geoff Wozniak, and Jing Xu, 2004.

*Computing the hamming distance of a regular language in quadratic time.*WSEAS Transactions on Information Science and Applications. 1:445-449.

Reports (Unpublished)

S. Perron, 2005.

*GL*: A Propositional Proof System For Logspace.*Thesis for Master of Science, Department of Computer Science, University of Toronto. (PS,PDF)**Note:**Many results from this thesis appear in*A Propositional Proof System for Log Space.*L. Kari, S. Konstantinidis, S. Perron, G. Wozniak, J. Xu, 2003.

*Finite-state error/edit-systems and difference-measures for languages and words*. Report for: Department of Mathematics and Computing Science, Saint Mary's University, Canada. (PS)**Note:**Some results from this report appear in*Computing the hamming distance of a regular language in quadratic time*(above).