( en | de | ru )

 

Disambiguation of "McKenzie, Pierre"

Author of the publication

copydeleteadd this publication to your clipboard
Better Complexity Bounds for Cost Register Automata.

, , and . MFCS, volume 83 of LIPIcs, page 24:1-24:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Edwin McKenzie

Craig McKenzie

Tom McKenzie

Russell McKenzie Deighton

Mary M McKenzie

 

Other publications of authors with the same name

Incremental Branching Programs., , and . Theory Comput. Syst., 43 (2): 159-184 (2008)Nondeterminism and An Abstract Formulation of Nečiporuk's Lower Bound Method., , , and . ACM Trans. Comput. Theory, 9 (1): 5:1-5:34 (2016)Tameness and the power of programs over monoids in DA., , and . Log. Methods Comput. Sci., (2022)Separation of the Monotone NC Hierarchy., and . Comb., 19 (3): 403-435 (1999)The Membership Problem in Aperiodic Transformation Monoids., , and . J. ACM, 39 (3): 599-616 (1992)Can Chimps Go It Alone?. DCFS, volume 8031 of Lecture Notes in Computer Science, page 17. Springer, (2013)Arithmetic Circuits and Polynomial Replacement Systems., , and . FSTTCS, volume 1974 of Lecture Notes in Computer Science, page 164-175. Springer, (2000)Systems and Software Verification, Model-Checking Techniques and Tools., , , , , , , and . Springer, (2001)Pebbles and Branching Programs for Tree Evaluation., , , , and . Logic, Automata, and Computational Complexity, volume 43 of ACM Books, ACM, (2023)Fast Parallel Computation with Permutation Groups, and . FOCS, page 505-514. IEEE Computer Society, (1985)