Sylvain Schmitz

According to our database, Sylvain Schmitz authored at least 58 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2023

Measuring well quasi-ordered finitary powersets.

Sergio Abriola, Simon Halfon, Aliaume Lopez, Sylvain Schmitz, Philippe Schnoebelen, Isa Vialard

CoRR, 2023

On the Length of Strongly Monotone Descending Chains over N^d.

Sylvain Schmitz, Lia Schütze

CoRR, 2023

Games on Graphs.

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

CoRR, 2023

2022

Preface.

Paul C. Bell, Igor Potapov, Sylvain Schmitz, Patrick Totzke

Fundam. Informaticae, 2022

On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices.

Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, James Worrell

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021

The ideal view on Rackoff's coverability technique.

Ranko Lazic, Sylvain Schmitz

Inf. Comput., 2021

Branching in Well-Structured Transition Systems (Invited Talk).

Sylvain Schmitz

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2019

Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets.

Sylvain Schmitz, Georg Zetzsche

Proceedings of the Reachability Problems - 13th International Conference, 2019

Decidable XPath Fragments in the Real World.

David Baelde, Anthony Lick, Sylvain Schmitz

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension.

Jérôme Leroux, Sylvain Schmitz

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete.

Petr Jancar, Sylvain Schmitz

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

The Parametric Complexity of Lossy Counter Machines.

Sylvain Schmitz

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

The Complexity of Diagnosability and Opacity Verification for Petri Nets.

Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon

Fundam. Informaticae, 2018

A Hypersequent Calculus with Clusters for Tense Logic over Ordinals.

David Baelde, Anthony Lick, Sylvain Schmitz

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

A Hypersequent Calculus with Clusters for Linear Frames.

David Baelde, Anthony Lick, Sylvain Schmitz

Proceedings of the Advances in Modal Logic 12, 2018

2017

Perfect half space games.

Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Algorithmic Complexity of Well-Quasi-Orders. (Complexité algorithmique des beaux pré-ordres).

Sylvain Schmitz

, 2017

2016

Complexity Hierarchies beyond Elementary.

Sylvain Schmitz

ACM Trans. Comput. Theory, 2016

Forward analysis and model checking for trace bounded WSTS.

Pierre Chambart, Alain Finkel, Sylvain Schmitz

Theor. Comput. Sci., 2016

The complexity of reachability in vector addition systems.

Sylvain Schmitz

ACM SIGLOG News, 2016

Implicational Relevance Logic is 2-EXPTIME-Complete.

Sylvain Schmitz

J. Symb. Log., 2016

Ideal Decompositions for Vector Addition Systems (Invited Talk).

Jérôme Leroux, Sylvain Schmitz

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

The Complexity of Coverability in ν-Petri Nets.

Ranko Lazic, Sylvain Schmitz

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Deciding Piecewise Testable Separability for Regular Tree Languages.

Jean Goubault-Larrecq, Sylvain Schmitz

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Coverability Trees for Petri Nets with Unordered Data.

Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke

Proceedings of the Foundations of Software Science and Computation Structures, 2016

A Sequent Calculus for a Modal Logic on Finite Data Trees.

David Baelde, Simon Lunel, Sylvain Schmitz

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

Nonelementary Complexities for Branching VASS, MELL, and Extensions.

Ranko Lazic, Sylvain Schmitz

ACM Trans. Comput. Log., 2015

Reachability in Vector Addition Systems Demystified.

Jérôme Leroux, Sylvain Schmitz

CoRR, 2015

Demystifying Reachability in Vector Addition Systems.

Jérôme Leroux, Sylvain Schmitz

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time.

Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

The Power of Priority Channel Systems

Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen

Log. Methods Comput. Sci., 2014

Complexity Bounds for Ordinal-Based Termination.

Sylvain Schmitz

CoRR, 2014

Complexity Bounds for Ordinal-Based Termination - (Invited Talk).

Sylvain Schmitz

Proceedings of the Reachability Problems - 8th International Workshop, 2014

Alternating Vector Addition Systems with States.

Jean-Baptiste Courtois, Sylvain Schmitz

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Non-elementary complexities for branching VASS, MELL, and extensions.

Ranko Lazic, Sylvain Schmitz

Proceedings of the 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), 2014

2013

Model-Checking Parse Trees.

Anudhyan Boral, Sylvain Schmitz

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

The Parametric Ordinal-Recursive Complexity of Post Embedding Problems.

Prateek Karandikar, Sylvain Schmitz

Proceedings of the Foundations of Software Science and Computation Structures, 2013

The Power of Well-Structured Systems.

Sylvain Schmitz, Philippe Schnoebelen

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

On LR Parsing with Selective Delays.

Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz

Proceedings of the Compiler Construction - 22nd International Conference, 2013

2012

PDL Model Checking of Parse Forests

Anudhyan Boral, Sylvain Schmitz

CoRR, 2012

The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets.

Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011

Model Checking Coverability Graphs of Vector Addition Systems.

Michel Blockelet, Sylvain Schmitz

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Lexical Disambiguation in LTAG Using Left Context.

Claire Gardent, Yannick Parmentier, Guy Perrier, Sylvain Schmitz

Proceedings of the Human Language Technology Challenges for Computer Science and Linguistics, 2011

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma.

Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Multiply-Recursive Upper Bounds with Higman's Lemma.

Sylvain Schmitz, Philippe Schnoebelen

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

A Note on Sequential Rule-Based POS Tagging.

Sylvain Schmitz

Proceedings of the Finite-State Methods and Natural Language Processing, 2011

2010

Parametric random generation of deterministic tree automata.

Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz

Theor. Comput. Sci., 2010

Ackermann and Primitive-Recursive Bounds with Dickson's Lemma

Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen

CoRR, 2010

Forward Analysis and Model Checking for Bounded WSTS

Pierre Chambart, Alain Finkel, Sylvain Schmitz

CoRR, 2010

On the Computational Complexity of Dominance Links in Grammatical Formalisms.

Sylvain Schmitz

Proceedings of the ACL 2010, 2010

2009

Random Generation of Deterministic Tree (Walking) Automata.

Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz

Proceedings of the Implementation and Application of Automata, 2009

2008

Calculs d'unification sur les arbres de dérivation TAG.

Sylvain Schmitz, Joseph Le Roux

Proceedings of the Actes de la 15ème conférence sur le Traitement Automatique des Langues Naturelles. Articles courts, 2008

Feature Unification in TAG Derivation Trees.

Sylvain Schmitz, Joseph Le Roux

Proceedings of the Ninth International Workshop on Tree Adjoining Grammar and Related Frameworks, 2008

2007

Approximating Context-Free Grammars for Parsing and Verification. (Approximation de grammaires algébriques pour l'analyse syntaxique et la vérification).

Sylvain Schmitz

PhD thesis, 2007

An Experimental Ambiguity Detection Tool.

Sylvain Schmitz

Proceedings of the Seventh Workshop on Language Descriptions, Tools, and Applications, 2007

Conservative Ambiguity Detection in Context-Free Grammars.

Sylvain Schmitz

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time.

José Fortes Gálvez, Sylvain Schmitz, Jacques Farré

Proceedings of the Implementation and Application of Automata, 2006

Noncanonical LALR(1) Parsing.

Sylvain Schmitz

Proceedings of the Developments in Language Theory, 10th International Conference, 2006