default search action
Sylvain Schmitz
Person information
- affiliation: Université Paris Cité, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c45]Sylvain Schmitz, Lia Schütze:
On the Length of Strongly Monotone Descending Chains over ℕ^d. ICALP 2024: 153:1-153:19 - [c44]Ashwani Anand
, Sylvain Schmitz
Verifying Unboundedness via Amalgamation. LICS 2024: 4:1-4:15 - [i21]Ashwani Anand, Sylvain Schmitz, Lia Schütze, Georg Zetzsche:
Verifying Unboundedness via Amalgamation. CoRR abs/2405.10296 (2024) - 2023
- [i20]Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra:
Games on Graphs. CoRR abs/2305.10546 (2023) - [i19]Sylvain Schmitz, Lia Schütze:
On the Length of Strongly Monotone Descending Chains over Nd. CoRR abs/2310.02847 (2023) - [i18]Sergio Abriola, Simon Halfon, Aliaume Lopez, Sylvain Schmitz, Philippe Schnoebelen, Isa Vialard:
Measuring well quasi-ordered finitary powersets. CoRR abs/2312.14587 (2023) - 2022
- [j11]Paul C. Bell, Igor Potapov, Sylvain Schmitz, Patrick Totzke
Preface. Fundam. Informaticae 189(3-4) (2022) - [c43]Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, James Worrell:
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices. ISSAC 2022: 129-138 - 2021
- [j10]Ranko Lazic, Sylvain Schmitz
The ideal view on Rackoff's coverability technique. Inf. Comput. 277: 104582 (2021) - [c42]Sylvain Schmitz
Branching in Well-Structured Transition Systems (Invited Talk). CSL 2021: 3:1-3:3 - 2020
- [e2]Sylvain Schmitz, Igor Potapov:
Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings. Lecture Notes in Computer Science 12448, Springer 2020, ISBN 978-3-030-61738-7 [contents]
2010 – 2019
- 2019
- [c41]Sylvain Schmitz
The Parametric Complexity of Lossy Counter Machines. ICALP 2019: 129:1-129:15 - [c40]Petr Jancar
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. LICS 2019: 1-12 - [c39]Jérôme Leroux, Sylvain Schmitz
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. LICS 2019: 1-13 - [c38]David Baelde
Decidable XPath Fragments in the Real World. PODS 2019: 285-302 - [c37]Sylvain Schmitz
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. RP 2019: 193-201 - [i17]Petr Jancar, Sylvain Schmitz:
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. CoRR abs/1901.07170 (2019) - [i16]Jérôme Leroux, Sylvain Schmitz:
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. CoRR abs/1903.08575 (2019) - [i15]Sylvain Schmitz, Georg Zetzsche:
Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets. CoRR abs/1906.07069 (2019) - 2018
- [j9]Béatrice Bérard, Stefan Haar, Sylvain Schmitz
The Complexity of Diagnosability and Opacity Verification for Petri Nets. Fundam. Informaticae 161(4): 317-349 (2018) - [c36]David Baelde, Anthony Lick, Sylvain Schmitz:
A Hypersequent Calculus with Clusters for Linear Frames. Advances in Modal Logic 2018: 43-62 - [c35]David Baelde
A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. FSTTCS 2018: 15:1-15:19 - 2017
- [b2]Sylvain Schmitz:
Algorithmic Complexity of Well-Quasi-Orders. (Complexité algorithmique des beaux pré-ordres). École Normale Supérieure, Paris, France, 2017 - [c34]Béatrice Bérard, Stefan Haar, Sylvain Schmitz
The Complexity of Diagnosability and Opacity Verification for Petri Nets. Petri Nets 2017: 200-220 - [c33]Thomas Colcombet
Perfect half space games. LICS 2017: 1-11 - [i14]Thomas Colcombet
Perfect Half Space Games. CoRR abs/1704.05626 (2017) - 2016
- [j8]Sylvain Schmitz
Implicational Relevance Logic is 2-EXPTIME-Complete. J. Symb. Log. 81(2): 641-661 (2016) - [j7]Sylvain Schmitz:
The complexity of reachability in vector addition systems. ACM SIGLOG News 3(1): 4-21 (2016) - [j6]Pierre Chambart, Alain Finkel
Forward analysis and model checking for trace bounded WSTS. Theor. Comput. Sci. 637: 1-29 (2016) - [j5]Sylvain Schmitz
Complexity Hierarchies beyond Elementary. ACM Trans. Comput. Theory 8(1): 3:1-3:36 (2016) - [c32]David Baelde
A Sequent Calculus for a Modal Logic on Finite Data Trees. CSL 2016: 32:1-32:16 - [c31]Piotr Hofman
Coverability Trees for Petri Nets with Unordered Data. FoSSaCS 2016: 445-461 - [c30]Jean Goubault-Larrecq, Sylvain Schmitz
Deciding Piecewise Testable Separability for Regular Tree Languages. ICALP 2016: 97:1-97:15 - [c29]Ranko Lazic, Sylvain Schmitz
The Complexity of Coverability in ν-Petri Nets. LICS 2016: 467-476 - [c28]Jérôme Leroux, Sylvain Schmitz
Ideal Decompositions for Vector Addition Systems (Invited Talk). STACS 2016: 1:1-1:13 - 2015
- [j4]Ranko Lazic, Sylvain Schmitz
Nonelementary Complexities for Branching VASS, MELL, and Extensions. ACM Trans. Comput. Log. 16(3): 20:1-20:30 (2015) - [c27]Marcin Jurdzinski
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. ICALP (2) 2015: 260-272 - [c26]Jérôme Leroux, Sylvain Schmitz:
Demystifying Reachability in Vector Addition Systems. LICS 2015: 56-67 - [c25]Ranko Lazic, Sylvain Schmitz
The Ideal View on Rackoff's Coverability Technique. RP 2015: 76-88 - [i13]Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz:
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. CoRR abs/1502.06875 (2015) - [i12]Jérôme Leroux, Sylvain Schmitz:
Reachability in Vector Addition Systems Demystified. CoRR abs/1503.00745 (2015) - 2014
- [j3]Christoph Haase
The Power of Priority Channel Systems. Log. Methods Comput. Sci. 10(4) (2014) - [c24]Ranko Lazic, Sylvain Schmitz
Non-elementary complexities for branching VASS, MELL, and extensions. CSL-LICS 2014: 61:1-61:10 - [c23]Jean-Baptiste Courtois, Sylvain Schmitz
Alternating Vector Addition Systems with States. MFCS (1) 2014: 220-231 - [c22]Sylvain Schmitz
Complexity Bounds for Ordinal-Based Termination - (Invited Talk). RP 2014: 1-19 - [c21]Sylvain Schmitz
Implicational Relevance Logic is 2-ExpTime-Complete. RTA-TLCA 2014: 395-409 - [i11]Ranko Lazic, Sylvain Schmitz:
Non-Elementary Complexities for Branching VASS, MELL, and Extensions. CoRR abs/1401.6785 (2014) - [i10]Sylvain Schmitz:
Implicational Relevance Logic is 2-EXPTIME-Complete. CoRR abs/1402.0705 (2014) - [i9]Sylvain Schmitz, Philippe Schnoebelen:
The Power of Well-Structured Systems. CoRR abs/1402.2908 (2014) - [i8]Sylvain Schmitz:
Complexity Bounds for Ordinal-Based Termination. CoRR abs/1407.5896 (2014) - 2013
- [c20]Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz
On LR Parsing with Selective Delays. CC 2013: 244-263 - [c19]Sylvain Schmitz
The Power of Well-Structured Systems. CONCUR 2013: 5-24 - [c18]Christoph Haase
The Power of Priority Channel Systems. CONCUR 2013: 319-333 - [c17]Prateek Karandikar, Sylvain Schmitz
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. FoSSaCS 2013: 273-288 - [c16]Anudhyan Boral, Sylvain Schmitz
Model-Checking Parse Trees. LICS 2013: 153-162 - [i7]Sylvain Schmitz:
Complexity Hierarchies Beyond Elementary. CoRR abs/1312.5686 (2013) - 2012
- [c15]Serge Haddad, Sylvain Schmitz
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets. LICS 2012: 355-364 - [i6]Anudhyan Boral, Sylvain Schmitz:
PDL Model Checking of Parse Forests. CoRR abs/1211.5256 (2012) - [i5]Prateek Karandikar, Sylvain Schmitz:
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. CoRR abs/1211.5259 (2012) - 2011
- [c14]Pierre Chambart, Alain Finkel, Sylvain Schmitz
Forward Analysis and Model Checking for Trace Bounded WSTS. Petri Nets 2011: 49-68 - [c13]Sylvain Schmitz:
A Note on Sequential Rule-Based POS Tagging. FSMNLP 2011: 83-87 - [c12]Sylvain Schmitz, Philippe Schnoebelen:
Multiply-Recursive Upper Bounds with Higman's Lemma. ICALP (2) 2011: 441-452 - [c11]Diego Figueira, Santiago Figueira, Sylvain Schmitz
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. LICS 2011: 269-278 - [c10]Claire Gardent, Yannick Parmentier, Guy Perrier, Sylvain Schmitz
Lexical Disambiguation in LTAG Using Left Context. LTC 2011: 67-79 - [c9]Michel Blockelet, Sylvain Schmitz
Model Checking Coverability Graphs of Vector Addition Systems. MFCS 2011: 108-119 - [i4]Sylvain Schmitz, Philippe Schnoebelen:
Multiply-Recursive Upper Bounds with Higman's Lemma. CoRR abs/1103.4399 (2011) - 2010
- [j2]Sylvain Schmitz
An experimental ambiguity detection tool. Sci. Comput. Program. 75(1-2): 71-84 (2010) - [j1]Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
Parametric random generation of deterministic tree automata. Theor. Comput. Sci. 411(38-39): 3469-3480 (2010) - [c8]Sylvain Schmitz:
On the Computational Complexity of Dominance Links in Grammatical Formalisms. ACL 2010: 514-524 - [i3]Pierre Chambart, Alain Finkel, Sylvain Schmitz:
Forward Analysis and Model Checking for Bounded WSTS. CoRR abs/1004.2802 (2010) - [i2]Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen:
Ackermann and Primitive-Recursive Bounds with Dickson's Lemma. CoRR abs/1007.2989 (2010)
2000 – 2009
- 2009
- [c7]Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
Random Generation of Deterministic Tree (Walking) Automata. CIAA 2009: 115-124 - 2008
- [c6]Sylvain Schmitz, Joseph Le Roux:
Feature Unification in TAG Derivation Trees. TAG 2008: 141-148 - [c5]Sylvain Schmitz, Joseph Le Roux:
Calculs d'unification sur les arbres de dérivation TAG. TALN (Articles courts) 2008: 11-20 - [i1]Sylvain Schmitz, Joseph Le Roux:
Feature Unification in TAG Derivation Trees. CoRR abs/0804.4584 (2008) - 2007
- [b1]Sylvain Schmitz:
Approximating Context-Free Grammars for Parsing and Verification. (Approximation de grammaires algébriques pour l'analyse syntaxique et la vérification). University of Nice Sophia Antipolis, France, 2007 - [c4]Sylvain Schmitz
Conservative Ambiguity Detection in Context-Free Grammars. ICALP 2007: 692-703 - [c3]Sylvain Schmitz
An Experimental Ambiguity Detection Tool. LDTA@ETAPS 2007: 69-84 - 2006
- [c2]Sylvain Schmitz
Noncanonical LALR(1) Parsing. Developments in Language Theory 2006: 95-107 - [c1]José Fortes Gálvez, Sylvain Schmitz
Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time. CIAA 2006: 253-264 - [e1]Jacques Farré, Igor Litovsky, Sylvain Schmitz:
Implementation and Application of Automata, 10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers. Lecture Notes in Computer Science 3845, Springer 2006, ISBN 3-540-31023-1 [contents]
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 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: