|
Search the dblp DataBase
Pierre McKenzie:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Stephen A. Cook, Pierre McKenzie
Problems Complete for Deterministic Logarithmic Space. [Citation Graph (1, 0)][DBLP] J. Algorithms, 1987, v:8, n:3, pp:385-394 [Journal]
- David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie
On the Complexity of Some Problems on Groups Input as Multiplication Tables. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:62-69 [Conf]
- Martin Beaudry, Pierre McKenzie
Cicuits, Matrices, and Nonassociative Computation. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:94-106 [Conf]
- François Bédard, François Lemieux, Pierre McKenzie
Extensions to Barrington's M-Program Model. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:200-209 [Conf]
- Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
Nondeterministic NC1 Computation. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:12-21 [Conf]
- Carsten Damm, Markus Holzer, Pierre McKenzie
The Complexity of Tensor Calculus. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:70-86 [Conf]
- Birgit Jenner, Pierre McKenzie, Denis Thérien
Logspace and Logtime Leaf Languages. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1994, pp:242-254 [Conf]
- Birgit Jenner, Pierre McKenzie, Jacobo Torán
A Note on the Hardness of Tree Isomorphism. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1998, pp:101-105 [Conf]
- Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp
Reversible Space Equals Deterministic Space. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:45-50 [Conf]
- Pierre McKenzie, Klaus Reinhardt, V. Vinay
Circuits and Context-Free Languages. [Citation Graph (0, 0)][DBLP] COCOON, 1999, pp:194-203 [Conf]
- Anna Gál, Michal Koucký, Pierre McKenzie
Incremental Branching Programs. [Citation Graph (0, 0)][DBLP] CSR, 2006, pp:178-190 [Conf]
- Pierre McKenzie, Stephen A. Cook
The Parallel Complexity of the Abelian Permutation Group Membership Problem [Citation Graph (0, 0)][DBLP] FOCS, 1983, pp:154-161 [Conf]
- Eugene M. Luks, Pierre McKenzie
Fast Parallel Computation with Permutation Groups [Citation Graph (0, 0)][DBLP] FOCS, 1985, pp:505-514 [Conf]
- Ran Raz, Pierre McKenzie
Separation of the Monotone NC Hierarchy. [Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:234-243 [Conf]
- Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
Arithmetic Circuits and Polynomial Replacement Systems. [Citation Graph (0, 0)][DBLP] FSTTCS, 2000, pp:164-175 [Conf]
- Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
The Many Faces of a Translation. [Citation Graph (0, 0)][DBLP] ICALP, 2000, pp:890-901 [Conf]
- Pierre McKenzie, Denis Thérien
Automata Theory Meets Circuit Complexity. [Citation Graph (0, 0)][DBLP] ICALP, 1989, pp:589-602 [Conf]
- Klaus-Jörn Lange, Pierre McKenzie
On the Complexity of Free Monoid Morphisms. [Citation Graph (0, 0)][DBLP] ISAAC, 1998, pp:247-256 [Conf]
- Augustin Baziramwabo, Pierre McKenzie, Denis Thérien
Modular Temporal Logic. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:344-351 [Conf]
- David A. Mix Barrington, Pierre McKenzie
Oracle Branching Programs and Logspace versus P. [Citation Graph (0, 0)][DBLP] MFCS, 1989, pp:370-379 [Conf]
- David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien
Equation Satisfiability and Program Satisfiability for Finite Monoids. [Citation Graph (0, 0)][DBLP] MFCS, 2000, pp:172-181 [Conf]
- Markus Holzer, Pierre McKenzie
Alternating and Empty Alternating Auxiliary Stack Automata. [Citation Graph (0, 0)][DBLP] MFCS, 2000, pp:415-425 [Conf]
- Martin Beaudry, Pierre McKenzie, Denis Thérien
Testing Membership: Beyond Permutation Groups (Extended Abstract). [Citation Graph (0, 0)][DBLP] STACS, 1989, pp:388-399 [Conf]
- Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
The Descriptive Complexity Approach to LOGCFL. [Citation Graph (0, 0)][DBLP] STACS, 1999, pp:444-454 [Conf]
- Pierre McKenzie, Klaus W. Wagner
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers. [Citation Graph (0, 0)][DBLP] STACS, 2003, pp:571-582 [Conf]
- Carsten Damm, Markus Holzer, Pierre McKenzie
The complexity of tensor calculus. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2002, v:11, n:1-2, pp:54-89 [Journal]
- Pierre McKenzie, Pierre Péladeau, Denis Thérien
NC¹: The Automata-Theoretic Viewpoint. [Citation Graph (0, 0)][DBLP] Computational Complexity, 1991, v:1, n:, pp:330-359 [Journal]
- Pierre McKenzie, Denis Thérien
Special Issue on Circuit Complexity: Foreword. [Citation Graph (0, 0)][DBLP] Computational Complexity, 1994, v:4, n:, pp:297-300 [Journal]
- Ran Raz, Pierre McKenzie
Separation of the Monotone NC Hierarchy. [Citation Graph (0, 0)][DBLP] Combinatorica, 1999, v:19, n:3, pp:403-435 [Journal]
- Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
The descriptive complexity approach to LOGCFL [Citation Graph (0, 0)][DBLP] CoRR, 1998, v:0, n:, pp:- [Journal]
- Carsten Damm, Markus Holzer, Pierre McKenzie
The Complexity of Tensor Calculus [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:36, pp:- [Journal]
- Anna Gál, Michal Koucký, Pierre McKenzie
Incremental branching programs [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:136, pp:- [Journal]
- Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
The Descriptive Complexity Approach to LOGCFL [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:59, pp:- [Journal]
- David A. Mix Barrington, Pierre McKenzie
Oracle branching programs and Logspace versus P [Citation Graph (0, 0)][DBLP] Inf. Comput., 1991, v:95, n:1, pp:96-115 [Journal]
- Alain Finkel, Pierre McKenzie, Claudine Picaronny
A well-structured framework for analysing petri net extensions. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2004, v:195, n:1-2, pp:1-29 [Journal]
- Birgit Jenner, Pierre McKenzie, Denis Thérien
Logspace and Logtime Leaf Languages. [Citation Graph (0, 0)][DBLP] Inf. Comput., 1996, v:129, n:1, pp:21-33 [Journal]
- Pierre McKenzie
Permutations of Bounded Degree Generate Groups of Polynomial Diameter. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1984, v:19, n:5, pp:253-254 [Journal]
- Martin Beaudry, Pierre McKenzie, Denis Thérien
The Membership Problem in Aperiodic Transformation Monoids. [Citation Graph (0, 0)][DBLP] J. ACM, 1992, v:39, n:3, pp:599-616 [Journal]
- David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie
On the Complexity of Some Problems on Groups Input as Multiplication Tables. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2001, v:63, n:2, pp:186-200 [Journal]
- Martin Beaudry, Pierre McKenzie
Circuits, Matrices, and Nonassociative Computation. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1995, v:50, n:3, pp:441-455 [Journal]
- Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
Nondeterministic NC1 Computation. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1998, v:57, n:2, pp:200-212 [Journal]
- Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán
Completeness results for graph isomorphism. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:66, n:3, pp:549-566 [Journal]
- 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]. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:4, pp:783- [Journal]
- Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp
Reversible Space Equals Deterministic Space. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2000, v:60, n:2, pp:354-367 [Journal]
- Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
The Descriptive Complexity Approach to LOGCFL. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2001, v:62, n:4, pp:629-652 [Journal]
- Eugene M. Luks, Pierre McKenzie
Parallel Algorithms for Solvable Permutation Groups. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1988, v:37, n:1, pp:39-62 [Journal]
- Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
The many faces of a translation. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:163-179 [Journal]
- Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien
Finite Moniods: From Word to Circuit Evaluation. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1997, v:26, n:1, pp:138-152 [Journal]
- Pierre McKenzie, Stephen A. Cook
The Parallel Complexity of Abelian Permutation Group Problems. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1987, v:16, n:5, pp:880-909 [Journal]
- Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
Arithmetic Circuits and Polynomial Replacement Systems. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:33, n:6, pp:1513-1531 [Journal]
- François Bédard, François Lemieux, Pierre McKenzie
Extensions to Barrington's M-Program Model. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:107, n:1, pp:31-61 [Journal]
- Alain Finkel, Pierre McKenzie
Verifying Identical Communicating Processes is Undecidable. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:174, n:1-2, pp:217-230 [Journal]
- Markus Holzer, Pierre McKenzie
Alternating and empty alternating auxiliary stack automata. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:1, n:299, pp:307-326 [Journal]
- Luc Longpré, Pierre McKenzie
The Complexity of Solitaire. [Citation Graph (0, 0)][DBLP] MFCS, 2007, pp:182-193 [Conf]
Extensional Uniformity for Boolean Circuits. [Citation Graph (, )][DBLP]
Incremental branching programs. [Citation Graph (, )][DBLP]
Fractional Pebbling and Thrifty Branching Programs. [Citation Graph (, )][DBLP]
Few Product Gates But Many Zeros. [Citation Graph (, )][DBLP]
Branching Programs for Tree Evaluation. [Citation Graph (, )][DBLP]
The Computational Complexity of RaceTrack. [Citation Graph (, )][DBLP]
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers. [Citation Graph (, )][DBLP]
Extensional Uniformity for Boolean Circuits [Citation Graph (, )][DBLP]
Pebbles and Branching Programs for Tree Evaluation [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.454secs
|