Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Sylvain Schmitz
@article{DBLP:journals/corr/abs-2305-10546,
author = {Nathana{\"{e}}l Fijalkow and
Nathalie Bertrand and
Patricia Bouyer{-}Decitre and
Romain Brenguier and
Arnaud Carayol and
John Fearnley and
Hugo Gimbert and
Florian Horn and
Rasmus Ibsen{-}Jensen and
Nicolas Markey and
Benjamin Monmege and
Petr Novotn{\'{y}} and
Mickael Randour and
Ocan Sankur and
Sylvain Schmitz and
Olivier Serre and
Mateusz Skomra},
title = {Games on Graphs},
journal = {CoRR},
volume = {abs/2305.10546},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.10546},
doi = {10.48550/ARXIV.2305.10546},
eprinttype = {arXiv},
eprint = {2305.10546},
timestamp = {Thu, 25 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-10546.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-02847,
author = {Sylvain Schmitz and
Lia Sch{\"{u}}tze},
title = {On the Length of Strongly Monotone Descending Chains over N\({}^{\mbox{d}}\)},
journal = {CoRR},
volume = {abs/2310.02847},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.02847},
doi = {10.48550/ARXIV.2310.02847},
eprinttype = {arXiv},
eprint = {2310.02847},
timestamp = {Thu, 19 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-02847.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-14587,
author = {Sergio Abriola and
Simon Halfon and
Aliaume Lopez and
Sylvain Schmitz and
Philippe Schnoebelen and
Isa Vialard},
title = {Measuring well quasi-ordered finitary powersets},
journal = {CoRR},
volume = {abs/2312.14587},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.14587},
doi = {10.48550/ARXIV.2312.14587},
eprinttype = {arXiv},
eprint = {2312.14587},
timestamp = {Thu, 18 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-14587.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/BellPST22,
author = {Paul C. Bell and
Igor Potapov and
Sylvain Schmitz and
Patrick Totzke},
title = {Preface},
journal = {Fundam. Informaticae},
volume = {189},
number = {3-4},
year = {2022},
url = {https://doi.org/10.3233/FI-222158},
doi = {10.3233/FI-222158},
timestamp = {Mon, 13 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fuin/BellPST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/issac/NosanPSS022,
author = {Klara Nosan and
Amaury Pouly and
Sylvain Schmitz and
Mahsa Shirmohammadi and
James Worrell},
editor = {Marc Moreno Maza and
Lihong Zhi},
title = {On the Computation of the Zariski Closure of Finitely Generated Groups
of Matrices},
booktitle = {{ISSAC} '22: International Symposium on Symbolic and Algebraic Computation,
Villeneuve-d'Ascq, France, July 4 - 7, 2022},
pages = {129--138},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3476446.3536172},
doi = {10.1145/3476446.3536172},
timestamp = {Wed, 06 Jul 2022 16:19:52 +0200},
biburl = {https://dblp.org/rec/conf/issac/NosanPSS022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/LazicS21,
author = {Ranko Lazic and
Sylvain Schmitz},
title = {The ideal view on Rackoff's coverability technique},
journal = {Inf. Comput.},
volume = {277},
pages = {104582},
year = {2021},
url = {https://doi.org/10.1016/j.ic.2020.104582},
doi = {10.1016/J.IC.2020.104582},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/LazicS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Schmitz21,
author = {Sylvain Schmitz},
editor = {Christel Baier and
Jean Goubault{-}Larrecq},
title = {Branching in Well-Structured Transition Systems (Invited Talk)},
booktitle = {29th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2021,
January 25-28, 2021, Ljubljana, Slovenia (Virtual Conference)},
series = {LIPIcs},
volume = {183},
pages = {3:1--3:3},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CSL.2021.3},
doi = {10.4230/LIPICS.CSL.2021.3},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csl/Schmitz21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/rp/2020,
editor = {Sylvain Schmitz and
Igor Potapov},
title = {Reachability Problems - 14th International Conference, {RP} 2020,
Paris, France, October 19-21, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12448},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61739-4},
doi = {10.1007/978-3-030-61739-4},
isbn = {978-3-030-61738-7},
timestamp = {Thu, 22 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/rp/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Schmitz19,
author = {Sylvain Schmitz},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {The Parametric Complexity of Lossy Counter Machines},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {129:1--129:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.129},
doi = {10.4230/LIPICS.ICALP.2019.129},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Schmitz19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/JancarS19,
author = {Petr Jancar and
Sylvain Schmitz},
title = {Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete},
booktitle = {34th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2019, Vancouver, BC, Canada, June 24-27, 2019},
pages = {1--12},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/LICS.2019.8785848},
doi = {10.1109/LICS.2019.8785848},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/JancarS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/LerouxS19,
author = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Schmitz},
title = {Reachability in Vector Addition Systems is Primitive-Recursive in
Fixed Dimension},
booktitle = {34th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2019, Vancouver, BC, Canada, June 24-27, 2019},
pages = {1--13},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/LICS.2019.8785796},
doi = {10.1109/LICS.2019.8785796},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/LerouxS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/BaeldeLS19,
author = {David Baelde and
Anthony Lick and
Sylvain Schmitz},
editor = {Dan Suciu and
Sebastian Skritek and
Christoph Koch},
title = {Decidable XPath Fragments in the Real World},
booktitle = {Proceedings of the 38th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2019, Amsterdam, The Netherlands, June
30 - July 5, 2019},
pages = {285--302},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3294052.3319685},
doi = {10.1145/3294052.3319685},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/BaeldeLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rp/SchmitzZ19,
author = {Sylvain Schmitz and
Georg Zetzsche},
editor = {Emmanuel Filiot and
Rapha{\"{e}}l M. Jungers and
Igor Potapov},
title = {Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition
Systems with Resets},
booktitle = {Reachability Problems - 13th International Conference, {RP} 2019,
Brussels, Belgium, September 11-13, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11674},
pages = {193--201},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30806-3\_15},
doi = {10.1007/978-3-030-30806-3\_15},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/rp/SchmitzZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-07170,
author = {Petr Jancar and
Sylvain Schmitz},
title = {Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete},
journal = {CoRR},
volume = {abs/1901.07170},
year = {2019},
url = {http://arxiv.org/abs/1901.07170},
eprinttype = {arXiv},
eprint = {1901.07170},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-07170.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-08575,
author = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Schmitz},
title = {Reachability in Vector Addition Systems is Primitive-Recursive in
Fixed Dimension},
journal = {CoRR},
volume = {abs/1903.08575},
year = {2019},
url = {http://arxiv.org/abs/1903.08575},
eprinttype = {arXiv},
eprint = {1903.08575},
timestamp = {Mon, 01 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-08575.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-07069,
author = {Sylvain Schmitz and
Georg Zetzsche},
title = {Coverability is Undecidable in One-dimensional Pushdown Vector Addition
Systems with Resets},
journal = {CoRR},
volume = {abs/1906.07069},
year = {2019},
url = {http://arxiv.org/abs/1906.07069},
eprinttype = {arXiv},
eprint = {1906.07069},
timestamp = {Mon, 24 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-07069.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/BerardHSS18,
author = {B{\'{e}}atrice B{\'{e}}rard and
Stefan Haar and
Sylvain Schmitz and
Stefan Schwoon},
title = {The Complexity of Diagnosability and Opacity Verification for Petri
Nets},
journal = {Fundam. Informaticae},
volume = {161},
number = {4},
pages = {317--349},
year = {2018},
url = {https://doi.org/10.3233/FI-2018-1706},
doi = {10.3233/FI-2018-1706},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/BerardHSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aiml/BaeldeLS18,
author = {David Baelde and
Anthony Lick and
Sylvain Schmitz},
editor = {Guram Bezhanishvili and
Giovanna D'Agostino and
George Metcalfe and
Thomas Studer},
title = {A Hypersequent Calculus with Clusters for Linear Frames},
booktitle = {Advances in Modal Logic 12, proceedings of the 12th conference on
"Advances in Modal Logic," held in Bern, Switzerland, August 27-31,
2018},
pages = {43--62},
publisher = {College Publications},
year = {2018},
url = {http://www.aiml.net/volumes/volume12/Baelde-Lick-Schmitz.pdf},
timestamp = {Tue, 16 Jan 2024 17:18:03 +0100},
biburl = {https://dblp.org/rec/conf/aiml/BaeldeLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BaeldeLS18,
author = {David Baelde and
Anthony Lick and
Sylvain Schmitz},
editor = {Sumit Ganguly and
Paritosh K. Pandya},
title = {A Hypersequent Calculus with Clusters for Tense Logic over Ordinals},
booktitle = {38th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2018, December 11-13, 2018,
Ahmedabad, India},
series = {LIPIcs},
volume = {122},
pages = {15:1--15:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2018.15},
doi = {10.4230/LIPICS.FSTTCS.2018.15},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BaeldeLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/hal/Schmitz17,
author = {Sylvain Schmitz},
title = {Algorithmic Complexity of Well-Quasi-Orders. (Complexit{\'{e}}
algorithmique des beaux pr{\'{e}}-ordres)},
year = {2017},
url = {https://tel.archives-ouvertes.fr/tel-01663266},
timestamp = {Wed, 10 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/hal/Schmitz17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apn/BerardHSS17,
author = {B{\'{e}}atrice B{\'{e}}rard and
Stefan Haar and
Sylvain Schmitz and
Stefan Schwoon},
editor = {Wil M. P. van der Aalst and
Eike Best},
title = {The Complexity of Diagnosability and Opacity Verification for Petri
Nets},
booktitle = {Application and Theory of Petri Nets and Concurrency - 38th International
Conference, {PETRI} {NETS} 2017, Zaragoza, Spain, June 25-30, 2017,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10258},
pages = {200--220},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57861-3\_13},
doi = {10.1007/978-3-319-57861-3\_13},
timestamp = {Wed, 25 Sep 2019 18:08:03 +0200},
biburl = {https://dblp.org/rec/conf/apn/BerardHSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ColcombetJLS17,
author = {Thomas Colcombet and
Marcin Jurdzinski and
Ranko Lazic and
Sylvain Schmitz},
title = {Perfect half space games},
booktitle = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2017, Reykjavik, Iceland, June 20-23, 2017},
pages = {1--11},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/LICS.2017.8005105},
doi = {10.1109/LICS.2017.8005105},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/ColcombetJLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ColcombetJLS17,
author = {Thomas Colcombet and
Marcin Jurdzinski and
Ranko Lazic and
Sylvain Schmitz},
title = {Perfect Half Space Games},
journal = {CoRR},
volume = {abs/1704.05626},
year = {2017},
url = {http://arxiv.org/abs/1704.05626},
eprinttype = {arXiv},
eprint = {1704.05626},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ColcombetJLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Schmitz16,
author = {Sylvain Schmitz},
title = {Implicational Relevance Logic is 2-EXPTIME-Complete},
journal = {J. Symb. Log.},
volume = {81},
number = {2},
pages = {641--661},
year = {2016},
url = {https://doi.org/10.1017/jsl.2015.7},
doi = {10.1017/JSL.2015.7},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Schmitz16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Schmitz16,
author = {Sylvain Schmitz},
title = {The complexity of reachability in vector addition systems},
journal = {{ACM} {SIGLOG} News},
volume = {3},
number = {1},
pages = {4--21},
year = {2016},
url = {https://doi.org/10.1145/2893582.2893585},
doi = {10.1145/2893582.2893585},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siglog/Schmitz16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChambartFS16,
author = {Pierre Chambart and
Alain Finkel and
Sylvain Schmitz},
title = {Forward analysis and model checking for trace bounded {WSTS}},
journal = {Theor. Comput. Sci.},
volume = {637},
pages = {1--29},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.04.020},
doi = {10.1016/J.TCS.2016.04.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChambartFS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/Schmitz16,
author = {Sylvain Schmitz},
title = {Complexity Hierarchies beyond Elementary},
journal = {{ACM} Trans. Comput. Theory},
volume = {8},
number = {1},
pages = {3:1--3:36},
year = {2016},
url = {https://doi.org/10.1145/2858784},
doi = {10.1145/2858784},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/Schmitz16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/BaeldeLS16,
author = {David Baelde and
Simon Lunel and
Sylvain Schmitz},
editor = {Jean{-}Marc Talbot and
Laurent Regnier},
title = {A Sequent Calculus for a Modal Logic on Finite Data Trees},
booktitle = {25th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2016,
August 29 - September 1, 2016, Marseille, France},
series = {LIPIcs},
volume = {62},
pages = {32:1--32:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CSL.2016.32},
doi = {10.4230/LIPICS.CSL.2016.32},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/csl/BaeldeLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fossacs/HofmanLLLST16,
author = {Piotr Hofman and
Slawomir Lasota and
Ranko Lazic and
J{\'{e}}r{\^{o}}me Leroux and
Sylvain Schmitz and
Patrick Totzke},
editor = {Bart Jacobs and
Christof L{\"{o}}ding},
title = {Coverability Trees for Petri Nets with Unordered Data},
booktitle = {Foundations of Software Science and Computation Structures - 19th
International Conference, {FOSSACS} 2016, Held as Part of the European
Joint Conferences on Theory and Practice of Software, {ETAPS} 2016,
Eindhoven, The Netherlands, April 2-8, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9634},
pages = {445--461},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49630-5\_26},
doi = {10.1007/978-3-662-49630-5\_26},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fossacs/HofmanLLLST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Goubault-Larrecq16,
author = {Jean Goubault{-}Larrecq and
Sylvain Schmitz},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Deciding Piecewise Testable Separability for Regular Tree Languages},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {97:1--97:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.97},
doi = {10.4230/LIPICS.ICALP.2016.97},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Goubault-Larrecq16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/LazicS16,
author = {Ranko Lazic and
Sylvain Schmitz},
editor = {Martin Grohe and
Eric Koskinen and
Natarajan Shankar},
title = {The Complexity of Coverability in {\(\nu\)}-Petri Nets},
booktitle = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer
Science, {LICS} '16, New York, NY, USA, July 5-8, 2016},
pages = {467--476},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933575.2933593},
doi = {10.1145/2933575.2933593},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/LazicS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LerouxS16,
author = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Schmitz},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Ideal Decompositions for Vector Addition Systems (Invited Talk)},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {1:1--1:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.1},
doi = {10.4230/LIPICS.STACS.2016.1},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/LerouxS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/LazicS15,
author = {Ranko Lazic and
Sylvain Schmitz},
title = {Nonelementary Complexities for Branching VASS, MELL, and Extensions},
journal = {{ACM} Trans. Comput. Log.},
volume = {16},
number = {3},
pages = {20:1--20:30},
year = {2015},
url = {https://doi.org/10.1145/2733375},
doi = {10.1145/2733375},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/LazicS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JurdzinskiLS15,
author = {Marcin Jurdzinski and
Ranko Lazic and
Sylvain Schmitz},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9135},
pages = {260--272},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47666-6\_21},
doi = {10.1007/978-3-662-47666-6\_21},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/JurdzinskiLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/LerouxS15,
author = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Schmitz},
title = {Demystifying Reachability in Vector Addition Systems},
booktitle = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2015, Kyoto, Japan, July 6-10, 2015},
pages = {56--67},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/LICS.2015.16},
doi = {10.1109/LICS.2015.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/LerouxS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rp/LazicS15,
author = {Ranko Lazic and
Sylvain Schmitz},
editor = {Mikolaj Bojanczyk and
Slawomir Lasota and
Igor Potapov},
title = {The Ideal View on Rackoff's Coverability Technique},
booktitle = {Reachability Problems - 9th International Workshop, {RP} 2015, Warsaw,
Poland, September 21-23, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9328},
pages = {76--88},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-24537-9\_8},
doi = {10.1007/978-3-319-24537-9\_8},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/rp/LazicS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JurdzinskiLS15,
author = {Marcin Jurdzinski and
Ranko Lazic and
Sylvain Schmitz},
title = {Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time},
journal = {CoRR},
volume = {abs/1502.06875},
year = {2015},
url = {http://arxiv.org/abs/1502.06875},
eprinttype = {arXiv},
eprint = {1502.06875},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JurdzinskiLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LerouxS15,
author = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Schmitz},
title = {Reachability in Vector Addition Systems Demystified},
journal = {CoRR},
volume = {abs/1503.00745},
year = {2015},
url = {http://arxiv.org/abs/1503.00745},
eprinttype = {arXiv},
eprint = {1503.00745},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LerouxS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-5500,
author = {Christoph Haase and
Sylvain Schmitz and
Philippe Schnoebelen},
title = {The Power of Priority Channel Systems},
journal = {Log. Methods Comput. Sci.},
volume = {10},
number = {4},
year = {2014},
url = {https://doi.org/10.2168/LMCS-10(4:4)2014},
doi = {10.2168/LMCS-10(4:4)2014},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-5500.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/LazicS14,
author = {Ranko Lazic and
Sylvain Schmitz},
editor = {Thomas A. Henzinger and
Dale Miller},
title = {Non-elementary complexities for branching VASS, MELL, and extensions},
booktitle = {Joint Meeting of the Twenty-Third {EACSL} Annual Conference on Computer
Science Logic {(CSL)} and the Twenty-Ninth Annual {ACM/IEEE} Symposium
on Logic in Computer Science (LICS), {CSL-LICS} '14, Vienna, Austria,
July 14 - 18, 2014},
pages = {61:1--61:10},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2603088.2603129},
doi = {10.1145/2603088.2603129},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csl/LazicS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CourtoisS14,
author = {Jean{-}Baptiste Courtois and
Sylvain Schmitz},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Alternating Vector Addition Systems with States},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {8634},
pages = {220--231},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44522-8\_19},
doi = {10.1007/978-3-662-44522-8\_19},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CourtoisS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rp/Schmitz14,
author = {Sylvain Schmitz},
editor = {Jo{\"{e}}l Ouaknine and
Igor Potapov and
James Worrell},
title = {Complexity Bounds for Ordinal-Based Termination - (Invited Talk)},
booktitle = {Reachability Problems - 8th International Workshop, {RP} 2014, Oxford,
UK, September 22-24, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8762},
pages = {1--19},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-11439-2\_1},
doi = {10.1007/978-3-319-11439-2\_1},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/rp/Schmitz14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rta/Schmitz14,
author = {Sylvain Schmitz},
editor = {Gilles Dowek},
title = {Implicational Relevance Logic is 2-ExpTime-Complete},
booktitle = {Rewriting and Typed Lambda Calculi - Joint International Conference,
{RTA-TLCA} 2014, Held as Part of the Vienna Summer of Logic, {VSL}
2014, Vienna, Austria, July 14-17, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8560},
pages = {395--409},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08918-8\_27},
doi = {10.1007/978-3-319-08918-8\_27},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/rta/Schmitz14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LazicS14,
author = {Ranko Lazic and
Sylvain Schmitz},
title = {Non-Elementary Complexities for Branching VASS, MELL, and Extensions},
journal = {CoRR},
volume = {abs/1401.6785},
year = {2014},
url = {http://arxiv.org/abs/1401.6785},
eprinttype = {arXiv},
eprint = {1401.6785},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LazicS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Schmitz14,
author = {Sylvain Schmitz},
title = {Implicational Relevance Logic is 2-EXPTIME-Complete},
journal = {CoRR},
volume = {abs/1402.0705},
year = {2014},
url = {http://arxiv.org/abs/1402.0705},
eprinttype = {arXiv},
eprint = {1402.0705},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Schmitz14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SchmitzS14,
author = {Sylvain Schmitz and
Philippe Schnoebelen},
title = {The Power of Well-Structured Systems},
journal = {CoRR},
volume = {abs/1402.2908},
year = {2014},
url = {http://arxiv.org/abs/1402.2908},
eprinttype = {arXiv},
eprint = {1402.2908},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SchmitzS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Schmitz14a,
author = {Sylvain Schmitz},
title = {Complexity Bounds for Ordinal-Based Termination},
journal = {CoRR},
volume = {abs/1407.5896},
year = {2014},
url = {http://arxiv.org/abs/1407.5896},
eprinttype = {arXiv},
eprint = {1407.5896},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Schmitz14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cc/BertschNS13,
author = {Eberhard Bertsch and
Mark{-}Jan Nederhof and
Sylvain Schmitz},
editor = {Ranjit Jhala and
Koen De Bosschere},
title = {On {LR} Parsing with Selective Delays},
booktitle = {Compiler Construction - 22nd International Conference, {CC} 2013,
Held as Part of the European Joint Conferences on Theory and Practice
of Software, {ETAPS} 2013, Rome, Italy, March 16-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7791},
pages = {244--263},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-37051-9\_13},
doi = {10.1007/978-3-642-37051-9\_13},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/cc/BertschNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/SchmitzS13,
author = {Sylvain Schmitz and
Philippe Schnoebelen},
editor = {Pedro R. D'Argenio and
Hern{\'{a}}n C. Melgratti},
title = {The Power of Well-Structured Systems},
booktitle = {{CONCUR} 2013 - Concurrency Theory - 24th International Conference,
{CONCUR} 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8052},
pages = {5--24},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40184-8\_2},
doi = {10.1007/978-3-642-40184-8\_2},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/concur/SchmitzS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/HaaseSS13,
author = {Christoph Haase and
Sylvain Schmitz and
Philippe Schnoebelen},
editor = {Pedro R. D'Argenio and
Hern{\'{a}}n C. Melgratti},
title = {The Power of Priority Channel Systems},
booktitle = {{CONCUR} 2013 - Concurrency Theory - 24th International Conference,
{CONCUR} 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8052},
pages = {319--333},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40184-8\_23},
doi = {10.1007/978-3-642-40184-8\_23},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/HaaseSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fossacs/KarandikarS13,
author = {Prateek Karandikar and
Sylvain Schmitz},
editor = {Frank Pfenning},
title = {The Parametric Ordinal-Recursive Complexity of Post Embedding Problems},
booktitle = {Foundations of Software Science and Computation Structures - 16th
International Conference, {FOSSACS} 2013, Held as Part of the European
Joint Conferences on Theory and Practice of Software, {ETAPS} 2013,
Rome, Italy, March 16-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7794},
pages = {273--288},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-37075-5\_18},
doi = {10.1007/978-3-642-37075-5\_18},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/fossacs/KarandikarS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BoralS13,
author = {Anudhyan Boral and
Sylvain Schmitz},
title = {Model-Checking Parse Trees},
booktitle = {28th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2013, New Orleans, LA, USA, June 25-28, 2013},
pages = {153--162},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/LICS.2013.21},
doi = {10.1109/LICS.2013.21},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/BoralS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Schmitz13,
author = {Sylvain Schmitz},
title = {Complexity Hierarchies Beyond Elementary},
journal = {CoRR},
volume = {abs/1312.5686},
year = {2013},
url = {http://arxiv.org/abs/1312.5686},
eprinttype = {arXiv},
eprint = {1312.5686},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Schmitz13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/HaddadSS12,
author = {Serge Haddad and
Sylvain Schmitz and
Philippe Schnoebelen},
title = {The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets,
and Other Enriched Nets},
booktitle = {Proceedings of the 27th Annual {IEEE} Symposium on Logic in Computer
Science, {LICS} 2012, Dubrovnik, Croatia, June 25-28, 2012},
pages = {355--364},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/LICS.2012.46},
doi = {10.1109/LICS.2012.46},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/HaddadSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-5256,
author = {Anudhyan Boral and
Sylvain Schmitz},
title = {{PDL} Model Checking of Parse Forests},
journal = {CoRR},
volume = {abs/1211.5256},
year = {2012},
url = {http://arxiv.org/abs/1211.5256},
eprinttype = {arXiv},
eprint = {1211.5256},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-5256.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-5259,
author = {Prateek Karandikar and
Sylvain Schmitz},
title = {The Parametric Ordinal-Recursive Complexity of Post Embedding Problems},
journal = {CoRR},
volume = {abs/1211.5259},
year = {2012},
url = {http://arxiv.org/abs/1211.5259},
eprinttype = {arXiv},
eprint = {1211.5259},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-5259.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apn/ChambartFS11,
author = {Pierre Chambart and
Alain Finkel and
Sylvain Schmitz},
editor = {Lars Michael Kristensen and
Laure Petrucci},
title = {Forward Analysis and Model Checking for Trace Bounded {WSTS}},
booktitle = {Applications and Theory of Petri Nets - 32nd International Conference,
{PETRI} {NETS} 2011, Newcastle, UK, June 20-24, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6709},
pages = {49--68},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21834-7\_4},
doi = {10.1007/978-3-642-21834-7\_4},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/apn/ChambartFS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsmnlp/Schmitz11,
author = {Sylvain Schmitz},
editor = {Matthieu Constant and
Andreas Maletti and
Agata Savary},
title = {A Note on Sequential Rule-Based {POS} Tagging},
booktitle = {Finite-State Methods and Natural Language Processing, 9th International
Workshop, {FSMNLP} 2010, Bois, France, July 12-16, 2011},
series = {{ACL} Anthology},
pages = {83--87},
publisher = {Association for Computational Linguistics},
year = {2011},
url = {https://aclanthology.org/W11-4411/},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsmnlp/Schmitz11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/SchmitzS11,
author = {Sylvain Schmitz and
Philippe Schnoebelen},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Multiply-Recursive Upper Bounds with Higman's Lemma},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6756},
pages = {441--452},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22012-8\_35},
doi = {10.1007/978-3-642-22012-8\_35},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/SchmitzS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/FigueiraFSS11,
author = {Diego Figueira and
Santiago Figueira and
Sylvain Schmitz and
Philippe Schnoebelen},
title = {Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma},
booktitle = {Proceedings of the 26th Annual {IEEE} Symposium on Logic in Computer
Science, {LICS} 2011, June 21-24, 2011, Toronto, Ontario, Canada},
pages = {269--278},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/LICS.2011.39},
doi = {10.1109/LICS.2011.39},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/FigueiraFSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ltconf/Gardent0PS11,
author = {Claire Gardent and
Yannick Parmentier and
Guy Perrier and
Sylvain Schmitz},
editor = {Zygmunt Vetulani and
Joseph Mariani},
title = {Lexical Disambiguation in {LTAG} Using Left Context},
booktitle = {Human Language Technology Challenges for Computer Science and Linguistics
- 5th Language and Technology Conference, {LTC} 2011, Pozna{\'{n}},
Poland, November 25-27, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8387},
pages = {67--79},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-319-08958-4\_6},
doi = {10.1007/978-3-319-08958-4\_6},
timestamp = {Mon, 03 Jan 2022 22:14:27 +0100},
biburl = {https://dblp.org/rec/conf/ltconf/Gardent0PS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BlockeletS11,
author = {Michel Blockelet and
Sylvain Schmitz},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Model Checking Coverability Graphs of Vector Addition Systems},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {108--119},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_13},
doi = {10.1007/978-3-642-22993-0\_13},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BlockeletS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-4399,
author = {Sylvain Schmitz and
Philippe Schnoebelen},
title = {Multiply-Recursive Upper Bounds with Higman's Lemma},
journal = {CoRR},
volume = {abs/1103.4399},
year = {2011},
url = {http://arxiv.org/abs/1103.4399},
eprinttype = {arXiv},
eprint = {1103.4399},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-4399.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scp/Schmitz10,
author = {Sylvain Schmitz},
title = {An experimental ambiguity detection tool},
journal = {Sci. Comput. Program.},
volume = {75},
number = {1-2},
pages = {71--84},
year = {2010},
url = {https://doi.org/10.1016/j.scico.2009.07.002},
doi = {10.1016/J.SCICO.2009.07.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scp/Schmitz10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeamNS10,
author = {Pierre{-}Cyrille H{\'{e}}am and
Cyril Nicaud and
Sylvain Schmitz},
title = {Parametric random generation of deterministic tree automata},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {38-39},
pages = {3469--3480},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.05.036},
doi = {10.1016/J.TCS.2010.05.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HeamNS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acl/Schmitz10,
author = {Sylvain Schmitz},
editor = {Jan Hajic and
Sandra Carberry and
Stephen Clark},
title = {On the Computational Complexity of Dominance Links in Grammatical
Formalisms},
booktitle = {{ACL} 2010, Proceedings of the 48th Annual Meeting of the Association
for Computational Linguistics, July 11-16, 2010, Uppsala, Sweden},
pages = {514--524},
publisher = {The Association for Computer Linguistics},
year = {2010},
url = {https://aclanthology.org/P10-1053/},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acl/Schmitz10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-2802,
author = {Pierre Chambart and
Alain Finkel and
Sylvain Schmitz},
title = {Forward Analysis and Model Checking for Bounded {WSTS}},
journal = {CoRR},
volume = {abs/1004.2802},
year = {2010},
url = {http://arxiv.org/abs/1004.2802},
eprinttype = {arXiv},
eprint = {1004.2802},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-2802.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-2989,
author = {Diego Figueira and
Santiago Figueira and
Sylvain Schmitz and
Philippe Schnoebelen},
title = {Ackermann and Primitive-Recursive Bounds with Dickson's Lemma},
journal = {CoRR},
volume = {abs/1007.2989},
year = {2010},
url = {http://arxiv.org/abs/1007.2989},
eprinttype = {arXiv},
eprint = {1007.2989},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-2989.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wia/HeamNS09,
author = {Pierre{-}Cyrille H{\'{e}}am and
Cyril Nicaud and
Sylvain Schmitz},
editor = {Sebastian Maneth},
title = {Random Generation of Deterministic Tree (Walking) Automata},
booktitle = {Implementation and Application of Automata, 14th International Conference,
{CIAA} 2009, Sydney, Australia, July 14-17, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5642},
pages = {115--124},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02979-0\_15},
doi = {10.1007/978-3-642-02979-0\_15},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/wia/HeamNS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tag/SchmitzR08,
author = {Sylvain Schmitz and
Joseph Le Roux},
editor = {Claire Gardent and
Anoop Sarkar},
title = {Feature Unification in {TAG} Derivation Trees},
booktitle = {Proceedings of the Ninth International Workshop on Tree Adjoining
Grammar and Related Frameworks, {TAG+} 2010 , T{\"{u}}bingen,
Germany, June 6-8, 2008},
pages = {141--148},
publisher = {Association for Computational Linguistics},
year = {2008},
url = {https://aclanthology.org/W08-2319/},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tag/SchmitzR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/taln/SchmitzR08,
author = {Sylvain Schmitz and
Joseph Le Roux},
editor = {Fr{\'{e}}d{\'{e}}ric B{\'{e}}chet and
Jean{-}Fran{\c{c}}ois Bonastre},
title = {Calculs d'unification sur les arbres de d{\'{e}}rivation {TAG}},
booktitle = {Actes de la 15{\`{e}}me conf{\'{e}}rence sur le Traitement Automatique
des Langues Naturelles. Articles courts, {TALN} 2008, Avignon, France,
June 2008},
pages = {11--20},
publisher = {{ATALA}},
year = {2008},
url = {https://aclanthology.org/2008.jeptalnrecital-court.2/},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/taln/SchmitzR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0804-4584,
author = {Sylvain Schmitz and
Joseph Le Roux},
title = {Feature Unification in {TAG} Derivation Trees},
journal = {CoRR},
volume = {abs/0804.4584},
year = {2008},
url = {http://arxiv.org/abs/0804.4584},
eprinttype = {arXiv},
eprint = {0804.4584},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0804-4584.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/hal/Schmitz07,
author = {Sylvain Schmitz},
title = {Approximating Context-Free Grammars for Parsing and Verification.
(Approximation de grammaires alg{\'{e}}briques pour l'analyse
syntaxique et la v{\'{e}}rification)},
school = {University of Nice Sophia Antipolis, France},
year = {2007},
url = {https://tel.archives-ouvertes.fr/tel-00271168},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/hal/Schmitz07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Schmitz07,
author = {Sylvain Schmitz},
editor = {Lars Arge and
Christian Cachin and
Tomasz Jurdzinski and
Andrzej Tarlecki},
title = {Conservative Ambiguity Detection in Context-Free Grammars},
booktitle = {Automata, Languages and Programming, 34th International Colloquium,
{ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4596},
pages = {692--703},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73420-8\_60},
doi = {10.1007/978-3-540-73420-8\_60},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Schmitz07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/Schmitz08,
author = {Sylvain Schmitz},
editor = {Anthony Sloane and
Adrian Johnstone},
title = {An Experimental Ambiguity Detection Tool},
booktitle = {Proceedings of the Seventh Workshop on Language Descriptions, Tools,
and Applications, LDTA@ETAPS 2007, Braga, Portugal, March 25, 2007},
series = {Electronic Notes in Theoretical Computer Science},
volume = {203},
number = {2},
pages = {69--84},
publisher = {Elsevier},
year = {2007},
url = {https://doi.org/10.1016/j.entcs.2008.03.045},
doi = {10.1016/J.ENTCS.2008.03.045},
timestamp = {Mon, 13 Feb 2023 11:46:05 +0100},
biburl = {https://dblp.org/rec/journals/entcs/Schmitz08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/Schmitz06,
author = {Sylvain Schmitz},
editor = {Oscar H. Ibarra and
Zhe Dang},
title = {Noncanonical {LALR(1)} Parsing},
booktitle = {Developments in Language Theory, 10th International Conference, {DLT}
2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4036},
pages = {95--107},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11779148\_10},
doi = {10.1007/11779148\_10},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/Schmitz06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wia/GalvezSF06,
author = {Jos{\'{e}} Fortes G{\'{a}}lvez and
Sylvain Schmitz and
Jacques Farr{\'{e}}},
editor = {Oscar H. Ibarra and
Hsu{-}Chun Yen},
title = {Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time},
booktitle = {Implementation and Application of Automata, 11th International Conference,
{CIAA} 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4094},
pages = {253--264},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11812128\_24},
doi = {10.1007/11812128\_24},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/wia/GalvezSF06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wia/2005,
editor = {Jacques Farr{\'{e}} and
Igor Litovsky and
Sylvain Schmitz},
title = {Implementation and Application of Automata, 10th International Conference,
{CIAA} 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3845},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11605157},
doi = {10.1007/11605157},
isbn = {3-540-31023-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wia/2005.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-01-19 20:29 CET 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:
