Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="McKenzie, P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The membership problem in aperiodic transformation monoids
M. Beaudry
,
P. McKenzie
,
D. Thérien
Journal of the ACM
39
(3), 1992, July, pp. 599-616
Extensions to Barrington's
M
-program model
F. Bédard
,
F. Lemieux
,
P. McKenzie
Proceedings of the 5th Annual Conference on Structure in Complexity Theory, CSCT'90 (Universitat Politcnica de Catalunya, Barcelona, Spain, July 8-11, 1990)
, 1990, pp. 200-209
Oracle branching programs and logspace versus
\P
(extended abstract)
D.A. Mix Barrington
,
P. McKenzie
Lecture Notes in Computer Science
379
, 1989, pp. 370-379
Testing membership: Beyond permutation groups
M. Beaudry
,
P. McKenzie
,
D. Thérien
Lecture Notes in Computer Science
349
, 1989, pp. 388-399
Automata theory meets circuit complexity
P. McKenzie
,
D. Thérien
Lecture Notes in Computer Science
372
, 1989, pp. 589-602
The parallel complexity of Abelian permutation group problems
P. McKenzie
,
S.A. Cook
SIAM Journal on Computing
16
(5), 1987, October, pp. 880-909
Fast parallel computation with permutation groups
E.M. Luks
,
P. McKenzie
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 505-514
Permutations of bounded degree generate groups of polynomial diameter
P. McKenzie
Information Processing Letters
19
(5), 1984, November, pp. 253-254
The parallel complexity of the Abelian permutation group membership problem
P. McKenzie
,
S.A. Cook
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 154-161