Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Pierre McKenzie
@incollection{DBLP:books/acm/23/BeameM23, author = {Paul Beame and Pierre McKenzie}, editor = {Bruce M. Kapron}, title = {Towards a Complexity Theory of Parallel Computation}, booktitle = {Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook}, series = {{ACM} Books}, volume = {43}, pages = {107--126}, publisher = {{ACM}}, year = {2023}, url = {https://doi.org/10.1145/3588287.3588295}, doi = {10.1145/3588287.3588295}, timestamp = {Thu, 21 Sep 2023 14:31:10 +0200}, biburl = {https://dblp.org/rec/books/acm/23/BeameM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/acm/23/CookMWBS23, author = {Stephen A. Cook and Pierre McKenzie and Dustin Wehr and Mark Braverman and Rahul Santhanam}, editor = {Bruce M. Kapron}, title = {Pebbles and Branching Programs for Tree Evaluation}, booktitle = {Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook}, series = {{ACM} Books}, volume = {43}, pages = {261--318}, publisher = {{ACM}}, year = {2023}, url = {https://doi.org/10.1145/3588287.3588303}, doi = {10.1145/3588287.3588303}, timestamp = {Thu, 21 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/acm/23/CookMWBS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2305-11276, author = {Yaqiao Li and Pierre McKenzie}, title = {Perspective on complexity measures targetting read-once branching programs}, journal = {CoRR}, volume = {abs/2305.11276}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2305.11276}, doi = {10.48550/ARXIV.2305.11276}, eprinttype = {arXiv}, eprint = {2305.11276}, timestamp = {Thu, 25 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2305-11276.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmcs/GrosshansMS22, author = {Nathan Grosshans and Pierre McKenzie and Luc Segoufin}, title = {Tameness and the power of programs over monoids in {DA}}, journal = {Log. Methods Comput. Sci.}, volume = {18}, number = {3}, year = {2022}, url = {https://doi.org/10.46298/lmcs-18(3:14)2022}, doi = {10.46298/LMCS-18(3:14)2022}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/lmcs/GrosshansMS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/BlondinEFGHLMT21, author = {Michael Blondin and Matthias Englert and Alain Finkel and Stefan G{\"{o}}ller and Christoph Haase and Ranko Lazic and Pierre McKenzie and Patrick Totzke}, title = {The Reachability Problem for Two-Dimensional Vector Addition Systems with States}, journal = {J. {ACM}}, volume = {68}, number = {5}, pages = {34:1--34:43}, year = {2021}, url = {https://doi.org/10.1145/3464794}, doi = {10.1145/3464794}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/BlondinEFGHLMT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2101-07495, author = {Nathan Grosshans and Pierre McKenzie and Luc Segoufin}, title = {Tameness and the power of programs over monoids in {DA}}, journal = {CoRR}, volume = {abs/2101.07495}, year = {2021}, url = {https://arxiv.org/abs/2101.07495}, eprinttype = {arXiv}, eprint = {2101.07495}, timestamp = {Sat, 23 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2101-07495.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/AllenderKM19, author = {Eric Allender and Andreas Krebs and Pierre McKenzie}, title = {Better Complexity Bounds for Cost Register Automata}, journal = {Theory Comput. Syst.}, volume = {63}, number = {3}, pages = {367--385}, year = {2019}, url = {https://doi.org/10.1007/s00224-018-9871-4}, doi = {10.1007/S00224-018-9871-4}, timestamp = {Fri, 12 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/AllenderKM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BlondinFM18, author = {Michael Blondin and Alain Finkel and Pierre McKenzie}, title = {Handling infinitely branching well-structured transition systems}, journal = {Inf. Comput.}, volume = {258}, pages = {28--49}, year = {2018}, url = {https://doi.org/10.1016/j.ic.2017.11.001}, doi = {10.1016/J.IC.2017.11.001}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BlondinFM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/CadilhacKM18, author = {Micha{\"{e}}l Cadilhac and Andreas Krebs and Pierre McKenzie}, title = {The Algebraic Theory of Parikh Automata}, journal = {Theory Comput. Syst.}, volume = {62}, number = {5}, pages = {1241--1268}, year = {2018}, url = {https://doi.org/10.1007/s00224-017-9817-2}, doi = {10.1007/S00224-017-9817-2}, timestamp = {Sat, 05 May 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/CadilhacKM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmcs/BlondinFM17, author = {Michael Blondin and Alain Finkel and Pierre McKenzie}, title = {Well Behaved Transition Systems}, journal = {Log. Methods Comput. Sci.}, volume = {13}, number = {3}, year = {2017}, url = {https://doi.org/10.23638/LMCS-13(3:24)2017}, doi = {10.23638/LMCS-13(3:24)2017}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmcs/BlondinFM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/ImpagliazzoKKMR17, author = {Russell Impagliazzo and Valentine Kabanets and Antonina Kolokolova and Pierre McKenzie and Shadab Romani}, editor = {Kim G. Larsen and Hans L. Bodlaender and Jean{-}Fran{\c{c}}ois Raskin}, title = {Does Looking Inside a Circuit Help?}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark}, series = {LIPIcs}, volume = {83}, pages = {1:1--1:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.1}, doi = {10.4230/LIPICS.MFCS.2017.1}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/ImpagliazzoKKMR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/GrosshansMS17, author = {Nathan Grosshans and Pierre McKenzie and Luc Segoufin}, editor = {Kim G. Larsen and Hans L. Bodlaender and Jean{-}Fran{\c{c}}ois Raskin}, title = {The Power of Programs over Monoids in {DA}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark}, series = {LIPIcs}, volume = {83}, pages = {2:1--2:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.2}, doi = {10.4230/LIPICS.MFCS.2017.2}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/GrosshansMS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/AllenderKM17, author = {Eric Allender and Andreas Krebs and Pierre McKenzie}, editor = {Kim G. Larsen and Hans L. Bodlaender and Jean{-}Fran{\c{c}}ois Raskin}, title = {Better Complexity Bounds for Cost Register Automata}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark}, series = {LIPIcs}, volume = {83}, pages = {24:1--24:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.24}, doi = {10.4230/LIPICS.MFCS.2017.24}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/AllenderKM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/stoc/2017, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399}, doi = {10.1145/3055399}, isbn = {978-1-4503-4528-6}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/2017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AllenderKM17, author = {Eric Allender and Andreas Krebs and Pierre McKenzie}, title = {Better Complexity Bounds for Cost Register Machines}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-072}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/072}, eprinttype = {ECCC}, eprint = {TR17-072}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AllenderKM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ImpagliazzoKKMR17, author = {Russell Impagliazzo and Valentine Kabanets and Antonina Kolokolova and Pierre McKenzie and Shadab Romani}, title = {Does Looking Inside a Circuit Help?}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-109}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/109}, eprinttype = {ECCC}, eprint = {TR17-109}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoKKMR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/BlondinKM16, author = {Michael Blondin and Andreas Krebs and Pierre McKenzie}, title = {The complexity of intersecting finite automata having few final states}, journal = {Comput. Complex.}, volume = {25}, number = {4}, pages = {775--814}, year = {2016}, url = {https://doi.org/10.1007/s00037-014-0089-9}, doi = {10.1007/S00037-014-0089-9}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/BlondinKM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/BeameGMS16, author = {Paul Beame and Nathan Grosshans and Pierre McKenzie and Luc Segoufin}, title = {Nondeterminism and An Abstract Formulation of Ne{\v{c}}iporuk's Lower Bound Method}, journal = {{ACM} Trans. Comput. Theory}, volume = {9}, number = {1}, pages = {5:1--5:34}, year = {2016}, url = {https://doi.org/10.1145/3013516}, doi = {10.1145/3013516}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toct/BeameGMS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/EliasM16, author = {Yara Elias and Pierre McKenzie}, title = {On Generalized Addition Chains}, journal = {CoRR}, volume = {abs/1607.07011}, year = {2016}, url = {http://arxiv.org/abs/1607.07011}, eprinttype = {arXiv}, eprint = {1607.07011}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/EliasM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BeameGMS16, author = {Paul Beame and Nathan Grosshans and Pierre McKenzie and Luc Segoufin}, title = {Nondeterminism and an abstract formulation of Ne{\v{c}}iporuk's lower bound method}, journal = {CoRR}, volume = {abs/1608.01932}, year = {2016}, url = {http://arxiv.org/abs/1608.01932}, eprinttype = {arXiv}, eprint = {1608.01932}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BeameGMS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BlondinFM16, author = {Michael Blondin and Alain Finkel and Pierre McKenzie}, title = {Well Behaved Transition Systems}, journal = {CoRR}, volume = {abs/1608.02636}, year = {2016}, url = {http://arxiv.org/abs/1608.02636}, eprinttype = {arXiv}, eprint = {1608.02636}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BlondinFM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lics/BlondinFGHM15, author = {Michael Blondin and Alain Finkel and Stefan G{\"{o}}ller and Christoph Haase and Pierre McKenzie}, title = {Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete}, booktitle = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2015, Kyoto, Japan, July 6-10, 2015}, pages = {32--43}, publisher = {{IEEE} Computer Society}, year = {2015}, url = {https://doi.org/10.1109/LICS.2015.14}, doi = {10.1109/LICS.2015.14}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/lics/BlondinFGHM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/int/EliasM14, author = {Yara Elias and Pierre McKenzie}, title = {On Generalized Addition Chains}, journal = {Integers}, volume = {14}, pages = {A16}, year = {2014}, url = {http://math.colgate.edu/\%7Eintegers/o16/o16.Abstract.html}, timestamp = {Wed, 25 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/int/EliasM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BlondinFM14, author = {Michael Blondin and Alain Finkel and Pierre McKenzie}, editor = {Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias}, title = {Handling Infinitely Branching {WSTS}}, booktitle = {Automata, Languages, and Programming - 41st International Colloquium, {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {8573}, pages = {13--25}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-43951-7\_2}, doi = {10.1007/978-3-662-43951-7\_2}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BlondinFM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ncma/CadilhacKM14, author = {Micha{\"{e}}l Cadilhac and Andreas Krebs and Pierre McKenzie}, editor = {Suna Bensch and Rudolf Freund and Friedrich Otto}, title = {Extremely uniform branching programs}, booktitle = {Sixth Workshop on Non-Classical Models for Automata and Applications - {NCMA} 2014, Kassel, Germany, July 28-29, 2014. Proceedings}, series = {books@ocg.at}, volume = {304}, pages = {73--83}, publisher = {{\"{O}}sterreichische Computer Gesellschaft}, year = {2014}, timestamp = {Thu, 23 Jun 2016 15:53:29 +0200}, biburl = {https://dblp.org/rec/conf/ncma/CadilhacKM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BlondinFGHM14, author = {Michael Blondin and Alain Finkel and Stefan G{\"{o}}ller and Christoph Haase and Pierre McKenzie}, title = {Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete}, journal = {CoRR}, volume = {abs/1412.4259}, year = {2014}, url = {http://arxiv.org/abs/1412.4259}, eprinttype = {arXiv}, eprint = {1412.4259}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BlondinFGHM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/EsparzaFMO14, author = {Javier Esparza and Alain Finkel and Pierre McKenzie and Jo{\"{e}}l Ouaknine}, title = {Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141)}, journal = {Dagstuhl Reports}, volume = {4}, number = {3}, pages = {153--180}, year = {2014}, url = {https://doi.org/10.4230/DagRep.4.3.153}, doi = {10.4230/DAGREP.4.3.153}, timestamp = {Wed, 07 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/EsparzaFMO14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cjtcs/BorchertMR13, author = {Bernd Borchert and Pierre McKenzie and Klaus Reinhardt}, title = {Few Product Gates but Many Zeroes}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {2013}, year = {2013}, url = {http://cjtcs.cs.uchicago.edu/articles/2013/2/contents.html}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/BorchertMR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/CadilhacFM13, author = {Micha{\"{e}}l Cadilhac and Alain Finkel and Pierre McKenzie}, title = {Unambiguous constrained Automata}, journal = {Int. J. Found. Comput. Sci.}, volume = {24}, number = {7}, pages = {1099--1116}, year = {2013}, url = {https://doi.org/10.1142/S0129054113400339}, doi = {10.1142/S0129054113400339}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/CadilhacFM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cai/CadilhacKM13, author = {Micha{\"{e}}l Cadilhac and Andreas Krebs and Pierre McKenzie}, editor = {Traian Muntean and Dimitrios Poulakis and Robert Rolland}, title = {The Algebraic Theory of Parikh Automata}, booktitle = {Algebraic Informatics - 5th International Conference, {CAI} 2013, Porquerolles, France, September 3-6, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8080}, pages = {60--73}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40663-8\_7}, doi = {10.1007/978-3-642-40663-8\_7}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/cai/CadilhacKM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dcfs/McKenzie13, author = {Pierre McKenzie}, editor = {Helmut J{\"{u}}rgensen and Rog{\'{e}}rio Reis}, title = {Can Chimps Go It Alone?}, booktitle = {Descriptional Complexity of Formal Systems - 15th International Workshop, {DCFS} 2013, London, ON, Canada, July 22-25, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8031}, pages = {17}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-39310-5\_3}, doi = {10.1007/978-3-642-39310-5\_3}, timestamp = {Tue, 14 May 2019 10:00:55 +0200}, biburl = {https://dblp.org/rec/conf/dcfs/McKenzie13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/CadilhacKM13, author = {Micha{\"{e}}l Cadilhac and Andreas Krebs and Pierre McKenzie}, title = {The Algebraic Theory of Parikh Automata}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-040}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/040}, eprinttype = {ECCC}, eprint = {TR13-040}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/CadilhacKM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/CadilhacFM12, author = {Micha{\"{e}}l Cadilhac and Alain Finkel and Pierre McKenzie}, title = {Bounded Parikh Automata}, journal = {Int. J. Found. Comput. Sci.}, volume = {23}, number = {8}, pages = {1691--1710}, year = {2012}, url = {https://doi.org/10.1142/S0129054112400709}, doi = {10.1142/S0129054112400709}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/CadilhacFM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/CadilhacFM12, author = {Micha{\"{e}}l Cadilhac and Alain Finkel and Pierre McKenzie}, title = {Affine Parikh automata}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {46}, number = {4}, pages = {511--545}, year = {2012}, url = {https://doi.org/10.1051/ita/2012013}, doi = {10.1051/ITA/2012013}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/CadilhacFM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/CookMWBS12, author = {Stephen A. Cook and Pierre McKenzie and Dustin Wehr and Mark Braverman and Rahul Santhanam}, title = {Pebbles and Branching Programs for Tree Evaluation}, journal = {{ACM} Trans. Comput. Theory}, volume = {3}, number = {2}, pages = {4:1--4:43}, year = {2012}, url = {https://doi.org/10.1145/2077336.2077337}, doi = {10.1145/2077336.2077337}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/CookMWBS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/BlondinM12, author = {Michael Blondin and Pierre McKenzie}, editor = {Edward A. Hirsch and Juhani Karhum{\"{a}}ki and Arto Lepist{\"{o}} and Michail Kh. Prilutskii}, title = {The Complexity of Intersecting Finite Automata Having Few Final States}, booktitle = {Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, {CSR} 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7353}, pages = {31--42}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-30642-6\_4}, doi = {10.1007/978-3-642-30642-6\_4}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/csr/BlondinM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dlt/CadilhacFM12, author = {Micha{\"{e}}l Cadilhac and Alain Finkel and Pierre McKenzie}, editor = {Hsu{-}Chun Yen and Oscar H. Ibarra}, title = {Unambiguous Constrained Automata}, booktitle = {Developments in Language Theory - 16th International Conference, {DLT} 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7410}, pages = {239--250}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-31653-1\_22}, doi = {10.1007/978-3-642-31653-1\_22}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/dlt/CadilhacFM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BehleKLM12, author = {Christoph Behle and Andreas Krebs and Klaus{-}J{\"{o}}rn Lange and Pierre McKenzie}, editor = {Branislav Rovan and Vladimiro Sassone and Peter Widmayer}, title = {The Lower Reaches of Circuit Uniformity}, booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7464}, pages = {590--602}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-32589-2\_52}, doi = {10.1007/978-3-642-32589-2\_52}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/BehleKLM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BlondinKM12, author = {Michael Blondin and Andreas Krebs and Pierre McKenzie}, title = {The Complexity of Intersecting Finite Automata Having Few Final States}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-090}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/090}, eprinttype = {ECCC}, eprint = {TR12-090}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BlondinKM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ncma/CadilhacFM11, author = {Micha{\"{e}}l Cadilhac and Alain Finkel and Pierre McKenzie}, editor = {Rudolf Freund and Markus Holzer and Carlo Mereghetti and Friedrich Otto and Beatrice Palano}, title = {On the Expressiveness of Parikh Automata and Related Models}, booktitle = {Third Workshop on Non-Classical Models for Automata and Applications - {NCMA} 2011, Milan, Italy, July 18 - July 19, 2011. Proceedings}, series = {books@ocg.at}, volume = {282}, pages = {103--119}, publisher = {Austrian Computer Society}, year = {2011}, timestamp = {Thu, 17 Mar 2016 10:50:07 +0100}, biburl = {https://dblp.org/rec/conf/ncma/CadilhacFM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:journals/corr/abs-1108-3625, author = {Micha{\"{e}}l Cadilhac and Alain Finkel and Pierre McKenzie}, editor = {Petr Ambroz and Stepan Holub and Zuzana Mas{\'{a}}kov{\'{a}}}, title = {Bounded Parikh Automata}, booktitle = {Proceedings 8th International Conference Words 2011, Prague, Czech Republic, 12-16th September 2011}, series = {{EPTCS}}, volume = {63}, pages = {93--102}, year = {2011}, url = {https://doi.org/10.4204/EPTCS.63.13}, doi = {10.4204/EPTCS.63.13}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1108-3625.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1101-1547, author = {Micha{\"{e}}l Cadilhac and Alain Finkel and Pierre McKenzie}, title = {Storming the Parikh Automaton}, journal = {CoRR}, volume = {abs/1101.1547}, year = {2011}, url = {http://arxiv.org/abs/1101.1547}, eprinttype = {arXiv}, eprint = {1101.1547}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1101-1547.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BehleKLM11, author = {Christoph Behle and Andreas Krebs and Klaus{-}J{\"{o}}rn Lange and Pierre McKenzie}, title = {Low uniform versions of {NC1}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-095}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/095}, eprinttype = {ECCC}, eprint = {TR11-095}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BehleKLM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/McKenzieTV10, author = {Pierre McKenzie and Michael Thomas and Heribert Vollmer}, title = {Extensional Uniformity for Boolean Circuits}, journal = {{SIAM} J. Comput.}, volume = {39}, number = {7}, pages = {3186--3206}, year = {2010}, url = {https://doi.org/10.1137/080741811}, doi = {10.1137/080741811}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/McKenzieTV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fun/HolzerM10, author = {Markus Holzer and Pierre McKenzie}, editor = {Paolo Boldi and Luisa Gargano}, title = {The Computational Complexity of RaceTrack}, booktitle = {Fun with Algorithms, 5th International Conference, {FUN} 2010, Ischia, Italy, June 2-4, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6099}, pages = {260--271}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13122-6\_26}, doi = {10.1007/978-3-642-13122-6\_26}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fun/HolzerM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1005-2642, author = {Stephen A. Cook and Pierre McKenzie and Dustin Wehr and Mark Braverman and Rahul Santhanam}, title = {Pebbles and Branching Programs for Tree Evaluation}, journal = {CoRR}, volume = {abs/1005.2642}, year = {2010}, url = {http://arxiv.org/abs/1005.2642}, eprinttype = {arXiv}, eprint = {1005.2642}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1005-2642.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LongpreM09, author = {Luc Longpr{\'{e}} and Pierre McKenzie}, title = {The complexity of Solitaire}, journal = {Theor. Comput. Sci.}, volume = {410}, number = {50}, pages = {5252--5260}, year = {2009}, url = {https://doi.org/10.1016/j.tcs.2009.08.027}, doi = {10.1016/J.TCS.2009.08.027}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/LongpreM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/BravermanCMSW09, author = {Mark Braverman and Stephen A. Cook and Pierre McKenzie and Rahul Santhanam and Dustin Wehr}, editor = {Ravi Kannan and K. Narayan Kumar}, title = {Fractional Pebbling and Thrifty Branching Programs}, booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009, {IIT} Kanpur, India}, series = {LIPIcs}, volume = {4}, pages = {109--120}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2009}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2311}, doi = {10.4230/LIPICS.FSTTCS.2009.2311}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/BravermanCMSW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BorchertMR09, author = {Bernd Borchert and Pierre McKenzie and Klaus Reinhardt}, editor = {Rastislav Kr{\'{a}}lovic and Damian Niwinski}, title = {Few Product Gates But Many Zeros}, booktitle = {Mathematical Foundations of Computer Science 2009, 34th International Symposium, {MFCS} 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5734}, pages = {162--174}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03816-7\_15}, doi = {10.1007/978-3-642-03816-7\_15}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/BorchertMR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BravermanCMSW09, author = {Mark Braverman and Stephen A. Cook and Pierre McKenzie and Rahul Santhanam and Dustin Wehr}, editor = {Rastislav Kr{\'{a}}lovic and Damian Niwinski}, title = {Branching Programs for Tree Evaluation}, booktitle = {Mathematical Foundations of Computer Science 2009, 34th International Symposium, {MFCS} 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5734}, pages = {175--186}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03816-7\_16}, doi = {10.1007/978-3-642-03816-7\_16}, timestamp = {Thu, 25 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/BravermanCMSW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/GalKM08, author = {Anna G{\'{a}}l and Michal Kouck{\'{y}} and Pierre McKenzie}, title = {Incremental Branching Programs}, journal = {Theory Comput. Syst.}, volume = {43}, number = {2}, pages = {159--184}, year = {2008}, url = {https://doi.org/10.1007/s00224-007-9049-y}, doi = {10.1007/S00224-007-9049-Y}, timestamp = {Thu, 02 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/GalKM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/MercierMW08, author = {Hugues Mercier and Pierre McKenzie and Stefan Wolf}, title = {Worst Case Nonzero-Error Interactive Communication}, journal = {{IEEE} Trans. Inf. Theory}, volume = {54}, number = {7}, pages = {2857--2867}, year = {2008}, url = {https://doi.org/10.1109/TIT.2008.924653}, doi = {10.1109/TIT.2008.924653}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/MercierMW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csl/McKenzieTV08, author = {Pierre McKenzie and Michael Thomas and Heribert Vollmer}, editor = {Michael Kaminski and Simone Martini}, title = {Extensional Uniformity for Boolean Circuits}, booktitle = {Computer Science Logic, 22nd International Workshop, {CSL} 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5213}, pages = {64--78}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-87531-4\_7}, doi = {10.1007/978-3-540-87531-4\_7}, timestamp = {Tue, 14 May 2019 10:00:42 +0200}, biburl = {https://dblp.org/rec/conf/csl/McKenzieTV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0805-4072, author = {Pierre McKenzie and Michael Thomas and Heribert Vollmer}, title = {Extensional Uniformity for Boolean Circuits}, journal = {CoRR}, volume = {abs/0805.4072}, year = {2008}, url = {http://arxiv.org/abs/0805.4072}, eprinttype = {arXiv}, eprint = {0805.4072}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0805-4072.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/McKenzieW07, author = {Pierre McKenzie and Klaus W. Wagner}, title = {The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers}, journal = {Comput. Complex.}, volume = {16}, number = {3}, pages = {211--244}, year = {2007}, url = {https://doi.org/10.1007/s00037-007-0229-6}, doi = {10.1007/S00037-007-0229-6}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/McKenzieW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/LongpreM07, author = {Luc Longpr{\'{e}} and Pierre McKenzie}, editor = {Ludek Kucera and Anton{\'{\i}}n Kucera}, title = {The Complexity of Solitaire}, booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic, August 26-31, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4708}, pages = {182--193}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74456-6\_18}, doi = {10.1007/978-3-540-74456-6\_18}, timestamp = {Fri, 30 Aug 2019 10:02:28 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/LongpreM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/McKenzieSTV06, author = {Pierre McKenzie and Thomas Schwentick and Denis Th{\'{e}}rien and Heribert Vollmer}, title = {The many faces of a translation}, journal = {J. Comput. Syst. Sci.}, volume = {72}, number = {1}, pages = {163--179}, year = {2006}, url = {https://doi.org/10.1016/j.jcss.2005.08.003}, doi = {10.1016/J.JCSS.2005.08.003}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/McKenzieSTV06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/JennerKMT06, author = {Birgit Jenner and Johannes K{\"{o}}bler and Pierre McKenzie and Jacobo Tor{\'{a}}n}, title = {Corrigendum to "Completeness results for graph isomorphism" {[J.} Comput. System Sci. 66(2003) 549-566]}, journal = {J. Comput. Syst. Sci.}, volume = {72}, number = {4}, pages = {783}, year = {2006}, url = {https://doi.org/10.1016/j.jcss.2005.11.002}, doi = {10.1016/J.JCSS.2005.11.002}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/JennerKMT06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/GalKM06, author = {Anna G{\'{a}}l and Michal Kouck{\'{y}} and Pierre McKenzie}, editor = {Dima Grigoriev and John Harrison and Edward A. Hirsch}, title = {Incremental Branching Programs}, booktitle = {Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, {CSR} 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3967}, pages = {178--190}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11753728\_20}, doi = {10.1007/11753728\_20}, timestamp = {Tue, 29 Nov 2022 13:36:56 +0100}, biburl = {https://dblp.org/rec/conf/csr/GalKM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/GalMK06, author = {Anna G{\'{a}}l and Pierre McKenzie and Michal Kouck{\'{y}}}, editor = {Matthias Krause and Pavel Pudl{\'{a}}k and R{\"{u}}diger Reischuk and Dieter van Melkebeek}, title = {Incremental branching programs}, booktitle = {Complexity of Boolean Functions, 12.03. - 17.03.2006}, series = {Dagstuhl Seminar Proceedings}, volume = {06111}, publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany}, year = {2006}, url = {http://drops.dagstuhl.de/opus/volltexte/2006/623}, timestamp = {Thu, 10 Jun 2021 13:02:07 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/GalMK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/MercierM005, author = {Hugues Mercier and Pierre McKenzie and Stefan Wolf}, title = {Worst-case randomized interactive communication}, booktitle = {Proceedings of the 2005 {IEEE} International Symposium on Information Theory, {ISIT} 2005, Adelaide, South Australia, Australia, 4-9 September 2005}, pages = {430--434}, publisher = {{IEEE}}, year = {2005}, url = {https://doi.org/10.1109/ISIT.2005.1523370}, doi = {10.1109/ISIT.2005.1523370}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isit/MercierM005.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR05-136, author = {Anna G{\'{a}}l and Michal Kouck{\'{y}} and Pierre McKenzie}, title = {Incremental branching programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR05-136}}, year = {2005}, url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-136/index.html}, eprinttype = {ECCC}, eprint = {TR05-136}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-136.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/FinkelMP04, author = {Alain Finkel and Pierre McKenzie and Claudine Picaronny}, title = {A well-structured framework for analysing petri net extensions}, journal = {Inf. Comput.}, volume = {195}, number = {1-2}, pages = {1--29}, year = {2004}, url = {https://doi.org/10.1016/j.ic.2004.01.005}, doi = {10.1016/J.IC.2004.01.005}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/FinkelMP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/McKenzieVW04, author = {Pierre McKenzie and Heribert Vollmer and Klaus W. Wagner}, title = {Arithmetic Circuits and Polynomial Replacement Systems}, journal = {{SIAM} J. Comput.}, volume = {33}, number = {6}, pages = {1513--1531}, year = {2004}, url = {https://doi.org/10.1137/S009753970139207X}, doi = {10.1137/S009753970139207X}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/McKenzieVW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/JennerKMT03, author = {Birgit Jenner and Johannes K{\"{o}}bler and Pierre McKenzie and Jacobo Tor{\'{a}}n}, title = {Completeness results for graph isomorphism}, journal = {J. Comput. Syst. Sci.}, volume = {66}, number = {3}, pages = {549--566}, year = {2003}, url = {https://doi.org/10.1016/S0022-0000(03)00042-4}, doi = {10.1016/S0022-0000(03)00042-4}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/JennerKMT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HolzerM03, author = {Markus Holzer and Pierre McKenzie}, title = {Alternating and empty alternating auxiliary stack automata}, journal = {Theor. Comput. Sci.}, volume = {299}, number = {1-3}, pages = {307--326}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00326-2}, doi = {10.1016/S0304-3975(02)00326-2}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/HolzerM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/McKenzieW03, author = {Pierre McKenzie and Klaus W. Wagner}, editor = {Helmut Alt and Michel Habib}, title = {The Complexity of Membership Problems for Circuits over Sets of Natural Numbers}, booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2607}, pages = {571--582}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/3-540-36494-3\_50}, doi = {10.1007/3-540-36494-3\_50}, timestamp = {Thu, 14 Oct 2021 10:38:16 +0200}, biburl = {https://dblp.org/rec/conf/stacs/McKenzieW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DammHM02, author = {Carsten Damm and Markus Holzer and Pierre McKenzie}, title = {The complexity of tensor calculus}, journal = {Comput. Complex.}, volume = {11}, number = {1-2}, pages = {54--89}, year = {2002}, url = {https://doi.org/10.1007/s00037-000-0170-4}, doi = {10.1007/S00037-000-0170-4}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/DammHM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/lib/Berard01, author = {B{\'{e}}atrice B{\'{e}}rard and Michel Bidoit and Alain Finkel and Fran{\c{c}}ois Laroussinie and Antoine Petit and Laure Petrucci and Philippe Schnoebelen and Pierre McKenzie}, title = {Systems and Software Verification, Model-Checking Techniques and Tools}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/978-3-662-04558-9}, doi = {10.1007/978-3-662-04558-9}, isbn = {978-3-642-07478-3}, timestamp = {Fri, 17 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/lib/Berard01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/LautemannMSV01, author = {Clemens Lautemann and Pierre McKenzie and Thomas Schwentick and Heribert Vollmer}, title = {The Descriptive Complexity Approach to {LOGCFL}}, journal = {J. Comput. Syst. Sci.}, volume = {62}, number = {4}, pages = {629--652}, year = {2001}, url = {https://doi.org/10.1006/jcss.2000.1742}, doi = {10.1006/JCSS.2000.1742}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/LautemannMSV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/BarringtonKLM01, author = {David A. Mix Barrington and Peter Kadau and Klaus{-}J{\"{o}}rn Lange and Pierre McKenzie}, title = {On the Complexity of Some Problems on Groups Input as Multiplication Tables}, journal = {J. Comput. Syst. Sci.}, volume = {63}, number = {2}, pages = {186--200}, year = {2001}, url = {https://doi.org/10.1006/jcss.2001.1764}, doi = {10.1006/JCSS.2001.1764}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/BarringtonKLM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/LangeMT00, author = {Klaus{-}J{\"{o}}rn Lange and Pierre McKenzie and Alain Tapp}, title = {Reversible Space Equals Deterministic Space}, journal = {J. Comput. Syst. Sci.}, volume = {60}, number = {2}, pages = {354--367}, year = {2000}, url = {https://doi.org/10.1006/jcss.1999.1672}, doi = {10.1006/JCSS.1999.1672}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/LangeMT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/BarringtonKLM00, author = {David A. Mix Barrington and Peter Kadau and Klaus{-}J{\"{o}}rn Lange and Pierre McKenzie}, title = {On the Complexity of Some Problems on Groups Input as Multiplication Tables}, booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational Complexity, Florence, Italy, July 4-7, 2000}, pages = {62--69}, publisher = {{IEEE} Computer Society}, year = {2000}, url = {https://doi.org/10.1109/CCC.2000.856736}, doi = {10.1109/CCC.2000.856736}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/BarringtonKLM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/DammHM00, author = {Carsten Damm and Markus Holzer and Pierre McKenzie}, title = {The Complexity of Tensor Calculus}, booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational Complexity, Florence, Italy, July 4-7, 2000}, pages = {70--86}, publisher = {{IEEE} Computer Society}, year = {2000}, url = {https://doi.org/10.1109/CCC.2000.856737}, doi = {10.1109/CCC.2000.856737}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/DammHM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/McKenzieVW00, author = {Pierre McKenzie and Heribert Vollmer and Klaus W. Wagner}, editor = {Sanjiv Kapoor and Sanjiva Prasad}, title = {Arithmetic Circuits and Polynomial Replacement Systems}, booktitle = {Foundations of Software Technology and Theoretical Computer Science, 20th Conference, {FST} {TCS} 2000 New Delhi, India, December 13-15, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1974}, pages = {164--175}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-44450-5\_13}, doi = {10.1007/3-540-44450-5\_13}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/McKenzieVW00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/McKenzieSTV00, author = {Pierre McKenzie and Thomas Schwentick and Denis Th{\'{e}}rien and Heribert Vollmer}, editor = {Ugo Montanari and Jos{\'{e}} D. P. Rolim and Emo Welzl}, title = {The Many Faces of a Translation}, booktitle = {Automata, Languages and Programming, 27th International Colloquium, {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1853}, pages = {890--901}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-45022-X\_75}, doi = {10.1007/3-540-45022-X\_75}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/McKenzieSTV00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BarringtonMMTT00, author = {David A. Mix Barrington and Pierre McKenzie and Cristopher Moore and Pascal Tesson and Denis Th{\'{e}}rien}, editor = {Mogens Nielsen and Branislav Rovan}, title = {Equation Satisfiability and Program Satisfiability for Finite Monoids}, booktitle = {Mathematical Foundations of Computer Science 2000, 25th International Symposium, {MFCS} 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1893}, pages = {172--181}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-44612-5\_13}, doi = {10.1007/3-540-44612-5\_13}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/BarringtonMMTT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/HolzerM00, author = {Markus Holzer and Pierre McKenzie}, editor = {Mogens Nielsen and Branislav Rovan}, title = {Alternating and Empty Alternating Auxiliary Stack Automata}, booktitle = {Mathematical Foundations of Computer Science 2000, 25th International Symposium, {MFCS} 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1893}, pages = {415--425}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-44612-5\_37}, doi = {10.1007/3-540-44612-5\_37}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/HolzerM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR00-036, author = {Carsten Damm and Markus Holzer and Pierre McKenzie}, title = {The Complexity of Tensor Calculus}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR00-036}}, year = {2000}, url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-036/index.html}, eprinttype = {ECCC}, eprint = {TR00-036}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-036.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/RazM99, author = {Ran Raz and Pierre McKenzie}, title = {Separation of the Monotone {NC} Hierarchy}, journal = {Comb.}, volume = {19}, number = {3}, pages = {403--435}, year = {1999}, url = {https://doi.org/10.1007/s004930050062}, doi = {10.1007/S004930050062}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/RazM99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/McKenzieRV99, author = {Pierre McKenzie and Klaus Reinhardt and V. Vinay}, editor = {Takao Asano and Hiroshi Imai and D. T. Lee and Shin{-}Ichi Nakano and Takeshi Tokuyama}, title = {Circuits and Context-Free Languages}, booktitle = {Computing and Combinatorics, 5th Annual International Conference, {COCOON} '99, Tokyo, Japan, July 26-28, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1627}, pages = {194--203}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48686-0\_19}, doi = {10.1007/3-540-48686-0\_19}, timestamp = {Sat, 30 Sep 2023 09:37:25 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/McKenzieRV99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lics/BaziramwaboMT99, author = {Augustin Baziramwabo and Pierre McKenzie and Denis Th{\'{e}}rien}, title = {Modular Temporal Logic}, booktitle = {14th Annual {IEEE} Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999}, pages = {344--351}, publisher = {{IEEE} Computer Society}, year = {1999}, url = {https://doi.org/10.1109/LICS.1999.782629}, doi = {10.1109/LICS.1999.782629}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/lics/BaziramwaboMT99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/LautemannMSV99, author = {Clemens Lautemann and Pierre McKenzie and Thomas Schwentick and Heribert Vollmer}, editor = {Christoph Meinel and Sophie Tison}, title = {The Descriptive Complexity Approach to {LOGCFL}}, booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1563}, pages = {444--454}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-49116-3\_42}, doi = {10.1007/3-540-49116-3\_42}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/LautemannMSV99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/CaussinusMTV98, author = {Herv{\'{e}} Caussinus and Pierre McKenzie and Denis Th{\'{e}}rien and Heribert Vollmer}, title = {Nondeterministic \emph{NC}\({}^{\mbox{1}}\) Computation}, journal = {J. Comput. Syst. Sci.}, volume = {57}, number = {2}, pages = {200--212}, year = {1998}, url = {https://doi.org/10.1006/jcss.1998.1588}, doi = {10.1006/JCSS.1998.1588}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/CaussinusMTV98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/JennerMT98, author = {Birgit Jenner and Pierre McKenzie and Jacobo Tor{\'{a}}n}, title = {A Note on the Hardness of Tree Isomorphism}, booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational Complexity, Buffalo, New York, USA, June 15-18, 1998}, pages = {101--105}, publisher = {{IEEE} Computer Society}, year = {1998}, url = {https://doi.org/10.1109/CCC.1998.694595}, doi = {10.1109/CCC.1998.694595}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/JennerMT98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LangeM98, author = {Klaus{-}J{\"{o}}rn Lange and Pierre McKenzie}, editor = {Kyung{-}Yong Chwa and Oscar H. Ibarra}, title = {On the Complexity of Free Monoid Morphisms}, booktitle = {Algorithms and Computation, 9th International Symposium, {ISAAC} '98, Taejon, Korea, December 14-16, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1533}, pages = {247--256}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/3-540-49381-6\_27}, doi = {10.1007/3-540-49381-6\_27}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LangeM98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/cs-CC-9809114, author = {Clemens Lautemann and Pierre McKenzie and Thomas Schwentick and Heribert Vollmer}, title = {The descriptive complexity approach to {LOGCFL}}, journal = {CoRR}, volume = {cs.CC/9809114}, year = {1998}, url = {https://arxiv.org/abs/cs/9809114}, timestamp = {Fri, 10 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/cs-CC-9809114.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR98-059, author = {Clemens Lautemann and Pierre McKenzie and Thomas Schwentick and Heribert Vollmer}, title = {The Descriptive Complexity Approach to {LOGCFL}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR98-059}}, year = {1998}, url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-059/index.html}, eprinttype = {ECCC}, eprint = {TR98-059}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-059.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BeaudryMPT97, author = {Martin Beaudry and Pierre McKenzie and Pierre P{\'{e}}ladeau and Denis Th{\'{e}}rien}, title = {Finite Moniods: From Word to Circuit Evaluation}, journal = {{SIAM} J. Comput.}, volume = {26}, number = {1}, pages = {138--152}, year = {1997}, url = {https://doi.org/10.1137/S0097539793249530}, doi = {10.1137/S0097539793249530}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BeaudryMPT97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FinkelM97, author = {Alain Finkel and Pierre McKenzie}, title = {Verifying Identical Communicating Processes is Undecidable}, journal = {Theor. Comput. Sci.}, volume = {174}, number = {1-2}, pages = {217--230}, year = {1997}, url = {https://doi.org/10.1016/S0304-3975(96)00026-6}, doi = {10.1016/S0304-3975(96)00026-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FinkelM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/LangeMT97, author = {Klaus{-}J{\"{o}}rn Lange and Pierre McKenzie and Alain Tapp}, title = {Reversible Space Equals Deterministic Space}, booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997}, pages = {45--50}, publisher = {{IEEE} Computer Society}, year = {1997}, url = {https://doi.org/10.1109/CCC.1997.612299}, doi = {10.1109/CCC.1997.612299}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/LangeMT97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/RazM97, author = {Ran Raz and Pierre McKenzie}, title = {Separation of the Monotone {NC} Hierarchy}, booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97, Miami Beach, Florida, USA, October 19-22, 1997}, pages = {234--243}, publisher = {{IEEE} Computer Society}, year = {1997}, url = {https://doi.org/10.1109/SFCS.1997.646112}, doi = {10.1109/SFCS.1997.646112}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/RazM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/JennerMT96, author = {Birgit Jenner and Pierre McKenzie and Denis Th{\'{e}}rien}, title = {Logspace and Logtime Leaf Languages}, journal = {Inf. Comput.}, volume = {129}, number = {1}, pages = {21--33}, year = {1996}, url = {https://doi.org/10.1006/inco.1996.0071}, doi = {10.1006/INCO.1996.0071}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/JennerMT96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/CaussinusMTV96, author = {Herv{\'{e}} Caussinus and Pierre McKenzie and Denis Th{\'{e}}rien and Heribert Vollmer}, editor = {Steven Homer and Jin{-}Yi Cai}, title = {Nondeterministic NC\({}^{\mbox{1}}\) Computation}, booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996}, pages = {12--21}, publisher = {{IEEE} Computer Society}, year = {1996}, url = {https://doi.org/10.1109/CCC.1996.507664}, doi = {10.1109/CCC.1996.507664}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/CaussinusMTV96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/BeaudryM95, author = {Martin Beaudry and Pierre McKenzie}, title = {Circuits, Matrices, and Nonassociative Computation}, journal = {J. Comput. Syst. Sci.}, volume = {50}, number = {3}, pages = {441--455}, year = {1995}, url = {https://doi.org/10.1006/jcss.1995.1035}, doi = {10.1006/JCSS.1995.1035}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/BeaudryM95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/McKenzieT94, author = {Pierre McKenzie and Denis Th{\'{e}}rien}, title = {Special Issue on Circuit Complexity: Foreword}, journal = {Comput. Complex.}, volume = {4}, pages = {297--300}, year = {1994}, url = {https://doi.org/10.1007/BF01263418}, doi = {10.1007/BF01263418}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/McKenzieT94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/JennerMT94, author = {Birgit Jenner and Pierre McKenzie and Denis Th{\'{e}}rien}, title = {Logspace and Logtime Leaf Languages}, booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994}, pages = {242--254}, publisher = {{IEEE} Computer Society}, year = {1994}, url = {https://doi.org/10.1109/SCT.1994.315799}, doi = {10.1109/SCT.1994.315799}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/JennerMT94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BedardLM93, author = {Fran{\c{c}}ois B{\'{e}}dard and Fran{\c{c}}ois Lemieux and Pierre McKenzie}, title = {Extensions to Barrington's M-Program Model}, journal = {Theor. Comput. Sci.}, volume = {107}, number = {1}, pages = {31--61}, year = {1993}, url = {https://doi.org/10.1016/0304-3975(93)90253-P}, doi = {10.1016/0304-3975(93)90253-P}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BedardLM93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/BeaudryMT92, author = {Martin Beaudry and Pierre McKenzie and Denis Th{\'{e}}rien}, title = {The Membership Problem in Aperiodic Transformation Monoids}, journal = {J. {ACM}}, volume = {39}, number = {3}, pages = {599--616}, year = {1992}, url = {https://doi.org/10.1145/146637.146661}, doi = {10.1145/146637.146661}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/BeaudryMT92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/BeaudryM92, author = {Martin Beaudry and Pierre McKenzie}, title = {Cicuits, Matrices, and Nonassociative Computation}, booktitle = {Proceedings of the Seventh Annual Structure in Complexity Theory Conference, Boston, Massachusetts, USA, June 22-25, 1992}, pages = {94--106}, publisher = {{IEEE} Computer Society}, year = {1992}, url = {https://doi.org/10.1109/SCT.1992.215384}, doi = {10.1109/SCT.1992.215384}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/BeaudryM92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/McKenziePT91, author = {Pierre McKenzie and Pierre P{\'{e}}ladeau and Denis Th{\'{e}}rien}, title = {NC{\({^1}\)}: The Automata-Theoretic Viewpoint}, journal = {Comput. Complex.}, volume = {1}, pages = {330--359}, year = {1991}, url = {https://doi.org/10.1007/BF01212963}, doi = {10.1007/BF01212963}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/McKenziePT91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BarringtonM91, author = {David A. Mix Barrington and Pierre McKenzie}, title = {Oracle branching programs and Logspace versus {P}}, journal = {Inf. Comput.}, volume = {95}, number = {1}, pages = {96--115}, year = {1991}, url = {https://doi.org/10.1016/0890-5401(91)90017-V}, doi = {10.1016/0890-5401(91)90017-V}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BarringtonM91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/BedardLM90, author = {Fran{\c{c}}ois B{\'{e}}dard and Fran{\c{c}}ois Lemieux and Pierre McKenzie}, title = {Extensions to Barrington's M-Program Model}, booktitle = {Proceedings: Fifth Annual Structure in Complexity Theory Conference, Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July 8-11, 1990}, pages = {200--209}, publisher = {{IEEE} Computer Society}, year = {1990}, url = {https://doi.org/10.1109/SCT.1990.113968}, doi = {10.1109/SCT.1990.113968}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/BedardLM90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/McKenzieT89, author = {Pierre McKenzie and Denis Th{\'{e}}rien}, editor = {Giorgio Ausiello and Mariangiola Dezani{-}Ciancaglini and Simona Ronchi Della Rocca}, title = {Automata Theory Meets Circuit Complexity}, booktitle = {Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {372}, pages = {589--602}, publisher = {Springer}, year = {1989}, url = {https://doi.org/10.1007/BFb0035785}, doi = {10.1007/BFB0035785}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/McKenzieT89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BarringtonM89, author = {David A. Mix Barrington and Pierre McKenzie}, editor = {Antoni Kreczmar and Grazyna Mirkowska}, title = {Oracle Branching Programs and Logspace versus {P}}, booktitle = {Mathematical Foundations of Computer Science 1989, MFCS'89, Porabka-Kozubnik, Poland, August 28 - September 1, 1989, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {379}, pages = {370--379}, publisher = {Springer}, year = {1989}, url = {https://doi.org/10.1007/3-540-51486-4\_84}, doi = {10.1007/3-540-51486-4\_84}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/BarringtonM89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BeaudryMT89, author = {Martin Beaudry and Pierre McKenzie and Denis Th{\'{e}}rien}, editor = {Burkhard Monien and Robert Cori}, title = {Testing Membership: Beyond Permutation Groups (Extended Abstract)}, booktitle = {{STACS} 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {349}, pages = {388--399}, publisher = {Springer}, year = {1989}, url = {https://doi.org/10.1007/BFb0029001}, doi = {10.1007/BFB0029001}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BeaudryMT89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/LuksM88, author = {Eugene M. Luks and Pierre McKenzie}, title = {Parallel Algorithms for Solvable Permutation Groups}, journal = {J. Comput. Syst. Sci.}, volume = {37}, number = {1}, pages = {39--62}, year = {1988}, url = {https://doi.org/10.1016/0022-0000(88)90044-X}, doi = {10.1016/0022-0000(88)90044-X}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/LuksM88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/CookM87, author = {Stephen A. Cook and Pierre McKenzie}, title = {Problems Complete for Deterministic Logarithmic Space}, journal = {J. Algorithms}, volume = {8}, number = {3}, pages = {385--394}, year = {1987}, url = {https://doi.org/10.1016/0196-6774(87)90018-6}, doi = {10.1016/0196-6774(87)90018-6}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/CookM87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/McKenzieC87, author = {Pierre McKenzie and Stephen A. Cook}, title = {The Parallel Complexity of Abelian Permutation Group Problems}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {5}, pages = {880--909}, year = {1987}, url = {https://doi.org/10.1137/0216058}, doi = {10.1137/0216058}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/McKenzieC87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/LuksM85, author = {Eugene M. Luks and Pierre McKenzie}, title = {Fast Parallel Computation with Permutation Groups}, booktitle = {26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, USA, 21-23 October 1985}, pages = {505--514}, publisher = {{IEEE} Computer Society}, year = {1985}, url = {https://doi.org/10.1109/SFCS.1985.26}, doi = {10.1109/SFCS.1985.26}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/LuksM85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/ca/McKenzie84, author = {Pierre McKenzie}, title = {Parallel complexity and permutation groups}, school = {University of Toronto, Canada}, year = {1984}, url = {https://librarysearch.library.utoronto.ca/permalink/01UTORONTO\_INST/14bjeso/alma991105960584906196}, timestamp = {Wed, 10 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/ca/McKenzie84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/McKenzie84, author = {Pierre McKenzie}, title = {Permutations of Bounded Degree Generate Groups of Polynomial Diameter}, journal = {Inf. Process. Lett.}, volume = {19}, number = {5}, pages = {253--254}, year = {1984}, url = {https://doi.org/10.1016/0020-0190(84)90062-0}, doi = {10.1016/0020-0190(84)90062-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/McKenzie84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/McKenzieC83, author = {Pierre McKenzie and Stephen A. Cook}, title = {The Parallel Complexity of the Abelian Permutation Group Membership Problem}, booktitle = {24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona, USA, 7-9 November 1983}, pages = {154--161}, publisher = {{IEEE} Computer Society}, year = {1983}, url = {https://doi.org/10.1109/SFCS.1983.74}, doi = {10.1109/SFCS.1983.74}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/McKenzieC83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.