Noncanonical LALR(1) Parsing. - Sylvain Schmitz (Developments in Language Theory, 2006)

Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time. - José Fortes Gálvez; Sylvain Schmitz; Jacques Farré (CIAA, 2006)

Conservative Ambiguity Detection in Context-Free Grammars. - Sylvain Schmitz (ICALP, 2007)

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

Feature Unification in TAG Derivation Trees. - Sylvain Schmitz; Joseph Le Roux (TAG, 2008)

Calculs d'unification sur les arbres de dérivation TAG. - Sylvain Schmitz; Joseph Le Roux (TALN (Articles courts), 2008)

Random Generation of Deterministic Tree (Walking) Automata. - Pierre-Cyrille Héam; Cyril Nicaud; Sylvain Schmitz (CIAA, 2009)

On the Computational Complexity of Dominance Links in Grammatical Formalisms. - Sylvain Schmitz (ACL, 2010)

Forward Analysis and Model Checking for Bounded WSTS - Pierre Chambart; Alain Finkel; Sylvain Schmitz (CoRR, 2010)

Ackermann and Primitive-Recursive Bounds with Dickson's Lemma - Diego Figueira; Santiago Figueira; Sylvain Schmitz; Philippe Schnoebelen (CoRR, 2010)

An experimental ambiguity detection tool. - Sylvain Schmitz (Sci. Comput. Program., 2010)

Parametric random generation of deterministic tree automata. - Pierre-Cyrille Héam; Cyril Nicaud; Sylvain Schmitz (Theor. Comput. Sci., 2010)

A Note on Sequential Rule-Based POS Tagging. - Sylvain Schmitz (FSMNLP, 2011)

Multiply-Recursive Upper Bounds with Higman's Lemma. - Sylvain Schmitz; Philippe Schnoebelen (ICALP (2), 2011)

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. - Diego Figueira; Santiago Figueira; Sylvain Schmitz; Philippe Schnoebelen (LICS, 2011)

Lexical Disambiguation in LTAG Using Left Context. - Claire Gardent; Yannick Parmentier 001; Guy Perrier; Sylvain Schmitz (LTC, 2011)

Model Checking Coverability Graphs of Vector Addition Systems. - Michel Blockelet; Sylvain Schmitz (MFCS, 2011)

The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets. - Serge Haddad; Sylvain Schmitz; Philippe Schnoebelen (LICS, 2012)

PDL Model Checking of Parse Forests - Anudhyan Boral; Sylvain Schmitz (CoRR, 2012)

On LR Parsing with Selective Delays. - Eberhard Bertsch; Mark-Jan Nederhof; Sylvain Schmitz (CC, 2013)

The Power of Well-Structured Systems. - Sylvain Schmitz; Philippe Schnoebelen (CONCUR, 2013)

The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. - Prateek Karandikar; Sylvain Schmitz (FoSSaCS, 2013)

Model-Checking Parse Trees. - Anudhyan Boral; Sylvain Schmitz (LICS, 2013)

Non-elementary complexities for branching VASS, MELL, and extensions. - Ranko Lazic 001; Sylvain Schmitz (CSL-LICS, 2014)

Alternating Vector Addition Systems with States. - Jean-Baptiste Courtois; Sylvain Schmitz (MFCS (1), 2014)

Complexity Bounds for Ordinal-Based Termination - (Invited Talk). - Sylvain Schmitz (RP, 2014)

Complexity Bounds for Ordinal-Based Termination. - Sylvain Schmitz (CoRR, 2014)

The Power of Priority Channel Systems - Christoph Haase; Sylvain Schmitz; Philippe Schnoebelen (Log. Methods Comput. Sci., 2014)

Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. - Marcin Jurdzinski; Ranko Lazic 001; Sylvain Schmitz (ICALP (2), 2015)

Demystifying Reachability in Vector Addition Systems. - Jérôme Leroux; Sylvain Schmitz (LICS, 2015)

Reachability in Vector Addition Systems Demystified. - Jérôme Leroux; Sylvain Schmitz (CoRR, 2015)

Nonelementary Complexities for Branching VASS, MELL, and Extensions. - Ranko Lazic 001; Sylvain Schmitz (ACM Trans. Comput. Log., 2015)

A Sequent Calculus for a Modal Logic on Finite Data Trees. - David Baelde; Simon Lunel; Sylvain Schmitz (CSL, 2016)

Coverability Trees for Petri Nets with Unordered Data. - Piotr Hofman; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Sylvain Schmitz; Patrick Totzke (FoSSaCS, 2016)

Deciding Piecewise Testable Separability for Regular Tree Languages. - Jean Goubault-Larrecq; Sylvain Schmitz (ICALP, 2016)

The Complexity of Coverability in ν-Petri Nets. - Ranko Lazic 001; Sylvain Schmitz (LICS, 2016)

Ideal Decompositions for Vector Addition Systems (Invited Talk). - Jérôme Leroux; Sylvain Schmitz (STACS, 2016)

Implicational Relevance Logic is 2-EXPTIME-Complete. - Sylvain Schmitz (J. Symb. Log., 2016)

The complexity of reachability in vector addition systems. - Sylvain Schmitz (ACM SIGLOG News, 2016)

Forward analysis and model checking for trace bounded WSTS. - Pierre Chambart; Alain Finkel; Sylvain Schmitz (Theor. Comput. Sci., 2016)

Complexity Hierarchies beyond Elementary. - Sylvain Schmitz (ACM Trans. Comput. Theory, 2016)

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

Perfect half space games. - Thomas Colcombet; Marcin Jurdzinski; Ranko Lazic 001; Sylvain Schmitz (LICS, 2017)

A Hypersequent Calculus with Clusters for Linear Frames. - David Baelde; Anthony Lick; Sylvain Schmitz (Advances in Modal Logic, 2018)

A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. - David Baelde; Anthony Lick; Sylvain Schmitz (FSTTCS, 2018)

The Complexity of Diagnosability and Opacity Verification for Petri Nets. - Béatrice Bérard; Stefan Haar; Sylvain Schmitz; Stefan Schwoon (Fundam. Informaticae, 2018)

The Parametric Complexity of Lossy Counter Machines. - Sylvain Schmitz (ICALP, 2019)

Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. - Petr Jancar; Sylvain Schmitz (LICS, 2019)

Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. - Jérôme Leroux; Sylvain Schmitz (LICS, 2019)

Decidable XPath Fragments in the Real World. - David Baelde; Anthony Lick; Sylvain Schmitz (PODS, 2019)

Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. - Sylvain Schmitz; Georg Zetzsche (RP, 2019)

Branching in Well-Structured Transition Systems (Invited Talk). - Sylvain Schmitz (CSL, 2021)

The ideal view on Rackoff's coverability technique. - Ranko Lazic 001; Sylvain Schmitz (Inf. Comput., 2021)

On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices. - Klara Nosan; Amaury Pouly; Sylvain Schmitz; Mahsa Shirmohammadi; James Worrell 001 (ISSAC, 2022)

Preface. - Paul C. Bell; Igor Potapov; Sylvain Schmitz; Patrick Totzke (Fundam. Informaticae, 2022)

Games on Graphs. - Nathanaël Fijalkow; Nathalie Bertrand 001; Patricia Bouyer-Decitre; Romain Brenguier; Arnaud Carayol; John Fearnley; Hugo Gimbert; Florian Horn 001; Rasmus Ibsen-Jensen; Nicolas Markey; Benjamin Monmege; Petr Novotný 001; et al. (CoRR, 2023)

On the Length of Strongly Monotone Descending Chains over Nd. - Sylvain Schmitz; Lia Schütze (CoRR, 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 ℕ^d. - Sylvain Schmitz; Lia Schütze (ICALP, 2024)

Verifying Unboundedness via Amalgamation. - Ashwani Anand; Sylvain Schmitz; Lia Schütze; Georg Zetzsche (LICS, 2024)