dblp.uni-trier.dewww.uni-trier.de

Pierre McKenzie Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
62EEBernd Borchert, Pierre McKenzie, Klaus Reinhardt: Few Product Gates But Many Zeros. MFCS 2009: 162-174
61EEMark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr: Branching Programs for Tree Evaluation. MFCS 2009: 175-186
2008
60EEPierre McKenzie, Michael Thomas, Heribert Vollmer: Extensional Uniformity for Boolean Circuits. CSL 2008: 64-78
59EEPierre McKenzie, Michael Thomas, Heribert Vollmer: Extensional Uniformity for Boolean Circuits CoRR abs/0805.4072: (2008)
58EEHugues Mercier, Pierre McKenzie, Stefan Wolf: Worst Case Nonzero-Error Interactive Communication. IEEE Transactions on Information Theory 54(7): 2857-2867 (2008)
57EEAnna Gál, Michal Koucký, Pierre McKenzie: Incremental Branching Programs. Theory Comput. Syst. 43(2): 159-184 (2008)
2007
56EELuc Longpré, Pierre McKenzie: The Complexity of Solitaire. MFCS 2007: 182-193
55EEPierre McKenzie, Klaus W. Wagner: The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers. Computational Complexity 16(3): 211-244 (2007)
2006
54EEAnna Gál, Michal Koucký, Pierre McKenzie: Incremental Branching Programs. CSR 2006: 178-190
53EEAnna Gál, Pierre McKenzie, Michal Koucký: Incremental branching programs. Complexity of Boolean Functions 2006
52EEPierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer: The many faces of a translation. J. Comput. Syst. Sci. 72(1): 163-179 (2006)
51EEBirgit 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. 72(4): 783 (2006)
2005
50EEAnna Gál, Michal Koucký, Pierre McKenzie: Incremental branching programs Electronic Colloquium on Computational Complexity (ECCC)(136): (2005)
2004
49EEAlain Finkel, Pierre McKenzie, Claudine Picaronny: A well-structured framework for analysing petri net extensions. Inf. Comput. 195(1-2): 1-29 (2004)
48EEPierre McKenzie, Heribert Vollmer, Klaus W. Wagner: Arithmetic Circuits and Polynomial Replacement Systems. SIAM J. Comput. 33(6): 1513-1531 (2004)
2003
47EEPierre McKenzie, Klaus W. Wagner: The Complexity of Membership Problems for Circuits over Sets of Natural Numbers. STACS 2003: 571-582
46EEBirgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán: Completeness results for graph isomorphism. J. Comput. Syst. Sci. 66(3): 549-566 (2003)
45EEMarkus Holzer, Pierre McKenzie: Alternating and empty alternating auxiliary stack automata. Theor. Comput. Sci. 1-3(299): 307-326 (2003)
2002
44EECarsten Damm, Markus Holzer, Pierre McKenzie: The complexity of tensor calculus. Computational Complexity 11(1-2): 54-89 (2002)
2001
43 Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629-652 (2001)
42 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. 63(2): 186-200 (2001)
2000
41EEPierre McKenzie, Heribert Vollmer, Klaus W. Wagner: Arithmetic Circuits and Polynomial Replacement Systems. FSTTCS 2000: 164-175
40EEPierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer: The Many Faces of a Translation. ICALP 2000: 890-901
39EEDavid A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie: On the Complexity of Some Problems on Groups Input as Multiplication Tables. IEEE Conference on Computational Complexity 2000: 62-69
38EECarsten Damm, Markus Holzer, Pierre McKenzie: The Complexity of Tensor Calculus. IEEE Conference on Computational Complexity 2000: 70-86
37EEDavid A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien: Equation Satisfiability and Program Satisfiability for Finite Monoids. MFCS 2000: 172-181
36EEMarkus Holzer, Pierre McKenzie: Alternating and Empty Alternating Auxiliary Stack Automata. MFCS 2000: 415-425
35EECarsten Damm, Markus Holzer, Pierre McKenzie: The Complexity of Tensor Calculus Electronic Colloquium on Computational Complexity (ECCC) 7(36): (2000)
34 Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp: Reversible Space Equals Deterministic Space. J. Comput. Syst. Sci. 60(2): 354-367 (2000)
1999
33EEPierre McKenzie, Klaus Reinhardt, V. Vinay: Circuits and Context-Free Languages. COCOON 1999: 194-203
32EEAugustin Baziramwabo, Pierre McKenzie, Denis Thérien: Modular Temporal Logic. LICS 1999: 344-351
31EEClemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. STACS 1999: 444-454
30EERan Raz, Pierre McKenzie: Separation of the Monotone NC Hierarchy. Combinatorica 19(3): 403-435 (1999)
1998
29EEBirgit Jenner, Pierre McKenzie, Jacobo Torán: A Note on the Hardness of Tree Isomorphism. IEEE Conference on Computational Complexity 1998: 101-105
28EEKlaus-Jörn Lange, Pierre McKenzie: On the Complexity of Free Monoid Morphisms. ISAAC 1998: 247-256
27EEClemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The descriptive complexity approach to LOGCFL CoRR cs.CC/9809114: (1998)
26EEClemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL Electronic Colloquium on Computational Complexity (ECCC) 5(59): (1998)
25 Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer: Nondeterministic NC1 Computation. J. Comput. Syst. Sci. 57(2): 200-212 (1998)
1997
24EERan Raz, Pierre McKenzie: Separation of the Monotone NC Hierarchy. FOCS 1997: 234-243
23EEKlaus-Jörn Lange, Pierre McKenzie, Alain Tapp: Reversible Space Equals Deterministic Space. IEEE Conference on Computational Complexity 1997: 45-50
22 Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien: Finite Moniods: From Word to Circuit Evaluation. SIAM J. Comput. 26(1): 138-152 (1997)
21EEAlain Finkel, Pierre McKenzie: Verifying Identical Communicating Processes is Undecidable. Theor. Comput. Sci. 174(1-2): 217-230 (1997)
1996
20EEHervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer: Nondeterministic NC1 Computation. IEEE Conference on Computational Complexity 1996: 12-21
19 Birgit Jenner, Pierre McKenzie, Denis Thérien: Logspace and Logtime Leaf Languages. Inf. Comput. 129(1): 21-33 (1996)
1995
18 Martin Beaudry, Pierre McKenzie: Circuits, Matrices, and Nonassociative Computation. J. Comput. Syst. Sci. 50(3): 441-455 (1995)
1994
17 Birgit Jenner, Pierre McKenzie, Denis Thérien: Logspace and Logtime Leaf Languages. Structure in Complexity Theory Conference 1994: 242-254
16 Pierre McKenzie, Denis Thérien: Special Issue on Circuit Complexity: Foreword. Computational Complexity 4: 297-300 (1994)
1993
15 François Bédard, François Lemieux, Pierre McKenzie: Extensions to Barrington's M-Program Model. Theor. Comput. Sci. 107(1): 31-61 (1993)
1992
14 Martin Beaudry, Pierre McKenzie: Cicuits, Matrices, and Nonassociative Computation. Structure in Complexity Theory Conference 1992: 94-106
13EEMartin Beaudry, Pierre McKenzie, Denis Thérien: The Membership Problem in Aperiodic Transformation Monoids. J. ACM 39(3): 599-616 (1992)
1991
12 Pierre McKenzie, Pierre Péladeau, Denis Thérien: NC¹: The Automata-Theoretic Viewpoint. Computational Complexity 1: 330-359 (1991)
11 David A. Mix Barrington, Pierre McKenzie: Oracle branching programs and Logspace versus P Inf. Comput. 95(1): 96-115 (1991)
1990
10 François Bédard, François Lemieux, Pierre McKenzie: Extensions to Barrington's M-Program Model. Structure in Complexity Theory Conference 1990: 200-209
1989
9EEPierre McKenzie, Denis Thérien: Automata Theory Meets Circuit Complexity. ICALP 1989: 589-602
8EEDavid A. Mix Barrington, Pierre McKenzie: Oracle Branching Programs and Logspace versus P. MFCS 1989: 370-379
7EEMartin Beaudry, Pierre McKenzie, Denis Thérien: Testing Membership: Beyond Permutation Groups (Extended Abstract). STACS 1989: 388-399
1988
6 Eugene M. Luks, Pierre McKenzie: Parallel Algorithms for Solvable Permutation Groups. J. Comput. Syst. Sci. 37(1): 39-62 (1988)
1987
5 Stephen A. Cook, Pierre McKenzie: Problems Complete for Deterministic Logarithmic Space. J. Algorithms 8(3): 385-394 (1987)
4 Pierre McKenzie, Stephen A. Cook: The Parallel Complexity of Abelian Permutation Group Problems. SIAM J. Comput. 16(5): 880-909 (1987)
1985
3 Eugene M. Luks, Pierre McKenzie: Fast Parallel Computation with Permutation Groups FOCS 1985: 505-514
1984
2 Pierre McKenzie: Permutations of Bounded Degree Generate Groups of Polynomial Diameter. Inf. Process. Lett. 19(5): 253-254 (1984)
1983
1 Pierre McKenzie, Stephen A. Cook: The Parallel Complexity of the Abelian Permutation Group Membership Problem FOCS 1983: 154-161

Coauthor Index

1David A. Mix Barrington [8] [11] [37] [39] [42]
2Augustin Baziramwabo [32]
3Martin Beaudry [7] [13] [14] [18] [22]
4François Bédard [10] [15]
5Bernd Borchert [62]
6Mark Braverman [61]
7Hervé Caussinus [20] [25]
8Stephen A. Cook [1] [4] [5] [61]
9Carsten Damm [35] [38] [44]
10Alain Finkel [21] [49]
11Anna Gál [50] [53] [54] [57]
12Markus Holzer [35] [36] [38] [44] [45]
13Birgit Jenner [17] [19] [29] [46] [51]
14Peter Kadau [39] [42]
15Johannes Köbler [46] [51]
16Michal Koucký [50] [53] [54] [57]
17Klaus-Jörn Lange [23] [28] [34] [39] [42]
18Clemens Lautemann [26] [27] [31] [43]
19François Lemieux [10] [15]
20Luc Longpré [56]
21Eugene M. Luks [3] [6]
22Hugues Mercier [58]
23Cristopher Moore [37]
24Pierre Péladeau [12] [22]
25Claudine Picaronny [49]
26Ran Raz [24] [30]
27Klaus Reinhardt [33] [62]
28Rahul Santhanam [61]
29Thomas Schwentick [26] [27] [31] [40] [43] [52]
30Alain Tapp [23] [34]
31Pascal Tesson [37]
32Denis Thérien [7] [9] [12] [13] [16] [17] [19] [20] [22] [25] [32] [37] [40] [52]
33Michael Thomas [59] [60]
34Jacobo Torán [29] [46] [51]
35V. Vinay [33]
36Heribert Vollmer [20] [25] [26] [27] [31] [40] [41] [43] [48] [52] [59] [60]
37Klaus W. Wagner [41] [47] [48] [55]
38Dustin Wehr [61]
39Stefan Wolf [58]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)