Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Denis Thérien
@article{DBLP:journals/corr/abs-2110-15245,
author = {Nicholas Roy and
Ingmar Posner and
Tim D. Barfoot and
Philippe Beaudoin and
Yoshua Bengio and
Jeannette Bohg and
Oliver Brock and
Isabelle Depatie and
Dieter Fox and
Daniel E. Koditschek and
Tom{\'{a}}s Lozano{-}P{\'{e}}rez and
Vikash Mansinghka and
Christopher J. Pal and
Blake A. Richards and
Dorsa Sadigh and
Stefan Schaal and
Gaurav S. Sukhatme and
Denis Th{\'{e}}rien and
Marc Toussaint and
Michiel van de Panne},
title = {From Machine Learning to Robotics: Challenges and Opportunities for
Embodied Intelligence},
journal = {CoRR},
volume = {abs/2110.15245},
year = {2021},
url = {https://arxiv.org/abs/2110.15245},
eprinttype = {arXiv},
eprint = {2110.15245},
timestamp = {Wed, 20 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-15245.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChattopadhyayGHT14,
author = {Arkadev Chattopadhyay and
Ricard Gavald{\`{a}} and
Kristoffer Arnsfelt Hansen and
Denis Th{\'{e}}rien},
title = {Learning Read-Constant Polynomials of Constant Degree Modulo Composites},
journal = {Theory Comput. Syst.},
volume = {55},
number = {2},
pages = {404--420},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9488-6},
doi = {10.1007/S00224-013-9488-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ChattopadhyayGHT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/ChattopadhyayGHT11,
author = {Arkadev Chattopadhyay and
Ricard Gavald{\`{a}} and
Kristoffer Arnsfelt Hansen and
Denis Th{\'{e}}rien},
editor = {Alexander S. Kulikov and
Nikolay K. Vereshchagin},
title = {Learning Read-Constant Polynomials of Constant Degree Modulo Composites},
booktitle = {Computer Science - Theory and Applications - 6th International Computer
Science Symposium in Russia, {CSR} 2011, St. Petersburg, Russia, June
14-18, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6651},
pages = {29--42},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20712-9\_3},
doi = {10.1007/978-3-642-20712-9\_3},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/ChattopadhyayGHT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/Therien11,
author = {Denis Th{\'{e}}rien},
editor = {Markus Holzer and
Martin Kutrib and
Giovanni Pighizzini},
title = {The Power of Diversity},
booktitle = {Descriptional Complexity of Formal Systems - 13th International Workshop,
{DCFS} 2011, Gie{\ss}en/Limburg, Germany, July 25-27, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6808},
pages = {43--54},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22600-7\_4},
doi = {10.1007/978-3-642-22600-7\_4},
timestamp = {Sun, 25 Oct 2020 22:35:40 +0100},
biburl = {https://dblp.org/rec/conf/dcfs/Therien11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijac/StraubingTT10,
author = {Howard Straubing and
Pascal Tesson and
Denis Th{\'{e}}rien},
title = {Weakly Iterated Block Products and Applications to Logic and Complexity},
journal = {Int. J. Algebra Comput.},
volume = {20},
number = {2},
pages = {319--341},
year = {2010},
url = {https://doi.org/10.1142/S0218196710005686},
doi = {10.1142/S0218196710005686},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijac/StraubingTT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2010P10061,
editor = {Benjamin Rossman and
Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
title = {Circuits, Logic, and Games, 07.02. - 12.02.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10061},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/portals/10061/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2010P10061.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/RossmanSTV10,
author = {Benjamin Rossman and
Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
editor = {Benjamin Rossman and
Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
title = {10061 Abstracts Collection - Circuits, Logic, and Games},
booktitle = {Circuits, Logic, and Games, 07.02. - 12.02.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10061},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2528/},
timestamp = {Thu, 10 Jun 2021 13:02:04 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/RossmanSTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/RossmanSTV10a,
author = {Benjamin Rossman and
Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
editor = {Benjamin Rossman and
Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
title = {10061 Executive Summary - Circuits, Logic, and Games},
booktitle = {Circuits, Logic, and Games, 07.02. - 12.02.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10061},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2527/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/RossmanSTV10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/GavaldaT09,
author = {Ricard Gavald{\`{a}} and
Denis Th{\'{e}}rien},
editor = {Ricard Gavald{\`{a}} and
G{\'{a}}bor Lugosi and
Thomas Zeugmann and
Sandra Zilles},
title = {An Algebraic Perspective on Boolean Function Learning},
booktitle = {Algorithmic Learning Theory, 20th International Conference, {ALT}
2009, Porto, Portugal, October 3-5, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5809},
pages = {201--215},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04414-4\_19},
doi = {10.1007/978-3-642-04414-4\_19},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alt/GavaldaT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/StraubingT08,
author = {Howard Straubing and
Denis Th{\'{e}}rien},
editor = {J{\"{o}}rg Flum and
Erich Gr{\"{a}}del and
Thomas Wilke},
title = {Modular quantifiers},
booktitle = {Logic and Automata: History and Perspectives [in Honor of Wolfgang
Thomas]},
series = {Texts in Logic and Games},
volume = {2},
pages = {613--628},
publisher = {Amsterdam University Press},
year = {2008},
timestamp = {Wed, 15 Dec 2010 22:14:40 +0100},
biburl = {https://dblp.org/rec/conf/birthday/StraubingT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/TessonT07,
author = {Pascal Tesson and
Denis Th{\'{e}}rien},
title = {Logic Meets Algebra: the Case of Regular Languages},
journal = {Log. Methods Comput. Sci.},
volume = {3},
number = {1},
year = {2007},
url = {https://doi.org/10.2168/LMCS-3(1:4)2007},
doi = {10.2168/LMCS-3(1:4)2007},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/TessonT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KlimaTT07,
author = {Ondrej Kl{\'{\i}}ma and
Pascal Tesson and
Denis Th{\'{e}}rien},
title = {Dichotomies in the Complexity of Solving Systems of Equations over
Finite Semigroups},
journal = {Theory Comput. Syst.},
volume = {40},
number = {3},
pages = {263--297},
year = {2007},
url = {https://doi.org/10.1007/s00224-005-1279-2},
doi = {10.1007/S00224-005-1279-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KlimaTT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChattopadhyayKKSTT07,
author = {Arkadev Chattopadhyay and
Andreas Krebs and
Michal Kouck{\'{y}} and
Mario Szegedy and
Pascal Tesson and
Denis Th{\'{e}}rien},
editor = {Wolfgang Thomas and
Pascal Weil},
title = {Languages with Bounded Multiparty Communication Complexity},
booktitle = {{STACS} 2007, 24th Annual Symposium on Theoretical Aspects of Computer
Science, Aachen, Germany, February 22-24, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4393},
pages = {500--511},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-70918-3\_43},
doi = {10.1007/978-3-540-70918-3\_43},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChattopadhyayKKSTT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2006P6451,
editor = {Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
title = {Circuits, Logic, and Games, 08.11. - 10.11.2006},
series = {Dagstuhl Seminar Proceedings},
volume = {06451},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/portals/06451/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2006P6451.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0701154,
author = {Pascal Tesson and
Denis Th{\'{e}}rien},
title = {Logic Meets Algebra: the Case of Regular Languages},
journal = {CoRR},
volume = {abs/cs/0701154},
year = {2007},
url = {http://arxiv.org/abs/cs/0701154},
eprinttype = {arXiv},
eprint = {cs/0701154},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0701154.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/TessonT06,
author = {Pascal Tesson and
Denis Th{\'{e}}rien},
title = {Bridges between Algebraic Automata Theory and Complexity Theory},
journal = {Bull. {EATCS}},
volume = {88},
pages = {37--64},
year = {2006},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/TessonT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GavaldaTT06,
author = {Ricard Gavald{\`{a}} and
Pascal Tesson and
Denis Th{\'{e}}rien},
title = {Learning expressions and programs over monoids},
journal = {Inf. Comput.},
volume = {204},
number = {2},
pages = {177--209},
year = {2006},
url = {https://doi.org/10.1016/j.ic.2005.09.003},
doi = {10.1016/J.IC.2005.09.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GavaldaTT06.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/mst/AmbainisBGKMT06,
author = {Andris Ambainis and
Martin Beaudry and
Marats Golovkins and
Arnolds Kikusts and
Mark Mercer and
Denis Th{\'{e}}rien},
title = {Algebraic Results on Quantum Automata},
journal = {Theory Comput. Syst.},
volume = {39},
number = {1},
pages = {165--188},
year = {2006},
url = {https://doi.org/10.1007/s00224-005-1263-x},
doi = {10.1007/S00224-005-1263-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AmbainisBGKMT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/StraubingT06,
author = {Howard Straubing and
Denis Th{\'{e}}rien},
title = {A Note on MOD\({}_{\mbox{p}}\) - MOD\({}_{\mbox{m}}\) Circuits},
journal = {Theory Comput. Syst.},
volume = {39},
number = {5},
pages = {699--706},
year = {2006},
url = {https://doi.org/10.1007/s00224-004-1210-2},
doi = {10.1007/S00224-004-1210-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/StraubingT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KouckyLPT06,
author = {Michal Kouck{\'{y}} and
Clemens Lautemann and
Sebastian Poloczek and
Denis Th{\'{e}}rien},
title = {Circuit Lower Bounds via Ehrenfeucht-Fraisse Games},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {190--201},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.12},
doi = {10.1109/CCC.2006.12},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KouckyLPT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/LautemannTT06,
author = {Clemens Lautemann and
Pascal Tesson and
Denis Th{\'{e}}rien},
editor = {Zolt{\'{a}}n {\'{E}}sik},
title = {An Algebraic Point of View on the Crane Beach Property},
booktitle = {Computer Science Logic, 20th International Workshop, {CSL} 2006, 15th
Annual Conference of the EACSL, Szeged, Hungary, September 25-29,
2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4207},
pages = {426--440},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11874683\_28},
doi = {10.1007/11874683\_28},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/LautemannTT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChattopadhyayGPT06,
author = {Arkadev Chattopadhyay and
Navin Goyal and
Pavel Pudl{\'{a}}k and
Denis Th{\'{e}}rien},
title = {Lower bounds for circuits with MOD{\_}m gates},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {709--718},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.46},
doi = {10.1109/FOCS.2006.46},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChattopadhyayGPT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/SchwentickTV06,
author = {Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
editor = {Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
title = {06451 Executive Summary -- Circuits, Logic, and Games},
booktitle = {Circuits, Logic, and Games, 08.11. - 10.11.2006},
series = {Dagstuhl Seminar Proceedings},
volume = {06451},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2006},
url = {http://drops.dagstuhl.de/opus/volltexte/2007/977},
timestamp = {Thu, 10 Jun 2021 13:02:03 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/SchwentickTV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/SchwentickTV06a,
author = {Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
editor = {Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
title = {06451 Abstracts Collection -- Circuits, Logic, and Games},
booktitle = {Circuits, Logic, and Games, 08.11. - 10.11.2006},
series = {Dagstuhl Seminar Proceedings},
volume = {06451},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2006},
url = {http://drops.dagstuhl.de/opus/volltexte/2007/978},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/SchwentickTV06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayKKSTT06,
author = {Arkadev Chattopadhyay and
Michal Kouck{\'{y}} and
Andreas Krebs and
Mario Szegedy and
Pascal Tesson and
Denis Th{\'{e}}rien},
title = {Languages with Bounded Multiparty Communication Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-117}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-117/index.html},
eprinttype = {ECCC},
eprint = {TR06-117},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayKKSTT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BorchertLSTT05,
author = {Bernd Borchert and
Klaus{-}J{\"{o}}rn Lange and
Frank Stephan and
Pascal Tesson and
Denis Th{\'{e}}rien},
title = {The dot-depth and the polynomial hierarchies correspond on the delta
levels},
journal = {Int. J. Found. Comput. Sci.},
volume = {16},
number = {4},
pages = {625--644},
year = {2005},
url = {https://doi.org/10.1142/S0129054105003200},
doi = {10.1142/S0129054105003200},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BorchertLSTT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Therien05,
author = {Denis Th{\'{e}}rien},
title = {Imre Simon: an exceptional graduate student},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {39},
number = {1},
pages = {297--304},
year = {2005},
url = {https://doi.org/10.1051/ita:2005017},
doi = {10.1051/ITA:2005017},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Therien05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BarringtonILST05,
author = {David A. Mix Barrington and
Neil Immerman and
Clemens Lautemann and
Nicole Schweikardt and
Denis Th{\'{e}}rien},
title = {First-order expressibility of languages with neutral letters or: The
Crane Beach conjecture},
journal = {J. Comput. Syst. Sci.},
volume = {70},
number = {2},
pages = {101--127},
year = {2005},
url = {https://doi.org/10.1016/j.jcss.2004.07.004},
doi = {10.1016/J.JCSS.2004.07.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BarringtonILST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/TessonT05,
author = {Pascal Tesson and
Denis Th{\'{e}}rien},
title = {Complete Classifications for the Communication Complexity of Regular
Languages},
journal = {Theory Comput. Syst.},
volume = {38},
number = {2},
pages = {135--159},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1190-2},
doi = {10.1007/S00224-004-1190-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/TessonT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/DalmauGTT05,
author = {V{\'{\i}}ctor Dalmau and
Ricard Gavald{\`{a}} and
Pascal Tesson and
Denis Th{\'{e}}rien},
editor = {Peter van Beek},
title = {Tractable Clones of Polynomials over Semigroups},
booktitle = {Principles and Practice of Constraint Programming - {CP} 2005, 11th
International Conference, {CP} 2005, Sitges, Spain, October 1-5, 2005,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3709},
pages = {196--210},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11564751\_17},
doi = {10.1007/11564751\_17},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/DalmauGTT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BeaudryLT05,
author = {Martin Beaudry and
Fran{\c{c}}ois Lemieux and
Denis Th{\'{e}}rien},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {Groupoids That Recognize Only Regular Languages},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {421--433},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_35},
doi = {10.1007/11523468\_35},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BeaudryLT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/TessonT05,
author = {Pascal Tesson and
Denis Th{\'{e}}rien},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {Restricted Two-Variable Sentences, Circuits and Communication Complexity},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {526--538},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_43},
doi = {10.1007/11523468\_43},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/TessonT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KouckyPT05,
author = {Michal Kouck{\'{y}} and
Pavel Pudl{\'{a}}k and
Denis Th{\'{e}}rien},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {Bounded-depth circuits: separating wires from gates},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {257--265},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060629},
doi = {10.1145/1060590.1060629},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KouckyPT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-059,
author = {V{\'{\i}}ctor Dalmau and
Ricard Gavald{\`{a}} and
Pascal Tesson and
Denis Th{\'{e}}rien},
title = {Tractable Clones of Polynomials over Semigroups},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-059}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-059/index.html},
eprinttype = {ECCC},
eprint = {TR05-059},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-059.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijac/TessonT04,
author = {Pascal Tesson and
Denis Th{\'{e}}rien},
title = {Monoids and Computations},
journal = {Int. J. Algebra Comput.},
volume = {14},
number = {5-6},
pages = {801--816},
year = {2004},
url = {https://doi.org/10.1142/S0218196704001979},
doi = {10.1142/S0218196704001979},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijac/TessonT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/TherienW04,
author = {Denis Th{\'{e}}rien and
Thomas Wilke},
title = {Nesting Until and Since in Linear Temporal Logic},
journal = {Theory Comput. Syst.},
volume = {37},
number = {1},
pages = {111--131},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1109-3},
doi = {10.1007/S00224-003-1109-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/TherienW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/BorchertLSTT04,
author = {Bernd Borchert and
Klaus{-}J{\"{o}}rn Lange and
Frank Stephan and
Pascal Tesson and
Denis Th{\'{e}}rien},
editor = {Cristian Calude and
Elena Calude and
Michael J. Dinneen},
title = {The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta
Levels},
booktitle = {Developments in Language Theory, 8th International Conference, {DLT}
2004, Auckland, New Zealand, December 13-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3340},
pages = {89--101},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30550-7\_8},
doi = {10.1007/978-3-540-30550-7\_8},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/BorchertLSTT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Therien04,
author = {Denis Th{\'{e}}rien},
editor = {Kamal Lodaya and
Meena Mahajan},
title = {Regular Languages, Unambiguous Concatenation and Computational Complexity},
booktitle = {{FSTTCS} 2004: Foundations of Software Technology and Theoretical
Computer Science, 24th International Conference, Chennai, India, December
16-18, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3328},
pages = {49--57},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30538-5\_5},
doi = {10.1007/978-3-540-30538-5\_5},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Therien04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AmbainisBGKMT04,
author = {Andris Ambainis and
Martin Beaudry and
Marats Golovkins and
Arnolds Kikusts and
Mark Mercer and
Denis Th{\'{e}}rien},
editor = {Volker Diekert and
Michel Habib},
title = {Algebraic Results on Quantum Automata},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {93--104},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_9},
doi = {10.1007/978-3-540-24749-4\_9},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AmbainisBGKMT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-091,
author = {Ondrej Kl{\'{\i}}ma and
Pascal Tesson and
Denis Th{\'{e}}rien},
title = {Dichotomies in the Complexity of Solving Systems of Equations over
Finite Semigroups},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-091}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-091/index.html},
eprinttype = {ECCC},
eprint = {TR04-091},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-091.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BouyerPT03,
author = {Patricia Bouyer and
Antoine Petit and
Denis Th{\'{e}}rien},
title = {An algebraic approach to data languages and timed languages},
journal = {Inf. Comput.},
volume = {182},
number = {2},
pages = {137--162},
year = {2003},
url = {https://doi.org/10.1016/S0890-5401(03)00038-5},
doi = {10.1016/S0890-5401(03)00038-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BouyerPT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/StraubingT03,
author = {Howard Straubing and
Denis Th{\'{e}}rien},
title = {Regular Languages Defined by Generalized First-Order Formulas with
a Bounded Number of Bound Variables},
journal = {Theory Comput. Syst.},
volume = {36},
number = {1},
pages = {29--69},
year = {2003},
url = {https://doi.org/10.1007/s00224-002-1035-9},
doi = {10.1007/S00224-002-1035-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/StraubingT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChattopadhyayT03,
author = {Arkadev Chattopadhyay and
Denis Th{\'{e}}rien},
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {Locally Commutative Categories},
booktitle = {Automata, Languages and Programming, 30th International Colloquium,
{ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2719},
pages = {984--995},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45061-0\_76},
doi = {10.1007/3-540-45061-0\_76},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChattopadhyayT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/TessonT03,
author = {Pascal Tesson and
Denis Th{\'{e}}rien},
editor = {Helmut Alt and
Michel Habib},
title = {Complete Classifications for the Communication Complexity of Regular
Languages},
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 = {62--73},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_7},
doi = {10.1007/3-540-36494-3\_7},
timestamp = {Thu, 14 Oct 2021 10:38:16 +0200},
biburl = {https://dblp.org/rec/conf/stacs/TessonT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GavaldaT03,
author = {Ricard Gavald{\`{a}} and
Denis Th{\'{e}}rien},
editor = {Helmut Alt and
Michel Habib},
title = {Algebraic Characterizations of Small Classes of Boolean Functions},
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 = {331--342},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_30},
doi = {10.1007/3-540-36494-3\_30},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GavaldaT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/TessonT02,
author = {Pascal Tesson and
Denis Th{\'{e}}rien},
title = {The Computing Power of Programs over Finite Monoids},
journal = {J. Autom. Lang. Comb.},
volume = {7},
number = {2},
pages = {247--258},
year = {2002},
url = {https://doi.org/10.25596/jalc-2002-247},
doi = {10.25596/JALC-2002-247},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/TessonT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/StraubingT02,
author = {Howard Straubing and
Denis Th{\'{e}}rien},
editor = {Sergio Rajsbaum},
title = {Weakly Iterated Block Products of Finite Monoids},
booktitle = {{LATIN} 2002: Theoretical Informatics, 5th Latin American Symposium,
Cancun, Mexico, April 3-6, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2286},
pages = {91--104},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45995-2\_13},
doi = {10.1007/3-540-45995-2\_13},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/StraubingT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/TherienW02,
author = {Denis Th{\'{e}}rien and
Thomas Wilke},
editor = {Helmut Alt and
Afonso Ferreira},
title = {Nesting Until and Since in Linear Temporal Logic},
booktitle = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2285},
pages = {455--464},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45841-7\_37},
doi = {10.1007/3-540-45841-7\_37},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/TherienW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TherienW01,
author = {Denis Th{\'{e}}rien and
Thomas Wilke},
title = {Temporal Logic and Semidirect Products: An Effective Characterization
of the Until Hierarchy},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {3},
pages = {777--798},
year = {2001},
url = {https://doi.org/10.1137/S0097539797322772},
doi = {10.1137/S0097539797322772},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TherienW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BouyerPT01,
author = {Patricia Bouyer and
Antoine Petit and
Denis Th{\'{e}}rien},
editor = {Kim Guldstrand Larsen and
Mogens Nielsen},
title = {An Algebraic Characterization of Data and Timed Languages},
booktitle = {{CONCUR} 2001 - Concurrency Theory, 12th International Conference,
Aalborg, Denmark, August 20-25, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2154},
pages = {248--261},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44685-0\_17},
doi = {10.1007/3-540-44685-0\_17},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/concur/BouyerPT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/SchwentickTV01,
author = {Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
editor = {Werner Kuich and
Grzegorz Rozenberg and
Arto Salomaa},
title = {Partially-Ordered Two-Way Automata: {A} New Characterization of {DA}},
booktitle = {Developments in Language Theory, 5th International Conference, {DLT}
2001, Vienna, Austria, July 16-21, 2001, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2295},
pages = {239--250},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-46011-X\_20},
doi = {10.1007/3-540-46011-X\_20},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/SchwentickTV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BarringtonILST01,
author = {David A. Mix Barrington and
Neil Immerman and
Clemens Lautemann and
Nicole Schweikardt and
Denis Th{\'{e}}rien},
title = {The Crane Beach Conjecture},
booktitle = {16th Annual {IEEE} Symposium on Logic in Computer Science, Boston,
Massachusetts, USA, June 16-19, 2001, Proceedings},
pages = {187--196},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/LICS.2001.932496},
doi = {10.1109/LICS.2001.932496},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/BarringtonILST01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MooreTT01,
author = {Cristopher Moore and
Pascal Tesson and
Denis Th{\'{e}}rien},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Satisfiability of Systems of Equations over Finite Monoids},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {537--547},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_47},
doi = {10.1007/3-540-44683-4\_47},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/MooreTT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BeaudryLT01,
author = {Martin Beaudry and
Fran{\c{c}}ois Lemieux and
Denis Th{\'{e}}rien},
editor = {Afonso Ferreira and
Horst Reichel},
title = {Star-Free Open Languages and Aperiodic Loops},
booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
Science, Dresden, Germany, February 15-17, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2010},
pages = {87--98},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44693-1\_8},
doi = {10.1007/3-540-44693-1\_8},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BeaudryLT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GavaldaT01,
author = {Ricard Gavald{\`{a}} and
Denis Th{\'{e}}rien},
editor = {Afonso Ferreira and
Horst Reichel},
title = {Learning Expressions over Monoids},
booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
Science, Dresden, Germany, February 15-17, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2010},
pages = {283--293},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44693-1\_25},
doi = {10.1007/3-540-44693-1\_25},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GavaldaT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/StraubingT01,
author = {Howard Straubing and
Denis Th{\'{e}}rien},
editor = {Afonso Ferreira and
Horst Reichel},
title = {Regular Languages Defined by Generalized First-Order Formulas with
a Bounded Number of Bound Variables},
booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
Science, Dresden, Germany, February 15-17, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2010},
pages = {551--562},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44693-1\_48},
doi = {10.1007/3-540-44693-1\_48},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/StraubingT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-005,
author = {Pascal Tesson and
Denis Th{\'{e}}rien},
title = {The Computing Power of Programs over Finite Monoids},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-005}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-005/index.html},
eprinttype = {ECCC},
eprint = {TR01-005},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-040,
author = {Pierre P{\'{e}}ladeau and
Denis Th{\'{e}}rien},
title = {On the Languages Recognized by Nilpotent Groups (a translation of
"Sur les Langages Reconnus par des Groupes Nilpotents")},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-040}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-040/index.html},
eprinttype = {ECCC},
eprint = {TR01-040},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoldmannRT00,
author = {Mikael Goldmann and
Alexander Russell and
Denis Th{\'{e}}rien},
title = {An ergodic theorem for read-once non-uniform deterministic finite
automata},
journal = {Inf. Process. Lett.},
volume = {73},
number = {1-2},
pages = {23--28},
year = {2000},
url = {https://doi.org/10.1016/S0020-0190(99)00162-3},
doi = {10.1016/S0020-0190(99)00162-3},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoldmannRT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MooreTLBD00,
author = {Cristopher Moore and
Denis Th{\'{e}}rien and
Fran{\c{c}}ois Lemieux and
Joshua Berman and
Arthur Drisko},
title = {Circuits and Expressions with Nonassociative Gates},
journal = {J. Comput. Syst. Sci.},
volume = {60},
number = {2},
pages = {368--394},
year = {2000},
url = {https://doi.org/10.1006/jcss.1999.1673},
doi = {10.1006/JCSS.1999.1673},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MooreTLBD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MacielPT00,
author = {Alexis Maciel and
Pierre P{\'{e}}ladeau and
Denis Th{\'{e}}rien},
title = {Programs over semigroups of dot-depth one},
journal = {Theor. Comput. Sci.},
volume = {245},
number = {1},
pages = {135--148},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00278-9},
doi = {10.1016/S0304-3975(99)00278-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MacielPT00.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}
}
@article{DBLP:journals/iandc/MacielT99,
author = {Alexis Maciel and
Denis Th{\'{e}}rien},
title = {Efficient Threshold Circuits for Power Series},
journal = {Inf. Comput.},
volume = {152},
number = {1},
pages = {62--73},
year = {1999},
url = {https://doi.org/10.1006/inco.1998.2783},
doi = {10.1006/INCO.1998.2783},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/MacielT99.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}
}
@article{DBLP:journals/iandc/MacielT98,
author = {Alexis Maciel and
Denis Th{\'{e}}rien},
title = {Threshold Circuits of Small Majority-Depth},
journal = {Inf. Comput.},
volume = {146},
number = {1},
pages = {55--83},
year = {1998},
url = {https://doi.org/10.1006/inco.1998.2732},
doi = {10.1006/INCO.1998.2732},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/MacielT98.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/icalp/RaymondTT98,
author = {Jean{-}Fran{\c{c}}ois Raymond and
Pascal Tesson and
Denis Th{\'{e}}rien},
editor = {Kim Guldstrand Larsen and
Sven Skyum and
Glynn Winskel},
title = {An Algebraic Approach to Communication Complexity},
booktitle = {Automata, Languages and Programming, 25th International Colloquium,
ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1443},
pages = {29--40},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055038},
doi = {10.1007/BFB0055038},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/RaymondTT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/TherienW98,
author = {Denis Th{\'{e}}rien and
Thomas Wilke},
editor = {Jeffrey Scott Vitter},
title = {Over Words, Two Variables Are as Powerful as One Quantifier Alternation},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {234--240},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276749},
doi = {10.1145/276698.276749},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/TherienW98.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/PeladeauST97,
author = {Pierre P{\'{e}}ladeau and
Howard Straubing and
Denis Th{\'{e}}rien},
title = {Finite Semigroup Varieties Defined by Programs},
journal = {Theor. Comput. Sci.},
volume = {180},
number = {1-2},
pages = {325--339},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00297-6},
doi = {10.1016/S0304-3975(96)00297-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PeladeauST97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BermanDLMT97,
author = {Joshua Berman and
Arthur Drisko and
Fran{\c{c}}ois Lemieux and
Cristopher Moore and
Denis Th{\'{e}}rien},
title = {Circuits and Expressions with NOn-Associative Gates},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {193--203},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612315},
doi = {10.1109/CCC.1997.612315},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BermanDLMT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BeaudryLT97,
author = {Martin Beaudry and
Fran{\c{c}}ois Lemieux and
Denis Th{\'{e}}rien},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Finite Loops Recognize Exactly the Regular Open Languages},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {110--120},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_169},
doi = {10.1007/3-540-63165-8\_169},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BeaudryLT97.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}
}
@inproceedings{DBLP:conf/focs/TherienW96,
author = {Denis Th{\'{e}}rien and
Thomas Wilke},
title = {Temporal Logic and Semidirect Products: An Effective Characterization
of the Until Hierarchy},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {256--263},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548484},
doi = {10.1109/SFCS.1996.548484},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/TherienW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/StraubingTT95,
author = {Howard Straubing and
Denis Th{\'{e}}rien and
Wolfgang Thomas},
title = {Regular Languages Defined with Generalized Quanifiers},
journal = {Inf. Comput.},
volume = {118},
number = {2},
pages = {289--301},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1067},
doi = {10.1006/INCO.1995.1067},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/StraubingTT95.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}
}
@article{DBLP:journals/cc/Therien94,
author = {Denis Th{\'{e}}rien},
title = {Circuits Constructed with Mod{\_}q Gates Cannot Compute "And"
in Sublinear Size},
journal = {Comput. Complex.},
volume = {4},
pages = {383--388},
year = {1994},
url = {https://doi.org/10.1007/BF01263425},
doi = {10.1007/BF01263425},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Therien94.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}
}
@inproceedings{DBLP:conf/csl/LautemannST94,
author = {Clemens Lautemann and
Thomas Schwentick and
Denis Th{\'{e}}rien},
editor = {Leszek Pacholski and
Jerzy Tiuryn},
title = {Logics For Context-Free Languages},
booktitle = {Computer Science Logic, 8th International Workshop, {CSL} '94, Kazimierz,
Poland, September 25-30, 1994, Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {933},
pages = {205--216},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/BFb0022257},
doi = {10.1007/BFB0022257},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/LautemannST94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijac/PinT93,
author = {Jean{-}Eric Pin and
Denis Th{\'{e}}rien},
title = {The Bideterministic Concatenation Product},
journal = {Int. J. Algebra Comput.},
volume = {3},
number = {4},
pages = {535--556},
year = {1993},
url = {https://doi.org/10.1142/S0218196793000305},
doi = {10.1142/S0218196793000305},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijac/PinT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MacielT93,
author = {Alexis Maciel and
Denis Th{\'{e}}rien},
editor = {Patrice Enjalbert and
Alain Finkel and
Klaus W. Wagner},
title = {Threshold Circuits for Iterated Multiplication: Using {AC0} for Free},
booktitle = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer
Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {665},
pages = {545--565},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-56503-5\_54},
doi = {10.1007/3-540-56503-5\_54},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MacielT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/PinST92,
author = {Jean{-}Eric Pin and
Howard Straubing and
Denis Th{\'{e}}rien},
title = {Some Results on the Generalized Star-Height Problem},
journal = {Inf. Comput.},
volume = {101},
number = {2},
pages = {219--250},
year = {1992},
url = {https://doi.org/10.1016/0890-5401(92)90063-L},
doi = {10.1016/0890-5401(92)90063-L},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/PinST92.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}
}
@article{DBLP:journals/jcss/BarringtonCST92,
author = {David A. Mix Barrington and
Kevin J. Compton and
Howard Straubing and
Denis Th{\'{e}}rien},
title = {Regular Languages in NC{\({^1}\)}},
journal = {J. Comput. Syst. Sci.},
volume = {44},
number = {3},
pages = {478--499},
year = {1992},
url = {https://doi.org/10.1016/0022-0000(92)90014-A},
doi = {10.1016/0022-0000(92)90014-A},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BarringtonCST92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/Therien92,
author = {Denis Th{\'{e}}rien},
editor = {Imre Simon},
title = {Circuits Constructed with \emph{MOD\({}^{\mbox{q}}\)} Gates Cannot
Compute \emph{AND} in Sublinear Size},
booktitle = {{LATIN} '92, 1st Latin American Symposium on Theoretical Informatics,
S{\~{a}}o Paulo, Brazil, April 6-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {583},
pages = {498--502},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/BFb0023851},
doi = {10.1007/BFB0023851},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/Therien92.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/BarringtonST90,
author = {David A. Mix Barrington and
Howard Straubing and
Denis Th{\'{e}}rien},
title = {Non-Uniform Automata Over Groups},
journal = {Inf. Comput.},
volume = {89},
number = {2},
pages = {109--132},
year = {1990},
url = {https://doi.org/10.1016/0890-5401(90)90007-5},
doi = {10.1016/0890-5401(90)90007-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BarringtonST90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Therien89,
author = {Denis Th{\'{e}}rien},
title = {Programs over Aperiodic Monoids},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {3},
pages = {271--280},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90051-0},
doi = {10.1016/0304-3975(89)90051-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Therien89.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/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}
}
@inproceedings{DBLP:conf/stacs/PinST89,
author = {Jean{-}Eric Pin and
Howard Straubing and
Denis Th{\'{e}}rien},
editor = {Burkhard Monien and
Robert Cori},
title = {New Results on the Generalized Star-Height Problem},
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 = {458--467},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/BFb0029007},
doi = {10.1007/BFB0029007},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/PinST89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Therien88,
author = {Denis Th{\'{e}}rien},
title = {Categories Et Langages De Dot-Depth Un},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {22},
number = {4},
pages = {437--445},
year = {1988},
url = {https://doi.org/10.1051/ita/1988220404371},
doi = {10.1051/ITA/1988220404371},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Therien88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BarringtonT88,
author = {David A. Mix Barrington and
Denis Th{\'{e}}rien},
title = {Finite monoids and the fine structure of NC\({}^{\mbox{1}}\)},
journal = {J. {ACM}},
volume = {35},
number = {4},
pages = {941--952},
year = {1988},
url = {https://doi.org/10.1145/48014.63138},
doi = {10.1145/48014.63138},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BarringtonT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/StraubingTT88,
author = {Howard Straubing and
Denis Th{\'{e}}rien and
Wolfgang Thomas},
editor = {Timo Lepist{\"{o}} and
Arto Salomaa},
title = {regular Languages Defined with Generalized Quantifiers},
booktitle = {Automata, Languages and Programming, 15th International Colloquium,
ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {317},
pages = {561--575},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19488-6\_142},
doi = {10.1007/3-540-19488-6\_142},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/StraubingTT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/litp/StraubingT88,
author = {Howard Straubing and
Denis Th{\'{e}}rien},
editor = {Jean{-}Eric Pin},
title = {Finite automata and computational complexity},
booktitle = {Formal Properties of Finite Automata and Applications, {LITP} Spring
School on Theoretical Computer Science, Ramatuelle, France, May 23-27,
1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {386},
pages = {199--233},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/BFb0013122},
doi = {10.1007/BFB0013122},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/litp/StraubingT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BarringtonT87,
author = {David A. Mix Barrington and
Denis Th{\'{e}}rien},
editor = {Thomas Ottmann},
title = {Non-Uniform Automata Over Groups},
booktitle = {Automata, Languages and Programming, 14th International Colloquium,
ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {267},
pages = {163--173},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-18088-5\_13},
doi = {10.1007/3-540-18088-5\_13},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BarringtonT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BarringtonT87,
author = {David A. Mix Barrington and
Denis Th{\'{e}}rien},
editor = {Alfred V. Aho},
title = {Finite Monoids and the Fine Structure of NC{\({^1}\)}},
booktitle = {Proceedings of the 19th Annual {ACM} Symposium on Theory of Computing,
1987, New York, New York, {USA}},
pages = {101--109},
publisher = {{ACM}},
year = {1987},
url = {https://doi.org/10.1145/28395.28407},
doi = {10.1145/28395.28407},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BarringtonT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/WeissT86,
author = {Alex Weiss and
Denis Th{\'{e}}rien},
title = {Varieties of Finite Categories},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {3},
pages = {357--366},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200303571},
doi = {10.1051/ITA/1986200303571},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/WeissT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Therien81,
author = {Denis Th{\'{e}}rien},
title = {Classification of Finite Monoids: The Language Approach},
journal = {Theor. Comput. Sci.},
volume = {14},
pages = {195--208},
year = {1981},
url = {https://doi.org/10.1016/0304-3975(81)90057-8},
doi = {10.1016/0304-3975(81)90057-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Therien81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Therien79,
author = {Denis Th{\'{e}}rien},
editor = {Hermann A. Maurer},
title = {Languages of Nilpotent and Solvable Groups (Extended Abstract)},
booktitle = {Automata, Languages and Programming, 6th Colloquium, Graz, Austria,
July 16-20, 1979, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {71},
pages = {616--632},
publisher = {Springer},
year = {1979},
url = {https://doi.org/10.1007/3-540-09510-1\_49},
doi = {10.1007/3-540-09510-1\_49},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Therien79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
