Pierre McKenzie
Affiliations: | Arts and Sciences | Université de Montréal, Montréal, Canada |
Area:
Computer ScienceGoogle:
"Pierre McKenzie"Children
Sign in to add traineeAugustin Baziramwabo | grad student | 2003 | Université de Montréal |
Michael Cadilhac | grad student | 2013 | Université de Montréal |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Blondin M, Finkel A, McKenzie P. (2018) Handling infinitely branching well-structured transition systems Information & Computation. 258: 28-49 |
Allender E, Krebs A, McKenzie P. (2018) Better Complexity Bounds for Cost Register Automata Theory of Computing Systems. 63: 367-385 |
Cadilhac M, Krebs A, McKenzie P. (2018) The Algebraic Theory of Parikh Automata Theory of Computing Systems \/ Mathematical Systems Theory. 62: 1241-1268 |
Cadilhac M, Finkel A, McKenzie P. (2013) Unambiguous constrained automata International Journal of Foundations of Computer Science. 24: 1099-1116 |
Cook S, McKenzie P, Wehr D, et al. (2012) Pebbles and branching programs for tree evaluation Acm Transactions On Computation Theory. 3 |
Cadilhac M, Finkel A, McKenzie P. (2012) Bounded Parikh automata International Journal of Foundations of Computer Science. 23: 1691-1709 |
Cadilhac M, Finkel A, McKenzie P. (2012) Affine Parikh automata Rairo - Theoretical Informatics and Applications. 46: 511-545 |
Blondin M, McKenzie P. (2012) The complexity of intersecting finite automata having few final states Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7353: 31-42 |
McKenzie P, Thomas M, Vollmer H. (2010) Extensional Uniformity for Boolean Circuits Siam Journal On Computing. 39: 3186-3206 |
McKenzie P, Wagner KW. (2007) The complexity of membership problems for circuits over sets of natural numbers Computational Complexity. 16: 211-244 |