- The many faces of a translation
- Arithmetic circuits and polynomial replacement systems
- Reversible Space Equals Deterministic Space KlausJorn Lange \Lambda
- Tree Isomorphism and Some Other Complete Problems for Deterministic Logspace
- The Complexity of Membership Problems for Circuits over Sets of Natural Numbers
- Automne 2010 Cantor vs P et NP
- IFT 6121 Automne 2008 Pierre McKenzie Complexite du calcul bureau AA-3143
- L'informatique, du mammouth au FMI Pierre McKenzie
- Modular Temporal Logic Augustin Baziramwabo \Lambda
- Permutations, pr'etraitement Entr'ee: permutations g 1 ; g 2 ; : : : ; g r de f1; 2; : : : ; ng
- Logspace and Logtime Leaf Languages \Lambda Birgit Jenner y
- compilation Automates D#terministes
- On the Complexity of Free Monoid Morphisms KlausJorn Lange and Pierre McKenzie ?
- IFT 2121 H2000 Pierre McKenzie Introduction `a l'algorithmique
- Circuits and Contextfree Languages Pierre McKenzie \Lambda Klaus Reinhardt y V Vinay z
- IFT 2121 H2000 Pierre McKenzie Introduction `a l'algorithmique
- IFT 2121 Hiver 2000 Pierre McKenzie Introduction a l'algorithmique (bureau AA-3353)
- IFT 2121 H2000 Pierre McKenzie Introduction `a l'algorithmique
- The Complexity of Tensor Calculus Carsten Damm \Lambda
- On the Complexity of Some Problems on
- Alternating and Empty Alternating Auxiliary Stack Automata ?
- Hierarchie arithmetique 2. Est-ce que tous les langages
- IFT 3375/6370 A2010 Pierre McKenzie Informatique theorique
- Automne 2010 Classes probabilistes
- Chapitre 10 Algorithmes probabilistes
- 1. Retour sur divers mod`eles plausibles de la calculabilite
- Separation of the Monotone NC Hierarchy Ran Raz \Lambda
- Theory Comput Syst (2008) 43: 159184 DOI 10.1007/s00224-007-9049-y
- | Permutations, pr'etraitement | Entr'ee: permutations g1 , g2 , . . ., gr de {1, 2, . . ., n}
- The Descriptive Complexity Approach to Clemens Lautemann 1 , Pierre McKenzie 2? , Thomas Schwentick 1 , and
- On the Complexity of Some Problems on Groups Input as Multiplication Tables \Lambda David Mix Barrington
- Equation Satis ability and Program Satis ability for Finite Monoids
- The complexity of circuit evaluation over the natural
- IFT3375IFT6370 Automne 2010 Pierre McKenzie Informatique theorique
- Extensional Uniformity for Boolean Circuits Pierre McKenzie1
- Nondeterministic NC 1 computation Herv'e Caussinus \Lambda and Pierre McKenzie \Lambda
- compilation Automates D#terministes
- Complete publications list for Pierre McKenzie February 2012 Refereed journal publications
