Pierre McKenzie
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
29
Venues
12
Active years
1983–2017
Best venue rank
A*
Where they publish
Papers
29 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2017 | MFCS | Better Complexity Bounds for Cost Register Automata. | Eric Allender, Andreas Krebs, Pierre McKenzie |
| 2017 | MFCS | The Power of Programs over Monoids in DA. | Nathan Grosshans, Pierre McKenzie, Luc Segoufin |
| 2017 | MFCS | Does Looking Inside a Circuit Help?. | Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Pierre McKenzie, Shadab Romani |
| 2015 | LICS | Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. | Michael Blondin, Alain Finkel, Stefan Gller, Christoph Haase, Pierre McKenzie |
| 2014 | ICALP | Handling Infinitely Branching WSTS. | Michael Blondin, Alain Finkel, Pierre McKenzie |
| 2012 | CSR | The Complexity of Intersecting Finite Automata Having Few Final States. | Michael Blondin, Pierre McKenzie |
| 2012 | DLT | Unambiguous Constrained Automata. | Michal Cadilhac, Alain Finkel, Pierre McKenzie |
| 2012 | MFCS | The Lower Reaches of Circuit Uniformity. | Christoph Behle, Andreas Krebs, Klaus-Jrn Lange, Pierre McKenzie |
| 2010 | FUN | The Computational Complexity of RaceTrack. | Markus Holzer, Pierre McKenzie |
| 2009 | MFCS | Few Product Gates But Many Zeros. | Bernd Borchert, Pierre McKenzie, Klaus Reinhardt |
| 2009 | MFCS | Branching Programs for Tree Evaluation. | Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr |
| 2008 | CSL | Extensional Uniformity for Boolean Circuits. | Pierre McKenzie, Michael Thomas, Heribert Vollmer |
| 2007 | MFCS | The Complexity of Solitaire. | Luc Longpr, Pierre McKenzie |
| 2006 | CSR | Incremental Branching Programs. | Anna Gl, Michal Kouck, Pierre McKenzie |
| 2005 | ISIT | Worst-case randomized interactive communication. | Hugues Mercier, Pierre McKenzie, Stefan Wolf |
| 2003 | STACS | The Complexity of Membership Problems for Circuits over Sets of Natural Numbers. | Pierre McKenzie, Klaus W. Wagner |
| 2000 | ICALP | The Many Faces of a Translation. | Pierre McKenzie, Thomas Schwentick, Denis Thrien, Heribert Vollmer |
| 2000 | MFCS | Equation Satisfiability and Program Satisfiability for Finite Monoids. | David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thrien |
| 2000 | MFCS | Alternating and Empty Alternating Auxiliary Stack Automata. | Markus Holzer, Pierre McKenzie |
| 1999 | COCOON | Circuits and Context-Free Languages. | Pierre McKenzie, Klaus Reinhardt, V. Vinay |
| 1999 | LICS | Modular Temporal Logic. | Augustin Baziramwabo, Pierre McKenzie, Denis Thrien |
| 1999 | STACS | The Descriptive Complexity Approach to LOGCFL. | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
| 1998 | ISAAC | On the Complexity of Free Monoid Morphisms. | Klaus-Jrn Lange, Pierre McKenzie |
| 1997 | FOCS | Separation of the Monotone NC Hierarchy. | Ran Raz, Pierre McKenzie |
| 1989 | ICALP | Automata Theory Meets Circuit Complexity. | Pierre McKenzie, Denis Thrien |
| 1989 | MFCS | Oracle Branching Programs and Logspace versus P. | David A. Mix Barrington, Pierre McKenzie |
| 1989 | STACS | Testing Membership: Beyond Permutation Groups (Extended Abstract). | Martin Beaudry, Pierre McKenzie, Denis Thrien |
| 1985 | FOCS | Fast Parallel Computation with Permutation Groups | Eugene M. Luks, Pierre McKenzie |
| 1983 | FOCS | The Parallel Complexity of the Abelian Permutation Group Membership Problem | Pierre McKenzie, Stephen A. Cook |