2023

• Sylvain Schmitz and Lia Schütze. On the length of strongly monotone descending chains over ℕᵈ. Preprint, 2023.

2022

• Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, and James Worrell. On the computation of the Zariski closure of finitely generated groups of matrices. In ISSAC'22, pages 129–138. ACM, 2022.

2021

• Ranko Lazić and Sylvain Schmitz. The ideal view on Rackoff's coverability technique. Information and Computation 227, 2021.
• Sylvain Schmitz. Branching in Well-Structured Transition Systems (Invited Talk). In CSL'21, LIPIcs 183, pages 3:1–3:3. LZI, 2021.

2020

• Jérôme Leroux and Sylvain Schmitz. Accessibilité des systèmes d'addition de vecteurs. In Informatique Mathématique : Une photographie en 2020, pages 35–79. CNRS Éditions, 2020.
• Mirna Džamonja, Sylvain Schmitz, and Philippe Schnoebelen. On ordinal invariants in well quasi orders and finite antichain orders. In Well-quasi orders in computation, logic, language and reasoning, Trends in Logic 53, pages 29–54. Springer, 2020.

2019

• Sylvain Schmitz and Georg Zetzsche. Coverability is undecidable in one-dimensional pushdown vector addition systems with resets. In RP'19, LNCS 11674, pages 193–201. Springer, 2019.
• Sylvain Schmitz. The parametric complexity of lossy counter machines. In ICALP'19, LIPIcs 132, pages 129:1–129:15. LZI, 2019.
• David Baelde, Anthony Lick, and Sylvain Schmitz. Decidable XPath fragments in the real world. In PODS'19, pages 285–302. ACM Press, 2019.
• Jérôme Leroux and Sylvain Schmitz. Reachability in vector addition systems is primitive-recursive in fixed dimension. In LICS'19. IEEE Press, 2019.
• Petr Jančar and Sylvain Schmitz. Bisimulation equivalence of first-order grammars is ACKERMANN-complete. In LICS'19. IEEE Press, 2019.

2018

• Béatrice Bérard, Stefan Haar, Sylvain Schmitz, and Stefan Schwoon. The complexity of diagnosability and opacity verification for Petri nets. Fundamenta Informaticae 161(4), pages 317–349, 2018.
• David Baelde, Anthony Lick, and Sylvain Schmitz. A hypersequent calculus with clusters for tense logic over ordinals. In FSTTCS'18, LIPIcs 122, pages 15:1–15:19. LZI, 2018.
• David Baelde, Anthony Lick, and Sylvain Schmitz. A hypersequent calculus with clusters for linear frames. In AiML'18, pages 36–55. College Publications, 2018.

2017

• Sylvain Schmitz. Algorithmic complexity of well-quasi-orders. Mémoire d'habilitation, École Normale Supérieure Paris-Saclay, France, November 2017.
• Béatrice Bérard, Stefan Haar, Sylvain Schmitz, and Stefan Schwoon. The complexity of diagnosability and opacity verification for Petri nets. In Petri Nets'17, LNCS 10258, pages 200–220. Springer, 2017.
• Thomas Colcombet, Marcin Jurdziński, Ranko Lazić, and Sylvain Schmitz. Perfect half space games. In LICS'17, pages 1–11. IEEE Press, 2017.

2016

• David Baelde, Simon Lunel, and Sylvain Schmitz. A sequent calculus for a modal logic on finite data trees. In CSL'16, LIPIcs 62, pages 32:1–32:16. LZI, 2016.
• Pierre Chambart, Alain Finkel, and Sylvain Schmitz. Forward analysis and model checking for trace bounded WSTS. Theoretical Computer Science 637, pages 1–29, 2016.
• Jean Goubault-Larrecq and Sylvain Schmitz. Deciding piecewise testable separability for regular tree languages. In ICALP'16, LIPIcs 55, pages 97:1–97:15. LZI, 2016.
• Ranko Lazić and Sylvain Schmitz. The complexity of coverability in ν-Petri nets. In LICS'16, pages 467–476. ACM Press, 2016.
• Sylvain Schmitz. Implicational relevance logic is 2-EXPTIME-complete. Journal of Symbolic Logic 81(2), pages 641–661, 2016.
• Piotr Hofman, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke. Coverability trees for Petri nets with unordered data. In FoSSaCS'16, LNCS 9634, pages 445–461. Springer, 2016.
• Jérôme Leroux and Sylvain Schmitz. Ideal decompositions for vector addition systems. In STACS'16, LIPIcs 47, pages 1:1–1:13. LZI, 2016.
• Sylvain Schmitz. Complexity hierarchies beyond Elementary. ACM Transactions on Computation Theory 8(1:3), 2016.
• Sylvain Schmitz. Automata column: The complexity of reachability in vector addition systems. SIGLOG News 3(1), pages 3–21, 2016.

2015

• Ranko Lazić and Sylvain Schmitz. The ideal view on Rackoff's coverability technique. In RP'15, LNCS 9328, pages 76–88. Springer, 2015.
• Marcin Jurdziński, Ranko Lazić, and Sylvain Schmitz. Fixed-dimensional energy games are in pseudo polynomial time. In ICALP'15, LNCS 9135, pages 260–272. Springer, 2015.
• Ranko Lazić and Sylvain Schmitz. Non-elementary complexities for branching VASS, MELL, and extensions. ACM Transactions on Computational Logic 16(3:20), 2015.
• Jérôme Leroux and Sylvain Schmitz. Demystifying reachability in vector addition systems. In LICS'15, pages 56–67. IEEE Press, 2015.

2014

• Christoph Haase, Sylvain Schmitz, and Philippe Schnoebelen. The power of priority channel systems. Logical Methods in Computer Science 10(4:4), 2014.
• Sylvain Schmitz. Complexity bounds for ordinal-based termination. In RP'14, LNCS 8762, pages 1–19. Springer, 2014.
• Jean-Baptiste Courtois and Sylvain Schmitz. Alternating vector addition systems with states. In MFCS'14, LNCS 8634, pages 220–231. Springer, 2014.
• Ranko Lazić and Sylvain Schmitz. Non-elementary complexities for branching VASS, MELL, and extensions. In CSL/LICS'14. ACM Press, 2014.
• Sylvain Schmitz. Implicational relevance logic is 2-EXPTIME-complete. In RTA/TLCA'14, LNCS 8560, pages 395–409. Springer, 2014.

2013

• Christoph Haase, Sylvain Schmitz, and Philippe Schnoebelen. The power of priority channel systems. In CONCUR'13, LNCS 8052, pages 319–333. Springer, 2013.
• Sylvain Schmitz and Philippe Schnoebelen. The power of well-structured systems. In CONCUR'13, LNCS 8052, pages 5–24. Springer, 2013.
• Anudhyan Boral and Sylvain Schmitz. Model checking parse trees. In LICS'13, pages 153–162. IEEE Press, 2013.
• Eberhard Bertsch, Mark-Jan Nederhof, and Sylvain Schmitz. On LR parsing with selective delays. In CC'13, LNCS 7791, pages 244–263. Springer, 2013.
• Prateek Karandikar and Sylvain Schmitz. The parametric ordinal-recursive complexity of Post embedding problems. In FoSSaCS'13, LNCS 7794, pages 273–288. Springer, 2013.

2012

• Sylvain Schmitz and Philippe Schnoebelen. Algorithmic aspects of WQO theory. Lecture Notes. 2012.
• Serge Haddad, Sylvain Schmitz, and Philippe Schnoebelen. The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. In LICS'12, pages 355–364. IEEE Press, 2012.

2011

• Michel Blockelet and Sylvain Schmitz. Model-checking coverability graphs of vector addition systems. In MFCS'11, LNCS 6907, pages 108–119. Springer, 2011.
• Sylvain Schmitz. A note on sequential rule-based POS tagging. In FSMNLP'11, pages 83–87. ACL Press, 2011.
• Sylvain Schmitz and Philippe Schnoebelen. Multiply-recursive upper bounds with Higman's Lemma. In ICALP'11, LNCS 6756, pages 441–452. Springer, 2011.
• Pierre Chambart, Alain Finkel, and Sylvain Schmitz. Forward analysis and model checking for trace bounded WSTS. In Petri Nets'11, LNCS 6709, pages 49–68. Springer, 2011.
• Diego Figueira, Santiago Figueira, Sylvain Schmitz, and Philippe Schnoebelen. Ackermannian and primitive-recursive bounds with Dickson's Lemma. In LICS'11, pages 269–278. IEEE Press, 2011.

2010

• Pierre-Cyrille Héam, Cyril Nicaud, and Sylvain Schmitz. Parametric random generation of deterministic tree automata. Theoretical Computer Science 411(38–39), pages 3469–3480, 2010.
• Sylvain Schmitz. On the computational complexity of dominance links in grammatical formalisms. In ACL'10, pages 514–524. ACL Press, 2010.
• Sylvain Schmitz. An experimental ambiguity detection tool. Science of Computer Programming 75(1–2), pages 71–84, 2010.

2009

• Pierre-Cyrille Héam, Cyril Nicaud, and Sylvain Schmitz. Random generation of deterministic tree (walking) automata. In CIAA'09, LNCS 5642, pages 115–124. Springer, 2009.

2008

• Sylvain Schmitz and Joseph Le Roux. Feature unification in TAG derivation trees. In TAG+'08, pages 141–148. 2008.

2007

• Sylvain Schmitz. Approximating context-free grammars for parsing and verification. Thèse de doctorat, Laboratoire I3S, Université de Nice-Sophia Antipolis, France, September 2007.
• Sylvain Schmitz. An experimental ambiguity detection tool. In LDTA'07, ENTCS 203(2), pages 69–84. Elsevier Science Publishers, 2008.
• Sylvain Schmitz. Conservative ambiguity detection in context-free grammars. In ICALP'07, LNCS 4596, pages 692–703. Springer, 2007.

2006

• Jacques Farré, Igor Litovsky, and Sylvain Schmitz (eds.). 10th International Conference on Implementation and Application of Automata (CIAA'05), Sophia Antipolis, France, June 2005, LNCS 3845. Springer, 2006.
• Sylvain Schmitz. Modular syntax demands verification. Technical Report I3S/RR-2006-32-FR, Laboratoire I3S, Université de Nice-Sophia Antipolis, France, 2006.
• José Fortes Gálvez, Sylvain Schmitz, and Jacques Farré. Shift-resolve parsing: Simple, linear time, unbounded lookahead. In CIAA'06, LNCS 4094, pages 253–264. Springer, 2006.
• Sylvain Schmitz. Noncanonical LALR(1) parsing. In DLT'06, LNCS 4036, pages 95–107. Springer, 2006.