BibTeX records: Pierre McKenzie

download as .bib file

@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       = {http://doi.acm.org/10.1145/3055399},
  doi       = {10.1145/3055399},
  isbn      = {978-1-4503-4528-6},
  timestamp = {Sat, 17 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2017},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {72},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/072},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/AllenderKM17},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {109},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/109},
  timestamp = {Mon, 03 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ImpagliazzoKKMR17},
  bibsource = {dblp computer science bibliography, http://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   = {Computational Complexity},
  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, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/BlondinKM16},
  bibsource = {dblp computer science bibliography, http://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   = {{TOCT}},
  volume    = {9},
  number    = {1},
  pages     = {5:1--5:34},
  year      = {2016},
  url       = {http://doi.acm.org/10.1145/3013516},
  doi       = {10.1145/3013516},
  timestamp = {Fri, 06 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/toct/BeameGMS16},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1607.07011},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/EliasM16},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1608.01932},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/BeameGMS16},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1608.02636},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/BlondinFM16},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2015},
  crossref  = {DBLP:conf/lics/2015},
  url       = {https://doi.org/10.1109/LICS.2015.14},
  doi       = {10.1109/LICS.2015.14},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/lics/BlondinFGHM15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BlondinFM14,
  author    = {Michael Blondin and
               Alain Finkel and
               Pierre McKenzie},
  title     = {Handling Infinitely Branching {WSTS}},
  booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
               {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
               {II}},
  pages     = {13--25},
  year      = {2014},
  crossref  = {DBLP:conf/icalp/2014-2},
  url       = {https://doi.org/10.1007/978-3-662-43951-7_2},
  doi       = {10.1007/978-3-662-43951-7_2},
  timestamp = {Tue, 23 May 2017 01:08:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/BlondinFM14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ncma/CadilhacKM14,
  author    = {Micha{\"{e}}l Cadilhac and
               Andreas Krebs and
               Pierre McKenzie},
  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},
  pages     = {73--83},
  year      = {2014},
  crossref  = {DBLP:conf/ncma/2014},
  timestamp = {Thu, 23 Jun 2016 15:53:29 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ncma/CadilhacKM14},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1412.4259},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/BlondinFGHM14},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/dagstuhl-reports/EsparzaFMO14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cjtcs/BorchertMR13,
  author    = {Bernd Borchert and
               Pierre McKenzie and
               Klaus Reinhardt},
  title     = {Few Product Gates but Many Zeroes},
  journal   = {Chicago J. Theor. Comput. Sci.},
  volume    = {2013},
  year      = {2013},
  url       = {http://cjtcs.cs.uchicago.edu/articles/2013/2/contents.html},
  timestamp = {Mon, 24 Feb 2014 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/cjtcs/BorchertMR13},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ijfcs/CadilhacFM13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/cai/CadilhacKM13,
  author    = {Micha{\"{e}}l Cadilhac and
               Andreas Krebs and
               Pierre McKenzie},
  title     = {The Algebraic Theory of Parikh Automata},
  booktitle = {Algebraic Informatics - 5th International Conference, {CAI} 2013,
               Porquerolles, France, September 3-6, 2013. Proceedings},
  pages     = {60--73},
  year      = {2013},
  crossref  = {DBLP:conf/cai/2013},
  url       = {https://doi.org/10.1007/978-3-642-40663-8_7},
  doi       = {10.1007/978-3-642-40663-8_7},
  timestamp = {Thu, 15 Jun 2017 21:34:06 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cai/CadilhacKM13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/McKenzie13,
  author    = {Pierre McKenzie},
  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},
  pages     = {17},
  year      = {2013},
  crossref  = {DBLP:conf/dcfs/2013},
  url       = {https://doi.org/10.1007/978-3-642-39310-5_3},
  doi       = {10.1007/978-3-642-39310-5_3},
  timestamp = {Thu, 15 Jun 2017 21:36:16 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dcfs/McKenzie13},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {40},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/040},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/CadilhacKM13},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ijfcs/CadilhacFM12},
  bibsource = {dblp computer science bibliography, http://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. Inf. and Applic.},
  volume    = {46},
  number    = {4},
  pages     = {511--545},
  year      = {2012},
  url       = {https://doi.org/10.1051/ita/2012013},
  doi       = {10.1051/ita/2012013},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ita/CadilhacFM12},
  bibsource = {dblp computer science bibliography, http://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   = {{TOCT}},
  volume    = {3},
  number    = {2},
  pages     = {4:1--4:43},
  year      = {2012},
  url       = {http://doi.acm.org/10.1145/2077336.2077337},
  doi       = {10.1145/2077336.2077337},
  timestamp = {Mon, 09 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/toct/CookMWBS12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/csr/BlondinM12,
  author    = {Michael Blondin and
               Pierre McKenzie},
  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},
  pages     = {31--42},
  year      = {2012},
  crossref  = {DBLP:conf/csr/2012},
  url       = {https://doi.org/10.1007/978-3-642-30642-6_4},
  doi       = {10.1007/978-3-642-30642-6_4},
  timestamp = {Wed, 17 May 2017 14:24:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/csr/BlondinM12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dlt/CadilhacFM12,
  author    = {Micha{\"{e}}l Cadilhac and
               Alain Finkel and
               Pierre McKenzie},
  title     = {Unambiguous Constrained Automata},
  booktitle = {Developments in Language Theory - 16th International Conference, {DLT}
               2012, Taipei, Taiwan, August 14-17, 2012. Proceedings},
  pages     = {239--250},
  year      = {2012},
  crossref  = {DBLP:conf/dlt/2012},
  url       = {https://doi.org/10.1007/978-3-642-31653-1_22},
  doi       = {10.1007/978-3-642-31653-1_22},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dlt/CadilhacFM12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BehleKLM12,
  author    = {Christoph Behle and
               Andreas Krebs and
               Klaus{-}J{\"{o}}rn Lange and
               Pierre McKenzie},
  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},
  pages     = {590--602},
  year      = {2012},
  crossref  = {DBLP:conf/mfcs/2012},
  url       = {https://doi.org/10.1007/978-3-642-32589-2_52},
  doi       = {10.1007/978-3-642-32589-2_52},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/BehleKLM12},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {90},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/090},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/BlondinKM12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ncma/CadilhacFM11,
  author    = {Micha{\"{e}}l Cadilhac and
               Alain Finkel and
               Pierre McKenzie},
  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},
  pages     = {103--119},
  year      = {2011},
  crossref  = {DBLP:conf/ncma/2011},
  timestamp = {Thu, 17 Mar 2016 10:50:07 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/ncma/CadilhacFM11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:journals/corr/abs-1108-3625,
  author    = {Micha{\"{e}}l Cadilhac and
               Alain Finkel and
               Pierre McKenzie},
  title     = {Bounded Parikh Automata},
  booktitle = {Proceedings 8th International Conference Words 2011, Prague, Czech
               Republic, 12-16th September 2011.},
  pages     = {93--102},
  year      = {2011},
  crossref  = {DBLP:journals/corr/abs-1108-3412},
  url       = {https://doi.org/10.4204/EPTCS.63.13},
  doi       = {10.4204/EPTCS.63.13},
  timestamp = {Wed, 03 May 2017 14:47:54 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1108-3625},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1101.1547},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1101-1547},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {18},
  pages     = {95},
  year      = {2011},
  url       = {http://eccc.hpi-web.de/report/2011/095},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/BehleKLM11},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/McKenzieTV10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/fun/HolzerM10,
  author    = {Markus Holzer and
               Pierre McKenzie},
  title     = {The Computational Complexity of RaceTrack},
  booktitle = {Fun with Algorithms, 5th International Conference, {FUN} 2010, Ischia,
               Italy, June 2-4, 2010. Proceedings},
  pages     = {260--271},
  year      = {2010},
  crossref  = {DBLP:conf/fun/2010},
  url       = {https://doi.org/10.1007/978-3-642-13122-6_26},
  doi       = {10.1007/978-3-642-13122-6_26},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fun/HolzerM10},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {1005.2642},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1005-2642},
  bibsource = {dblp computer science bibliography, http://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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/LongpreM09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BravermanCMSW09,
  author    = {Mark Braverman and
               Stephen A. Cook and
               Pierre McKenzie and
               Rahul Santhanam and
               Dustin Wehr},
  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},
  pages     = {109--120},
  year      = {2009},
  crossref  = {DBLP:conf/fsttcs/2009},
  url       = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2311},
  doi       = {10.4230/LIPIcs.FSTTCS.2009.2311},
  timestamp = {Wed, 24 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/BravermanCMSW09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BorchertMR09,
  author    = {Bernd Borchert and
               Pierre McKenzie and
               Klaus Reinhardt},
  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},
  pages     = {162--174},
  year      = {2009},
  crossref  = {DBLP:conf/mfcs/2009},
  url       = {https://doi.org/10.1007/978-3-642-03816-7_15},
  doi       = {10.1007/978-3-642-03816-7_15},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/BorchertMR09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BravermanCMSW09,
  author    = {Mark Braverman and
               Stephen A. Cook and
               Pierre McKenzie and
               Rahul Santhanam and
               Dustin Wehr},
  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},
  pages     = {175--186},
  year      = {2009},
  crossref  = {DBLP:conf/mfcs/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    = {http://dblp.org/rec/bib/conf/mfcs/BravermanCMSW09},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mst/GalKM08},
  bibsource = {dblp computer science bibliography, http://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. Information 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, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tit/MercierMW08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/csl/McKenzieTV08,
  author    = {Pierre McKenzie and
               Michael Thomas and
               Heribert Vollmer},
  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},
  pages     = {64--78},
  year      = {2008},
  crossref  = {DBLP:conf/csl/2008},
  url       = {https://doi.org/10.1007/978-3-540-87531-4_7},
  doi       = {10.1007/978-3-540-87531-4_7},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/csl/McKenzieTV08},
  bibsource = {dblp computer science bibliography, http://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},
  archivePrefix = {arXiv},
  eprint    = {0805.4072},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-0805-4072},
  bibsource = {dblp computer science bibliography, http://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   = {Computational Complexity},
  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, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/McKenzieW07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LongpreM07,
  author    = {Luc Longpr{\'{e}} and
               Pierre McKenzie},
  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},
  pages     = {182--193},
  year      = {2007},
  crossref  = {DBLP:conf/mfcs/2007},
  url       = {https://doi.org/10.1007/978-3-540-74456-6_18},
  doi       = {10.1007/978-3-540-74456-6_18},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/LongpreM07},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/McKenzieSTV06},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/JennerKMT06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/csr/GalKM06,
  author    = {Anna G{\'{a}}l and
               Michal Kouck{\'{y}} and
               Pierre McKenzie},
  title     = {Incremental Branching Programs},
  booktitle = {Computer Science - Theory and Applications, First International Computer
               Science Symposium in Russia, {CSR} 2006, St. Petersburg, Russia, June
               8-12, 2006, Proceedings},
  pages     = {178--190},
  year      = {2006},
  crossref  = {DBLP:conf/csr/2006},
  url       = {https://doi.org/10.1007/11753728_20},
  doi       = {10.1007/11753728_20},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/csr/GalKM06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/GalMK06,
  author    = {Anna G{\'{a}}l and
               Pierre McKenzie and
               Michal Kouck{\'{y}}},
  title     = {Incremental branching programs},
  booktitle = {Complexity of Boolean Functions, 12.03. - 17.03.2006},
  year      = {2006},
  crossref  = {DBLP:conf/dagstuhl/2006P6111},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2006/623},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/GalMK06},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {136},
  year      = {2005},
  url       = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-136/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR05-136},
  bibsource = {dblp computer science bibliography, http://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 = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iandc/FinkelMP04},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/McKenzieVW04},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/JennerKMT03},
  bibsource = {dblp computer science bibliography, http://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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/HolzerM03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/McKenzieW03,
  author    = {Pierre McKenzie and
               Klaus W. Wagner},
  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},
  pages     = {571--582},
  year      = {2003},
  crossref  = {DBLP:conf/stacs/2003},
  url       = {https://doi.org/10.1007/3-540-36494-3_50},
  doi       = {10.1007/3-540-36494-3_50},
  timestamp = {Mon, 29 May 2017 16:53:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/McKenzieW03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/DammHM02,
  author    = {Carsten Damm and
               Markus Holzer and
               Pierre McKenzie},
  title     = {The complexity of tensor calculus},
  journal   = {Computational Complexity},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/DammHM02},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/LautemannMSV01},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/BarringtonKLM01},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/LangeMT00},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2000},
  crossref  = {DBLP:conf/coco/2000},
  url       = {https://doi.org/10.1109/CCC.2000.856736},
  doi       = {10.1109/CCC.2000.856736},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BarringtonKLM00},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2000},
  crossref  = {DBLP:conf/coco/2000},
  url       = {https://doi.org/10.1109/CCC.2000.856737},
  doi       = {10.1109/CCC.2000.856737},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/DammHM00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/McKenzieVW00,
  author    = {Pierre McKenzie and
               Heribert Vollmer and
               Klaus W. Wagner},
  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.},
  pages     = {164--175},
  year      = {2000},
  crossref  = {DBLP:conf/fsttcs/2000},
  url       = {https://doi.org/10.1007/3-540-44450-5_13},
  doi       = {10.1007/3-540-44450-5_13},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/McKenzieVW00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/McKenzieSTV00,
  author    = {Pierre McKenzie and
               Thomas Schwentick and
               Denis Th{\'{e}}rien and
               Heribert Vollmer},
  title     = {The Many Faces of a Translation},
  booktitle = {Automata, Languages and Programming, 27th International Colloquium,
               {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  pages     = {890--901},
  year      = {2000},
  crossref  = {DBLP:conf/icalp/2000},
  url       = {https://doi.org/10.1007/3-540-45022-X_75},
  doi       = {10.1007/3-540-45022-X_75},
  timestamp = {Wed, 24 May 2017 15:40:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/McKenzieSTV00},
  bibsource = {dblp computer science bibliography, http://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},
  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},
  pages     = {172--181},
  year      = {2000},
  crossref  = {DBLP:conf/mfcs/2000},
  url       = {https://doi.org/10.1007/3-540-44612-5_13},
  doi       = {10.1007/3-540-44612-5_13},
  timestamp = {Wed, 24 May 2017 15:40:45 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/BarringtonMMTT00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HolzerM00,
  author    = {Markus Holzer and
               Pierre McKenzie},
  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},
  pages     = {415--425},
  year      = {2000},
  crossref  = {DBLP:conf/mfcs/2000},
  url       = {https://doi.org/10.1007/3-540-44612-5_37},
  doi       = {10.1007/3-540-44612-5_37},
  timestamp = {Wed, 24 May 2017 15:40:45 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/HolzerM00},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {7},
  number    = {36},
  year      = {2000},
  url       = {http://eccc.hpi-web.de/eccc-reports/2000/TR00-036/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR00-036},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/combinatorica/RazM99,
  author    = {Ran Raz and
               Pierre McKenzie},
  title     = {Separation of the Monotone {NC} Hierarchy},
  journal   = {Combinatorica},
  volume    = {19},
  number    = {3},
  pages     = {403--435},
  year      = {1999},
  url       = {https://doi.org/10.1007/s004930050062},
  doi       = {10.1007/s004930050062},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/combinatorica/RazM99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/McKenzieRV99,
  author    = {Pierre McKenzie and
               Klaus Reinhardt and
               V. Vinay},
  title     = {Circuits and Context-Free Languages},
  booktitle = {Computing and Combinatorics, 5th Annual International Conference,
               {COCOON} '99, Tokyo, Japan, July 26-28, 1999, Proceedings},
  pages     = {194--203},
  year      = {1999},
  crossref  = {DBLP:conf/cocoon/99},
  url       = {https://doi.org/10.1007/3-540-48686-0_19},
  doi       = {10.1007/3-540-48686-0_19},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/McKenzieRV99},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1999},
  crossref  = {DBLP:conf/lics/1999},
  url       = {https://doi.org/10.1109/LICS.1999.782629},
  doi       = {10.1109/LICS.1999.782629},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/lics/BaziramwaboMT99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LautemannMSV99,
  author    = {Clemens Lautemann and
               Pierre McKenzie and
               Thomas Schwentick and
               Heribert Vollmer},
  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},
  pages     = {444--454},
  year      = {1999},
  crossref  = {DBLP:conf/stacs/1999},
  url       = {https://doi.org/10.1007/3-540-49116-3_42},
  doi       = {10.1007/3-540-49116-3_42},
  timestamp = {Thu, 15 Jun 2017 21:34:34 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/LautemannMSV99},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/CaussinusMTV98},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1998},
  crossref  = {DBLP:conf/coco/1998},
  url       = {https://doi.org/10.1109/CCC.1998.694595},
  doi       = {10.1109/CCC.1998.694595},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/JennerMT98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LangeM98,
  author    = {Klaus{-}J{\"{o}}rn Lange and
               Pierre McKenzie},
  title     = {On the Complexity of Free Monoid Morphisms},
  booktitle = {Algorithms and Computation, 9th International Symposium, {ISAAC} '98,
               Taejon, Korea, December 14-16, 1998, Proceedings},
  pages     = {247--256},
  year      = {1998},
  crossref  = {DBLP:conf/isaac/1998},
  url       = {https://doi.org/10.1007/3-540-49381-6_27},
  doi       = {10.1007/3-540-49381-6_27},
  timestamp = {Tue, 23 May 2017 14:54:58 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/LangeM98},
  bibsource = {dblp computer science bibliography, http://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       = {http://arxiv.org/abs/cs.CC/9809114},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/cs-CC-9809114},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {5},
  number    = {59},
  year      = {1998},
  url       = {http://eccc.hpi-web.de/eccc-reports/1998/TR98-059/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR98-059},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/siamcomp/BeaudryMPT97},
  bibsource = {dblp computer science bibliography, http://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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/FinkelM97},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1997},
  crossref  = {DBLP:conf/coco/1997},
  url       = {https://doi.org/10.1109/CCC.1997.612299},
  doi       = {10.1109/CCC.1997.612299},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/LangeMT97},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1997},
  crossref  = {DBLP:conf/focs/1997},
  url       = {https://doi.org/10.1109/SFCS.1997.646112},
  doi       = {10.1109/SFCS.1997.646112},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/RazM97},
  bibsource = {dblp computer science bibliography, http://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 = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iandc/JennerMT96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/CaussinusMTV96,
  author    = {Herv{\'{e}} Caussinus and
               Pierre McKenzie and
               Denis Th{\'{e}}rien and
               Heribert Vollmer},
  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},
  year      = {1996},
  crossref  = {DBLP:conf/coco/1996},
  url       = {https://doi.org/10.1109/CCC.1996.507664},
  doi       = {10.1109/CCC.1996.507664},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/CaussinusMTV96},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/BeaudryM95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/McKenzieT94,
  author    = {Pierre McKenzie and
               Denis Th{\'{e}}rien},
  title     = {Special Issue on Circuit Complexity: Foreword},
  journal   = {Computational Complexity},
  volume    = {4},
  pages     = {297--300},
  year      = {1994},
  url       = {https://doi.org/10.1007/BF01263418},
  doi       = {10.1007/BF01263418},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/McKenzieT94},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1994},
  crossref  = {DBLP:conf/coco/1994},
  url       = {https://doi.org/10.1109/SCT.1994.315799},
  doi       = {10.1109/SCT.1994.315799},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/JennerMT94},
  bibsource = {dblp computer science bibliography, http://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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/BedardLM93},
  bibsource = {dblp computer science bibliography, http://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       = {http://doi.acm.org/10.1145/146637.146661},
  doi       = {10.1145/146637.146661},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/BeaudryMT92},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1992},
  crossref  = {DBLP:conf/coco/1992},
  url       = {https://doi.org/10.1109/SCT.1992.215384},
  doi       = {10.1109/SCT.1992.215384},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BeaudryM92},
  bibsource = {dblp computer science bibliography, http://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   = {Computational Complexity},
  volume    = {1},
  pages     = {330--359},
  year      = {1991},
  url       = {https://doi.org/10.1007/BF01212963},
  doi       = {10.1007/BF01212963},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/McKenziePT91},
  bibsource = {dblp computer science bibliography, http://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 = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iandc/BarringtonM91},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1990},
  crossref  = {DBLP:conf/coco/1990},
  url       = {https://doi.org/10.1109/SCT.1990.113968},
  doi       = {10.1109/SCT.1990.113968},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BedardLM90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/McKenzieT89,
  author    = {Pierre McKenzie and
               Denis Th{\'{e}}rien},
  title     = {Automata Theory Meets Circuit Complexity},
  booktitle = {Automata, Languages and Programming, 16th International Colloquium,
               ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings},
  pages     = {589--602},
  year      = {1989},
  crossref  = {DBLP:conf/icalp/1989},
  url       = {https://doi.org/10.1007/BFb0035785},
  doi       = {10.1007/BFb0035785},
  timestamp = {Thu, 15 Jun 2017 21:39:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/McKenzieT89},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BarringtonM89,
  author    = {David A. Mix Barrington and
               Pierre McKenzie},
  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},
  pages     = {370--379},
  year      = {1989},
  crossref  = {DBLP:conf/mfcs/1989},
  url       = {https://doi.org/10.1007/3-540-51486-4_84},
  doi       = {10.1007/3-540-51486-4_84},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/BarringtonM89},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BeaudryMT89,
  author    = {Martin Beaudry and
               Pierre McKenzie and
               Denis Th{\'{e}}rien},
  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},
  pages     = {388--399},
  year      = {1989},
  crossref  = {DBLP:conf/stacs/1989},
  url       = {https://doi.org/10.1007/BFb0029001},
  doi       = {10.1007/BFb0029001},
  timestamp = {Fri, 19 May 2017 13:10:45 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/BeaudryMT89},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/LuksM88},
  bibsource = {dblp computer science bibliography, http://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, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/CookM87},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/siamcomp/McKenzieC87},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1985},
  crossref  = {DBLP:conf/focs/FOCS26},
  url       = {https://doi.org/10.1109/SFCS.1985.26},
  doi       = {10.1109/SFCS.1985.26},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/LuksM85},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/ipl/McKenzie84},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1983},
  crossref  = {DBLP:conf/focs/FOCS24},
  url       = {https://doi.org/10.1109/SFCS.1983.74},
  doi       = {10.1109/SFCS.1983.74},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/McKenzieC83},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/lics/2015,
  title     = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
               2015, Kyoto, Japan, July 6-10, 2015},
  publisher = {{IEEE} Computer Society},
  year      = {2015},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7174833},
  isbn      = {978-1-4799-8875-4},
  timestamp = {Wed, 25 May 2016 10:19:57 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/lics/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2014-2,
  editor    = {Javier Esparza and
               Pierre Fraigniaud and
               Thore Husfeldt and
               Elias Koutsoupias},
  title     = {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},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-662-43951-7},
  doi       = {10.1007/978-3-662-43951-7},
  isbn      = {978-3-662-43950-0},
  timestamp = {Tue, 23 May 2017 01:08:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2014-2},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ncma/2014,
  editor    = {Suna Bensch and
               Rudolf Freund and
               Friedrich Otto},
  title     = {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},
  publisher = {{\"{O}}sterreichische Computer Gesellschaft},
  year      = {2014},
  isbn      = {978-3-85403-304-2},
  timestamp = {Thu, 23 Jun 2016 15:53:29 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ncma/2014},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/cai/2013,
  editor    = {Traian Muntean and
               Dimitrios Poulakis and
               Robert Rolland},
  title     = {Algebraic Informatics - 5th International Conference, {CAI} 2013,
               Porquerolles, France, September 3-6, 2013. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8080},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-40663-8},
  doi       = {10.1007/978-3-642-40663-8},
  isbn      = {978-3-642-40662-1},
  timestamp = {Thu, 15 Jun 2017 21:34:06 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cai/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dcfs/2013,
  editor    = {Helmut J{\"{u}}rgensen and
               Rog{\'{e}}rio Reis},
  title     = {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},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-39310-5},
  doi       = {10.1007/978-3-642-39310-5},
  isbn      = {978-3-642-39309-9},
  timestamp = {Thu, 15 Jun 2017 21:36:16 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dcfs/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/csr/2012,
  editor    = {Edward A. Hirsch and
               Juhani Karhum{\"{a}}ki and
               Arto Lepist{\"{o}} and
               Michail Prilutskii},
  title     = {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},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-30642-6},
  doi       = {10.1007/978-3-642-30642-6},
  isbn      = {978-3-642-30641-9},
  timestamp = {Wed, 17 May 2017 14:24:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/csr/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dlt/2012,
  editor    = {Hsu{-}Chun Yen and
               Oscar H. Ibarra},
  title     = {Developments in Language Theory - 16th International Conference, {DLT}
               2012, Taipei, Taiwan, August 14-17, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7410},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-31653-1},
  doi       = {10.1007/978-3-642-31653-1},
  isbn      = {978-3-642-31652-4},
  timestamp = {Fri, 26 May 2017 00:50:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dlt/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2012,
  editor    = {Branislav Rovan and
               Vladimiro Sassone and
               Peter Widmayer},
  title     = {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},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-32589-2},
  doi       = {10.1007/978-3-642-32589-2},
  isbn      = {978-3-642-32588-5},
  timestamp = {Thu, 25 May 2017 00:43:01 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ncma/2011,
  editor    = {Rudolf Freund and
               Markus Holzer and
               Carlo Mereghetti and
               Friedrich Otto and
               Beatrice Palano},
  title     = {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},
  publisher = {Austrian Computer Society},
  year      = {2011},
  isbn      = {978-3-85403-282-3},
  timestamp = {Thu, 17 Mar 2016 10:50:07 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/ncma/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:journals/corr/abs-1108-3412,
  editor    = {Petr Ambroz and
               Stepan Holub and
               Zuzana Mas{\'{a}}kov{\'{a}}},
  title     = {Proceedings 8th International Conference Words 2011, Prague, Czech
               Republic, 12-16th September 2011},
  series    = {{EPTCS}},
  volume    = {63},
  year      = {2011},
  url       = {https://doi.org/10.4204/EPTCS.63},
  doi       = {10.4204/EPTCS.63},
  timestamp = {Wed, 03 May 2017 14:47:54 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1108-3412},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/fun/2010,
  editor    = {Paolo Boldi and
               Luisa Gargano},
  title     = {Fun with Algorithms, 5th International Conference, {FUN} 2010, Ischia,
               Italy, June 2-4, 2010. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6099},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-13122-6},
  doi       = {10.1007/978-3-642-13122-6},
  isbn      = {978-3-642-13121-9},
  timestamp = {Fri, 26 May 2017 00:48:20 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fun/2010},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2009,
  editor    = {Ravi Kannan and
               K. Narayan Kumar},
  title     = {{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},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2009},
  isbn      = {978-3-939897-13-2},
  timestamp = {Wed, 20 Jan 2010 11:13:33 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2009,
  editor    = {Rastislav Kr{\'{a}}lovic and
               Damian Niwinski},
  title     = {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},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-03816-7},
  doi       = {10.1007/978-3-642-03816-7},
  isbn      = {978-3-642-03815-0},
  timestamp = {Thu, 25 May 2017 00:43:01 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/csl/2008,
  editor    = {Michael Kaminski and
               Simone Martini},
  title     = {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},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-87531-4},
  doi       = {10.1007/978-3-540-87531-4},
  isbn      = {978-3-540-87530-7},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/csl/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2007,
  editor    = {Ludek Kucera and
               Anton{\'{\i}}n Kucera},
  title     = {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},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-74456-6},
  doi       = {10.1007/978-3-540-74456-6},
  isbn      = {978-3-540-74455-9},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/csr/2006,
  editor    = {Dima Grigoriev and
               John Harrison and
               Edward A. Hirsch},
  title     = {Computer Science - Theory and Applications, First International Computer
               Science Symposium in Russia, {CSR} 2006, St. Petersburg, Russia, June
               8-12, 2006, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3967},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11753728},
  doi       = {10.1007/11753728},
  isbn      = {3-540-34166-8},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/csr/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2006P6111,
  editor    = {Matthias Krause and
               Pavel Pudl{\'{a}}k and
               R{\"{u}}diger Reischuk and
               Dieter van Melkebeek},
  title     = {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/portals/06111/},
  timestamp = {Sun, 22 Dec 2013 14:10:20 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2006P6111},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/2003,
  editor    = {Helmut Alt and
               Michel Habib},
  title     = {{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},
  publisher = {Springer},
  year      = {2003},
  url       = {https://doi.org/10.1007/3-540-36494-3},
  doi       = {10.1007/3-540-36494-3},
  isbn      = {3-540-00623-0},
  timestamp = {Mon, 29 May 2017 16:53:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2000,
  title     = {Proceedings of the 15th Annual {IEEE} Conference on Computational
               Complexity, Florence, Italy, July 4-7, 2000},
  publisher = {{IEEE} Computer Society},
  year      = {2000},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6911},
  isbn      = {0-7695-0674-7},
  timestamp = {Fri, 13 May 2016 10:31:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2000,
  editor    = {Sanjiv Kapoor and
               Sanjiva Prasad},
  title     = {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},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-44450-5},
  doi       = {10.1007/3-540-44450-5},
  isbn      = {3-540-41413-4},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2000,
  editor    = {Ugo Montanari and
               Jos{\'{e}} D. P. Rolim and
               Emo Welzl},
  title     = {Automata, Languages and Programming, 27th International Colloquium,
               {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1853},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-45022-X},
  doi       = {10.1007/3-540-45022-X},
  isbn      = {3-540-67715-1},
  timestamp = {Wed, 24 May 2017 15:40:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2000,
  editor    = {Mogens Nielsen and
               Branislav Rovan},
  title     = {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},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-44612-5},
  doi       = {10.1007/3-540-44612-5},
  isbn      = {3-540-67901-4},
  timestamp = {Wed, 24 May 2017 15:40:45 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/cocoon/99,
  editor    = {Takao Asano and
               Hiroshi Imai and
               D. T. Lee and
               Shin{-}Ichi Nakano and
               Takeshi Tokuyama},
  title     = {Computing and Combinatorics, 5th Annual International Conference,
               {COCOON} '99, Tokyo, Japan, July 26-28, 1999, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1627},
  publisher = {Springer},
  year      = {1999},
  url       = {https://doi.org/10.1007/3-540-48686-0},
  doi       = {10.1007/3-540-48686-0},
  isbn      = {3-540-66200-6},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/lics/1999,
  title     = {14th Annual {IEEE} Symposium on Logic in Computer Science, Trento,
               Italy, July 2-5, 1999},
  publisher = {{IEEE} Computer Society},
  year      = {1999},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6352},
  isbn      = {0-7695-0158-3},
  timestamp = {Fri, 21 Nov 2014 14:08:57 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/lics/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/1999,
  editor    = {Christoph Meinel and
               Sophie Tison},
  title     = {{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},
  publisher = {Springer},
  year      = {1999},
  url       = {https://doi.org/10.1007/3-540-49116-3},
  doi       = {10.1007/3-540-49116-3},
  timestamp = {Thu, 15 Jun 2017 21:34:34 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1998,
  title     = {Proceedings of the 13th Annual {IEEE} Conference on Computational
               Complexity, Buffalo, New York, USA, June 15-18, 1998},
  publisher = {{IEEE} Computer Society},
  year      = {1998},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5641},
  isbn      = {0-8186-8395-3},
  timestamp = {Fri, 13 May 2016 10:33:02 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/isaac/1998,
  editor    = {Kyung{-}Yong Chwa and
               Oscar H. Ibarra},
  title     = {Algorithms and Computation, 9th International Symposium, {ISAAC} '98,
               Taejon, Korea, December 14-16, 1998, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1533},
  publisher = {Springer},
  year      = {1998},
  url       = {https://doi.org/10.1007/3-540-49381-6},
  doi       = {10.1007/3-540-49381-6},
  isbn      = {3-540-65385-6},
  timestamp = {Tue, 23 May 2017 14:54:58 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1997,
  title     = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
               Complexity, Ulm, Germany, June 24-27, 1997},
  publisher = {{IEEE} Computer Society},
  year      = {1997},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4843},
  isbn      = {0-8186-7907-7},
  timestamp = {Fri, 13 May 2016 10:33:53 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1997},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/1997,
  title     = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
               Miami Beach, Florida, USA, October 19-22, 1997},
  publisher = {{IEEE} Computer Society},
  year      = {1997},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5208},
  isbn      = {0-8186-8197-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/1997},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1996,
  editor    = {Steven Homer and
               Jin{-}Yi Cai},
  title     = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
               Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
  publisher = {{IEEE} Computer Society},
  year      = {1996},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3765},
  isbn      = {0-8186-7386-9},
  timestamp = {Fri, 13 May 2016 10:34:12 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1994,
  title     = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
               Amsterdam, The Netherlands, June 28 - July 1, 1994},
  publisher = {{IEEE} Computer Society},
  year      = {1994},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=967},
  isbn      = {0-8186-5670-0},
  timestamp = {Fri, 13 May 2016 10:38:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1994},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1992,
  title     = {Proceedings of the Seventh Annual Structure in Complexity Theory Conference,
               Boston, Massachusetts, USA, June 22-25, 1992},
  publisher = {{IEEE} Computer Society},
  year      = {1992},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=430},
  isbn      = {0-8186-2955-X},
  timestamp = {Fri, 13 May 2016 10:38:51 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1992},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1990,
  title     = {Proceedings: Fifth Annual Structure in Complexity Theory Conference,
               Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July
               8-11, 1990},
  publisher = {{IEEE} Computer Society},
  year      = {1990},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=476},
  isbn      = {0-8186-2072-2},
  timestamp = {Fri, 13 May 2016 10:39:30 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1990},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/1989,
  editor    = {Giorgio Ausiello and
               Mariangiola Dezani{-}Ciancaglini and
               Simona Ronchi Della Rocca},
  title     = {Automata, Languages and Programming, 16th International Colloquium,
               ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {372},
  publisher = {Springer},
  year      = {1989},
  url       = {https://doi.org/10.1007/BFb0035746},
  doi       = {10.1007/BFb0035746},
  isbn      = {3-540-51371-X},
  timestamp = {Thu, 15 Jun 2017 21:39:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/1989},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/mfcs/1989,
  editor    = {Antoni Kreczmar and
               Grazyna Mirkowska},
  title     = {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},
  publisher = {Springer},
  year      = {1989},
  url       = {https://doi.org/10.1007/3-540-51486-4},
  doi       = {10.1007/3-540-51486-4},
  isbn      = {3-540-51486-4},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/1989},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/1989,
  editor    = {Burkhard Monien and
               Robert Cori},
  title     = {{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},
  publisher = {Springer},
  year      = {1989},
  url       = {https://doi.org/10.1007/BFb0028968},
  doi       = {10.1007/BFb0028968},
  isbn      = {3-540-50840-6},
  timestamp = {Fri, 19 May 2017 13:10:45 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/1989},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS26,
  title     = {26th Annual Symposium on Foundations of Computer Science, Portland,
               Oregon, USA, 21-23 October 1985},
  publisher = {{IEEE} Computer Society},
  year      = {1985},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4568115},
  isbn      = {0-8186-0644-4},
  timestamp = {Wed, 17 Dec 2014 17:01:43 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS26},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS24,
  title     = {24th Annual Symposium on Foundations of Computer Science, Tucson,
               Arizona, USA, 7-9 November 1983},
  publisher = {{IEEE} Computer Society},
  year      = {1983},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4568048},
  isbn      = {0-8186-0508-1},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS24},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier