| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam |
Pebbles and Branching Programs for Tree Evaluation.  |
TOCT  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie |
Low uniform versions of NC1. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michaël Cadilhac, Alain Finkel, Pierre McKenzie |
Storming the Parikh Automaton |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michaël Cadilhac, Alain Finkel, Pierre McKenzie |
Bounded Parikh Automata |
WORDS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michaël Cadilhac, Alain Finkel, Pierre McKenzie |
On the Expressiveness of Parikh Automata and Related Models. |
NCMA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam |
Pebbles and Branching Programs for Tree Evaluation |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pierre McKenzie, Michael Thomas, Heribert Vollmer |
Extensional Uniformity for Boolean Circuits. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Pierre McKenzie |
The Computational Complexity of RaceTrack. |
FUN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré, Pierre McKenzie |
The complexity of Solitaire. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr |
Branching Programs for Tree Evaluation. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Borchert, Pierre McKenzie, Klaus Reinhardt |
Few Product Gates But Many Zeros. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr |
Fractional Pebbling and Thrifty Branching Programs. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Michael Thomas, Heribert Vollmer |
Extensional Uniformity for Boolean Circuits |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Anna Gál, Michal Koucký, Pierre McKenzie |
Incremental Branching Programs. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hugues Mercier, Pierre McKenzie, Stefan Wolf |
Worst Case Nonzero-Error Interactive Communication. |
IEEE Transactions on Information Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Michael Thomas, Heribert Vollmer |
Extensional Uniformity for Boolean Circuits. |
CSL |
2008 |
DBLP DOI BibTeX RDF |
descriptive complexity, uniformity, Boolean circuits |
| 1 | Pierre McKenzie, Klaus W. Wagner |
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers. |
Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q25, 68Q15, 03D15 |
| 1 | Luc Longpré, Pierre McKenzie |
The Complexity of Solitaire. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán |
Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566]. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer |
The many faces of a translation. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Gál, Michal Koucký, Pierre McKenzie |
Incremental Branching Programs. |
CSR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Gál, Pierre McKenzie, Michal Koucký |
Incremental branching programs. |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Anna Gál, Michal Koucký, Pierre McKenzie |
Incremental branching programs |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Alain Finkel, Pierre McKenzie, Claudine Picaronny |
A well-structured framework for analysing petri net extensions. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner |
Arithmetic Circuits and Polynomial Replacement Systems. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Pierre McKenzie |
Alternating and empty alternating auxiliary stack automata. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán |
Completeness results for graph isomorphism. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Klaus W. Wagner |
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Markus Holzer, Pierre McKenzie |
The complexity of tensor calculus. |
Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 15A69, 68Q70, 68Q17, 68Q15, 68Q05 |
| 1 | David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie |
On the Complexity of Some Problems on Groups Input as Multiplication Tables. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
The Descriptive Complexity Approach to LOGCFL. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Markus Holzer, Pierre McKenzie |
The Complexity of Tensor Calculus |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp |
Reversible Space Equals Deterministic Space. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer |
The Many Faces of a Translation. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien |
Equation Satisfiability and Program Satisfiability for Finite Monoids. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Pierre McKenzie |
Alternating and Empty Alternating Auxiliary Stack Automata. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie |
On the Complexity of Some Problems on Groups Input as Multiplication Tables. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
logic, circuit complexity, group membership, integer arithmetic |
| 1 | Carsten Damm, Markus Holzer, Pierre McKenzie |
The Complexity of Tensor Calculus. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner |
Arithmetic Circuits and Polynomial Replacement Systems. |
FSTTCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Pierre McKenzie |
Separation of the Monotone NC Hierarchy. |
Combinatorica |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q15, 68R99, 68Q25 |
| 1 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
The Descriptive Complexity Approach to LOGCFL. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Klaus Reinhardt, V. Vinay |
Circuits and Context-Free Languages. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Augustin Baziramwabo, Pierre McKenzie, Denis Thérien |
Modular Temporal Logic. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
semigroup theory, temporal logic, finite model theory |
| 1 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
The Descriptive Complexity Approach to LOGCFL |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
The descriptive complexity approach to LOGCFL |
CoRR |
1998 |
DBLP BibTeX RDF |
|
| 1 | Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer |
Nondeterministic NC1 Computation. |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Pierre McKenzie |
On the Complexity of Free Monoid Morphisms. |
ISAAC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Pierre McKenzie, Jacobo Torán |
A Note on the Hardness of Tree Isomorphism. (PDF / PS) |
IEEE Conference on Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Finkel, Pierre McKenzie |
Verifying Identical Communicating Processes is Undecidable. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien |
Finite Moniods: From Word to Circuit Evaluation. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Pierre McKenzie |
Separation of the Monotone NC Hierarchy. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
monotone NC hierarchy, tight lower bounds, monotone depth, DART games, communication complexity, communication complexity, search problems, monotone Boolean function |
| 1 | Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp |
Reversible Space Equals Deterministic Space. (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
determinism, reversible computation, Complexity classes, space bounds |
| 1 | Birgit Jenner, Pierre McKenzie, Denis Thérien |
Logspace and Logtime Leaf Languages. |
Inf. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer |
Nondeterministic NC1 Computation. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
nondeterministic Turing machine, leaf language, Computational complexity, circuit |
| 1 | Martin Beaudry, Pierre McKenzie |
Circuits, Matrices, and Nonassociative Computation. |
J. Comput. Syst. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Denis Thérien |
Special Issue on Circuit Complexity: Foreword. |
Computational Complexity |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Pierre McKenzie, Denis Thérien |
Logspace and Logtime Leaf Languages. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
| 1 | François Bédard, François Lemieux, Pierre McKenzie |
Extensions to Barrington's M-Program Model. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Beaudry, Pierre McKenzie, Denis Thérien |
The Membership Problem in Aperiodic Transformation Monoids. |
J. ACM |
1992 |
DBLP DOI BibTeX RDF |
aperiodic, membership, varieties, monoids |
| 1 | Martin Beaudry, Pierre McKenzie |
Cicuits, Matrices, and Nonassociative Computation. |
Structure in Complexity Theory Conference |
1992 |
DBLP BibTeX RDF |
|
| 1 | David A. Mix Barrington, Pierre McKenzie |
Oracle branching programs and Logspace versus P |
Inf. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Pierre Péladeau, Denis Thérien |
NC¹: The Automata-Theoretic Viewpoint. |
Computational Complexity |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | François Bédard, François Lemieux, Pierre McKenzie |
Extensions to Barrington's M-Program Model. |
Structure in Complexity Theory Conference |
1990 |
DBLP BibTeX RDF |
|
| 1 | Pierre McKenzie, Denis Thérien |
Automata Theory Meets Circuit Complexity. |
ICALP |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Mix Barrington, Pierre McKenzie |
Oracle Branching Programs and Logspace versus P. |
MFCS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Beaudry, Pierre McKenzie, Denis Thérien |
Testing Membership: Beyond Permutation Groups (Extended Abstract). |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Eugene M. Luks, Pierre McKenzie |
Parallel Algorithms for Solvable Permutation Groups. |
J. Comput. Syst. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Pierre McKenzie |
Problems Complete for Deterministic Logarithmic Space. |
J. Algorithms |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Stephen A. Cook |
The Parallel Complexity of Abelian Permutation Group Problems. |
SIAM J. Comput. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Eugene M. Luks, Pierre McKenzie |
Fast Parallel Computation with Permutation Groups |
FOCS |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie |
Permutations of Bounded Degree Generate Groups of Polynomial Diameter. |
Inf. Process. Lett. |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Stephen A. Cook |
The Parallel Complexity of the Abelian Permutation Group Membership Problem |
FOCS |
1983 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")