The Parallel Complexity of the Abelian Permutation Group Membership Problem - Pierre McKenzie; Stephen A. Cook (FOCS, 1983)

Permutations of Bounded Degree Generate Groups of Polynomial Diameter. - Pierre McKenzie (Inf. Process. Lett., 1984)

Parallel complexity and permutation groups. - Pierre McKenzie (1984)

Fast Parallel Computation with Permutation Groups - Eugene M. Luks; Pierre McKenzie (FOCS, 1985)

Problems Complete for Deterministic Logarithmic Space. - Stephen A. Cook; Pierre McKenzie (J. Algorithms, 1987)

The Parallel Complexity of Abelian Permutation Group Problems. - Pierre McKenzie; Stephen A. Cook (SIAM J. Comput., 1987)

Parallel Algorithms for Solvable Permutation Groups. - Eugene M. Luks; Pierre McKenzie (J. Comput. Syst. Sci., 1988)

Automata Theory Meets Circuit Complexity. - Pierre McKenzie; Denis Thérien (ICALP, 1989)

Testing Membership: Beyond Permutation Groups (Extended Abstract). - Martin Beaudry; Pierre McKenzie; Denis Thérien (STACS, 1989)

NC¹: The Automata-Theoretic Viewpoint. - Pierre McKenzie; Pierre Péladeau; Denis Thérien (Comput. Complex., 1991)

Oracle branching programs and Logspace versus P - David A. Mix Barrington; Pierre McKenzie (Inf. Comput., 1991)

Cicuits, Matrices, and Nonassociative Computation. - Martin Beaudry; Pierre McKenzie (SCT, 1992)

The Membership Problem in Aperiodic Transformation Monoids. - Martin Beaudry; Pierre McKenzie; Denis Thérien (J. ACM, 1992)

Extensions to Barrington's M-Program Model. - François Bédard; François Lemieux; Pierre McKenzie (Theor. Comput. Sci., 1993)

Special Issue on Circuit Complexity: Foreword. - Pierre McKenzie; Denis Thérien (Comput. Complex., 1994)

Circuits, Matrices, and Nonassociative Computation. - Martin Beaudry; Pierre McKenzie (J. Comput. Syst. Sci., 1995)

Nondeterministic NC1 Computation. - Hervé Caussinus; Pierre McKenzie; Denis Thérien; Heribert Vollmer (CCC, 1996)

Logspace and Logtime Leaf Languages. - Birgit Jenner; Pierre McKenzie; Denis Thérien (Inf. Comput., 1996)

Finite Moniods: From Word to Circuit Evaluation. - Martin Beaudry; Pierre McKenzie; Pierre Péladeau; Denis Thérien (SIAM J. Comput., 1997)

Verifying Identical Communicating Processes is Undecidable. - Alain Finkel; Pierre McKenzie (Theor. Comput. Sci., 1997)

A Note on the Hardness of Tree Isomorphism. - Birgit Jenner; Pierre McKenzie; Jacobo Torán (CCC, 1998)

On the Complexity of Free Monoid Morphisms. - Klaus-Jörn Lange; Pierre McKenzie (ISAAC, 1998)

Nondeterministic NC1 Computation. - Hervé Caussinus; Pierre McKenzie; Denis Thérien; Heribert Vollmer (J. Comput. Syst. Sci., 1998)

Circuits and Context-Free Languages. - Pierre McKenzie; Klaus Reinhardt; V. Vinay (COCOON, 1999)

Modular Temporal Logic. - Augustin Baziramwabo; Pierre McKenzie; Denis Thérien (LICS, 1999)

Separation of the Monotone NC Hierarchy. - Ran Raz; Pierre McKenzie (Comb., 1999)

Equation Satisfiability and Program Satisfiability for Finite Monoids. - David A. Mix Barrington; Pierre McKenzie; Cristopher Moore; Pascal Tesson; Denis Thérien (MFCS, 2000)

Reversible Space Equals Deterministic Space. - Klaus-Jörn Lange; Pierre McKenzie; Alain Tapp (J. Comput. Syst. Sci., 2000)

Systems and Software Verification, Model-Checking Techniques and Tools. - Béatrice Bérard; Michel Bidoit; Alain Finkel; François Laroussinie; Antoine Petit 001; Laure Petrucci; Philippe Schnoebelen; Pierre McKenzie (Springer, 2001)

On the Complexity of Some Problems on Groups Input as Multiplication Tables. - David A. Mix Barrington; Peter Kadau; Klaus-Jörn Lange; Pierre McKenzie (J. Comput. Syst. Sci., 2001)

The Descriptive Complexity Approach to LOGCFL. - Clemens Lautemann; Pierre McKenzie; Thomas Schwentick; Heribert Vollmer (J. Comput. Syst. Sci., 2001)

The complexity of tensor calculus. - Carsten Damm; Markus Holzer 001; Pierre McKenzie (Comput. Complex., 2002)

Completeness results for graph isomorphism. - Birgit Jenner; Johannes Köbler; Pierre McKenzie; Jacobo Torán (J. Comput. Syst. Sci., 2003)

Alternating and empty alternating auxiliary stack automata. - Markus Holzer 001; Pierre McKenzie (Theor. Comput. Sci., 2003)

A well-structured framework for analysing petri net extensions. - Alain Finkel; Pierre McKenzie; Claudine Picaronny (Inf. Comput., 2004)

Arithmetic Circuits and Polynomial Replacement Systems. - Pierre McKenzie; Heribert Vollmer; Klaus W. Wagner (SIAM J. Comput., 2004)

Worst-case randomized interactive communication. - Hugues Mercier; Pierre McKenzie; Stefan Wolf 001 (ISIT, 2005)

Incremental branching programs - Anna Gál; Michal Koucký 001; Pierre McKenzie (Electron. Colloquium Comput. Complex., 2005)

Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566]. - Birgit Jenner; Johannes Köbler; Pierre McKenzie; Jacobo Torán (J. Comput. Syst. Sci., 2006)

The many faces of a translation. - Pierre McKenzie; Thomas Schwentick; Denis Thérien; Heribert Vollmer (J. Comput. Syst. Sci., 2006)

The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers. - Pierre McKenzie; Klaus W. Wagner (Comput. Complex., 2007)

Worst Case Nonzero-Error Interactive Communication. - Hugues Mercier; Pierre McKenzie; Stefan Wolf 001 (IEEE Trans. Inf. Theory, 2008)

Fractional Pebbling and Thrifty Branching Programs. - Mark Braverman; Stephen A. Cook; Pierre McKenzie; Rahul Santhanam; Dustin Wehr (FSTTCS, 2009)

Few Product Gates But Many Zeros. - Bernd Borchert; Pierre McKenzie; Klaus Reinhardt (MFCS, 2009)

Branching Programs for Tree Evaluation. - Mark Braverman; Stephen A. Cook; Pierre McKenzie; Rahul Santhanam; Dustin Wehr (MFCS, 2009)

The complexity of Solitaire. - Luc Longpré; Pierre McKenzie (Theor. Comput. Sci., 2009)

The Computational Complexity of RaceTrack. - Markus Holzer 001; Pierre McKenzie (FUN, 2010)

Extensional Uniformity for Boolean Circuits. - Pierre McKenzie; Michael Thomas 001; Heribert Vollmer (SIAM J. Comput., 2010)

On the Expressiveness of Parikh Automata and Related Models. - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (NCMA, 2011)

Storming the Parikh Automaton - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (CoRR, 2011)

Low uniform versions of NC1. - Christoph Behle; Andreas Krebs; Klaus-Jörn Lange; Pierre McKenzie (Electron. Colloquium Comput. Complex., 2011)

The Complexity of Intersecting Finite Automata Having Few Final States. - Michael Blondin; Pierre McKenzie (CSR, 2012)

The Lower Reaches of Circuit Uniformity. - Christoph Behle; Andreas Krebs; Klaus-Jörn Lange; Pierre McKenzie (MFCS, 2012)

Bounded Parikh Automata. - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (Int. J. Found. Comput. Sci., 2012)

Affine Parikh automata. - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (RAIRO Theor. Informatics Appl., 2012)

Pebbles and Branching Programs for Tree Evaluation. - Stephen A. Cook; Pierre McKenzie; Dustin Wehr; Mark Braverman; Rahul Santhanam (ACM Trans. Comput. Theory, 2012)

Can Chimps Go It Alone? - Pierre McKenzie (DCFS, 2013)

Few Product Gates but Many Zeroes. - Bernd Borchert; Pierre McKenzie; Klaus Reinhardt (Chic. J. Theor. Comput. Sci., 2013)

The Algebraic Theory of Parikh Automata. - Michaël Cadilhac; Andreas Krebs; Pierre McKenzie (Electron. Colloquium Comput. Complex., 2013)

Unambiguous constrained Automata. - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (Int. J. Found. Comput. Sci., 2013)

Handling Infinitely Branching WSTS. - Michael Blondin; Alain Finkel; Pierre McKenzie (ICALP (2), 2014)

Extremely uniform branching programs. - Michaël Cadilhac; Andreas Krebs; Pierre McKenzie (NCMA, 2014)

Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141). - Javier Esparza; Alain Finkel; Pierre McKenzie; Joël Ouaknine (Dagstuhl Reports, 2014)

On Generalized Addition Chains. - Yara Elias; Pierre McKenzie (Integers, 2014)

Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. - Michael Blondin; Alain Finkel; Stefan Göller; Christoph Haase; Pierre McKenzie (LICS, 2015)

The complexity of intersecting finite automata having few final states. - Michael Blondin; Andreas Krebs; Pierre McKenzie (Comput. Complex., 2016)

Nondeterminism and An Abstract Formulation of Nečiporuk's Lower Bound Method. - Paul Beame; Nathan Grosshans; Pierre McKenzie; Luc Segoufin (ACM Trans. Comput. Theory, 2016)

The Power of Programs over Monoids in DA. - Nathan Grosshans; Pierre McKenzie; Luc Segoufin (MFCS, 2017)

Better Complexity Bounds for Cost Register Machines. - Eric Allender; Andreas Krebs; Pierre McKenzie (Electron. Colloquium Comput. Complex., 2017)

Does Looking Inside a Circuit Help? - Russell Impagliazzo; Valentine Kabanets; Antonina Kolokolova; Pierre McKenzie; Shadab Romani (Electron. Colloquium Comput. Complex., 2017)

Well Behaved Transition Systems. - Michael Blondin; Alain Finkel; Pierre McKenzie (Log. Methods Comput. Sci., 2017)

Handling infinitely branching well-structured transition systems. - Michael Blondin; Alain Finkel; Pierre McKenzie (Inf. Comput., 2018)

Better Complexity Bounds for Cost Register Automata. - Eric Allender; Andreas Krebs; Pierre McKenzie (Theory Comput. Syst., 2019)

The Reachability Problem for Two-Dimensional Vector Addition Systems with States. - Michael Blondin; Matthias Englert; Alain Finkel; Stefan Göller; Christoph Haase; Ranko Lazic 001; Pierre McKenzie; Patrick Totzke (J. ACM, 2021)

Tameness and the power of programs over monoids in DA. - Nathan Grosshans; Pierre McKenzie; Luc Segoufin (Log. Methods Comput. Sci., 2022)

Towards a Complexity Theory of Parallel Computation. - Paul Beame; Pierre McKenzie (Logic, Automata, and Computational Complexity, 2023)

Pebbles and Branching Programs for Tree Evaluation. - Stephen A. Cook; Pierre McKenzie; Dustin Wehr; Mark Braverman; Rahul Santhanam (Logic, Automata, and Computational Complexity, 2023)

Perspective on complexity measures targetting read-once branching programs. - Yaqiao Li; Pierre McKenzie (CoRR, 2023)

Catalytic Branching Programs from Groups and General Protocols. - Hugo Côté; Pierre McKenzie (ACM Trans. Comput. Theory, 2023)

Perspective on complexity measures targeting read-once branching programs. - Yaqiao Li; Pierre McKenzie (Inf. Comput., 2024)