Sylvain Schmitz

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 39

Top Venues

CoRR

LICS

ICALP

University of Nice Sophia Antipolis, France (PHD)

Education History

University of Nice Sophia Antipolis, France

PHD

Publications

Ashwani Anand, Sylvain Schmitz, Lia Schütze, Georg Zetzsche
Verifying Unboundedness via Amalgamation. LICS (2024)
Ashwani Anand, Sylvain Schmitz, Lia Schütze, Georg Zetzsche
Verifying Unboundedness via Amalgamation. CoRR (2024)
Sylvain Schmitz, Lia Schütze
On the Length of Strongly Monotone Descending Chains over ℕ^d. ICALP (2024)
Sylvain Schmitz, Lia Schütze
. CoRR (2023)
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 (2023)
Sergio Abriola, Simon Halfon, Aliaume Lopez, Sylvain Schmitz, Philippe Schnoebelen, Isa Vialard
Measuring well quasi-ordered finitary powersets. CoRR (2023)
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)
Paul C. Bell, Igor Potapov, Sylvain Schmitz, Patrick Totzke
Preface. Fundam. Informaticae 189 (3-4) (2022)
Ranko Lazic, Sylvain Schmitz
The ideal view on Rackoff's coverability technique. Inf. Comput. 277 (2021)
Sylvain Schmitz
Branching in Well-Structured Transition Systems (Invited Talk). CSL (2021)
Sylvain Schmitz
The Parametric Complexity of Lossy Counter Machines. ICALP (2019)
Petr Jancar, Sylvain Schmitz
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. LICS (2019)
Jérôme Leroux, Sylvain Schmitz
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. CoRR (2019)
Sylvain Schmitz, Georg Zetzsche
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. RP (2019)
Petr Jancar, Sylvain Schmitz
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. CoRR (2019)
Sylvain Schmitz, Georg Zetzsche
Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets. CoRR (2019)
David Baelde, Anthony Lick, Sylvain Schmitz
Decidable XPath Fragments in the Real World. PODS (2019)
Jérôme Leroux, Sylvain Schmitz
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. LICS (2019)
Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon
The Complexity of Diagnosability and Opacity Verification for Petri Nets. Fundam. Informaticae 161 (4) (2018)
David Baelde, Anthony Lick, Sylvain Schmitz
A Hypersequent Calculus with Clusters for Linear Frames. Advances in Modal Logic (2018)
David Baelde, Anthony Lick, Sylvain Schmitz
A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. FSTTCS (2018)
Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
Perfect half space games. LICS (2017)
Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
Perfect Half Space Games. CoRR (2017)
Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon
The Complexity of Diagnosability and Opacity Verification for Petri Nets. Petri Nets (2017)
Jérôme Leroux, Sylvain Schmitz
Ideal Decompositions for Vector Addition Systems (Invited Talk). STACS (2016)
Pierre Chambart, Alain Finkel, Sylvain Schmitz
Forward analysis and model checking for trace bounded WSTS. Theor. Comput. Sci. 637 (2016)
Jean Goubault-Larrecq, Sylvain Schmitz
Deciding Piecewise Testable Separability for Regular Tree Languages. ICALP (2016)
David Baelde, Simon Lunel, Sylvain Schmitz
A Sequent Calculus for a Modal Logic on Finite Data Trees. CSL (2016)
Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke
Coverability Trees for Petri Nets with Unordered Data. FoSSaCS (2016)
Ranko Lazic, Sylvain Schmitz
The Complexity of Coverability in ν-Petri Nets. LICS (2016)
Sylvain Schmitz
Complexity Hierarchies beyond Elementary. ACM Trans. Comput. Theory 8 (1) (2016)
Sylvain Schmitz
The complexity of reachability in vector addition systems. ACM SIGLOG News 3 (1) (2016)
Sylvain Schmitz
Implicational Relevance Logic is 2-EXPTIME-Complete. J. Symb. Log. 81 (2) (2016)
Ranko Lazic, Sylvain Schmitz
The Ideal View on Rackoff's Coverability Technique. RP (2015)
Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. ICALP (2) (2015)
Ranko Lazic, Sylvain Schmitz
Nonelementary Complexities for Branching VASS, MELL, and Extensions. ACM Trans. Comput. Log. 16 (3) (2015)
Jérôme Leroux, Sylvain Schmitz
Demystifying Reachability in Vector Addition Systems. LICS (2015)
Jérôme Leroux, Sylvain Schmitz
Reachability in Vector Addition Systems Demystified. CoRR (2015)
Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. CoRR (2015)
Jean-Baptiste Courtois, Sylvain Schmitz
Alternating Vector Addition Systems with States. MFCS (1) (2014)
Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen
The Power of Priority Channel Systems Log. Methods Comput. Sci. 10 (4) (2014)
Ranko Lazic, Sylvain Schmitz
Non-elementary complexities for branching VASS, MELL, and extensions. CSL-LICS (2014)
Ranko Lazic, Sylvain Schmitz
Non-Elementary Complexities for Branching VASS, MELL, and Extensions. CoRR (2014)
Sylvain Schmitz, Philippe Schnoebelen
The Power of Well-Structured Systems. CoRR (2014)
Sylvain Schmitz
Complexity Bounds for Ordinal-Based Termination - (Invited Talk). RP (2014)
Sylvain Schmitz
Complexity Bounds for Ordinal-Based Termination. CoRR (2014)
Sylvain Schmitz
Implicational Relevance Logic is 2-ExpTime-Complete. RTA-TLCA (2014)
Sylvain Schmitz
Implicational Relevance Logic is 2-EXPTIME-Complete. CoRR (2014)
Prateek Karandikar, Sylvain Schmitz
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. FoSSaCS (2013)
Sylvain Schmitz, Philippe Schnoebelen
The Power of Well-Structured Systems. CONCUR (2013)
Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen
The Power of Priority Channel Systems. CONCUR (2013)
Anudhyan Boral, Sylvain Schmitz
Model-Checking Parse Trees. LICS (2013)
Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz
On LR Parsing with Selective Delays. CC (2013)
Sylvain Schmitz
Complexity Hierarchies Beyond Elementary. CoRR (2013)
Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets. LICS (2012)
Prateek Karandikar, Sylvain Schmitz
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems CoRR (2012)
Anudhyan Boral, Sylvain Schmitz
PDL Model Checking of Parse Forests CoRR (2012)
Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. LICS (2011)
Michel Blockelet, Sylvain Schmitz
Model Checking Coverability Graphs of Vector Addition Systems. MFCS (2011)
Pierre Chambart, Alain Finkel, Sylvain Schmitz
Forward Analysis and Model Checking for Trace Bounded WSTS. Petri Nets (2011)
Sylvain Schmitz, Philippe Schnoebelen
Multiply-Recursive Upper Bounds with Higman's Lemma. ICALP (2) (2011)
Sylvain Schmitz, Philippe Schnoebelen
Multiply-Recursive Upper Bounds with Higman's Lemma CoRR (2011)
Sylvain Schmitz
A Note on Sequential Rule-Based POS Tagging. FSMNLP (2011)
Claire Gardent, Yannick Parmentier, Guy Perrier, Sylvain Schmitz
Lexical Disambiguation in LTAG Using Left Context. LTC (2011)
Sylvain Schmitz
An experimental ambiguity detection tool. Sci. Comput. Program. 75 (1-2) (2010)
Pierre Chambart, Alain Finkel, Sylvain Schmitz
Forward Analysis and Model Checking for Bounded WSTS CoRR (2010)
Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen
Ackermann and Primitive-Recursive Bounds with Dickson's Lemma CoRR (2010)
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
Parametric random generation of deterministic tree automata. Theor. Comput. Sci. 411 (38-39) (2010)
Sylvain Schmitz
On the Computational Complexity of Dominance Links in Grammatical Formalisms. ACL (2010)
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
Random Generation of Deterministic Tree (Walking) Automata. CIAA (2009)
Sylvain Schmitz
An Experimental Ambiguity Detection Tool. Electron. Notes Theor. Comput. Sci. 203 (2) (2008)
Sylvain Schmitz, Joseph Le Roux
Feature Unification in TAG Derivation Trees. TAG (2008)
Sylvain Schmitz, Joseph Le Roux
Calculs d'unification sur les arbres de dérivation TAG. TALN (Articles courts) (2008)
Sylvain Schmitz, Joseph Le Roux
Feature Unification in TAG Derivation Trees CoRR (2008)
Sylvain Schmitz
Conservative Ambiguity Detection in Context-Free Grammars. ICALP (2007)
José Fortes Gálvez, Sylvain Schmitz, Jacques Farré
Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time. CIAA (2006)
Sylvain Schmitz
Noncanonical LALR(1) Parsing. Developments in Language Theory (2006)

Sylvain Schmitz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sylvain Schmitz