Follow
Sylvain Schmitz
Sylvain Schmitz
Université Paris Cité
Verified email at irif.fr - Homepage
Title
Cited by
Cited by
Year
Complexity Hierarchies Beyond Elementary
S Schmitz
ACM Transactions on Computation Theory 8 (1:3), 2016
1762016
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma
D Figueira, S Figueira, S Schmitz, P Schnoebelen
LICS 2011 (Logic in Computer Science), 269--278, 2011
1662011
Demystifying Reachability in Vector Addition Systems
J Leroux, S Schmitz
LICS 2015 (Logic in Computer Science), 56--67, 2015
1372015
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension
J Leroux, S Schmitz
LICS 2019 (Logic in Computer Science), 2019
1132019
Multiply-Recursive Upper Bounds with Higman’s Lemma
S Schmitz, P Schnoebelen
ICALP 2011 (Automata, Languages and Programming) 6756, 441--452, 2011
832011
The Power of Well-Structured Systems (Invited Talk)
S Schmitz, P Schnoebelen
Concur 2013 (Concurrency Theory) 8052, 5--24, 2013
80*2013
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
M Jurdziński, R Lazić, S Schmitz
ICALP 2015 (Automata, Languages and Programming) 9135, 260--272, 2015
622015
Non-Elementary Complexities for Branching VASS, MELL, and Extensions
R Lazić, S Schmitz
ACM Transactions on Computational Logic 16 (3:20), 1--30, 2015
592015
The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets
S Haddad, S Schmitz, P Schnoebelen
LICS 2012 (Logic in Computer Science), 355--364, 2012
522012
Algorithmic Aspects of WQO Theory
S Schmitz, P Schnoebelen
Lecture Notes, 2012
51*2012
Automata Column: The Complexity of Reachability in Vector Addition Systems
S Schmitz
ACM SIGLOG News 3 (1), 4--21, 2016
492016
Conservative Ambiguity Detection in Context-Free Grammars
S Schmitz
ICALP 2007 (Automata, Languages and Programming) 4596, 692--703, 2007
472007
The Power of Priority Channel Systems
C Haase, S Schmitz, P Schnoebelen
Logical Methods in Computer Science 10 (4:4), 1--39, 2014
442014
Alternating Vector Addition Systems with States
JB Courtois, S Schmitz
MFCS 2014 (Mathematical Foundations of Computer Science) 8634, 220--231, 2014
442014
Model Checking Coverability Graphs of Vector Addition Systems
M Blockelet, S Schmitz
MFCS 2011 (Mathematical Foundations of Computer Science) 6907, 108--119, 2011
432011
The Complexity of Diagnosability and Opacity Verification for Petri Nets
B Bérard, S Haar, S Schmitz, S Schwoon
Fundamenta Informaticae 161 (4), 317-349, 2018
392018
Deciding Piecewise Testable Separability for Regular Tree Languages
J Goubault-Larrecq, S Schmitz
ICALP 2016 (Automata, Languages and Programming) 55, 97:1--97:15, 2016
372016
An Experimental Ambiguity Detection Tool
S Schmitz
Science of Computer Programming 75 (1--2), 71--84, 2010
302010
The Ideal View on Rackoff's Coverability Technique
R Lazić, S Schmitz
Information and Computation 277, 2021
29*2021
Coverability Trees for Petri Nets with Unordered Data
P Hofman, S Lasota, R Lazić, J Leroux, S Schmitz, P Totzke
FoSSaCS 2016 (Foundations of Software Science and Computation Structures …, 2016
292016
The system can't perform the operation now. Try again later.
Articles 1–20