Obserwuj
Sylvain Schmitz
Sylvain Schmitz
Université de Paris
Zweryfikowany adres z irif.fr - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
1402011
Complexity Hierarchies Beyond Elementary
S Schmitz
ACM Transactions on Computation Theory 8 (1:3), 2016
1342016
Demystifying Reachability in Vector Addition Systems
J Leroux, S Schmitz
LICS 2015 (Logic in Computer Science), 56--67, 2015
1042015
Multiply-Recursive Upper Bounds with Higman’s Lemma
S Schmitz, P Schnoebelen
ICALP 2011 (Automata, Languages and Programming) 6756, 441--452, 2011
792011
The Power of Well-Structured Systems (Invited Talk)
S Schmitz, P Schnoebelen
Concur 2013 (Concurrency Theory) 8052, 5--24, 2013
57*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
532015
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension
J Leroux, S Schmitz
LICS 2019 (Logic in Computer Science), 2019
512019
Non-Elementary Complexities for Branching VASS, MELL, and Extensions
R Lazić, S Schmitz
ACM Transactions on Computational Logic 16 (3:20), 1--30, 2015
512015
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
472012
Conservative Ambiguity Detection in Context-Free Grammars
S Schmitz
ICALP 2007 (Automata, Languages and Programming) 4596, 692--703, 2007
442007
Algorithmic Aspects of WQO Theory
S Schmitz, P Schnoebelen
Lecture Notes, 2012
43*2012
Model Checking Coverability Graphs of Vector Addition Systems
M Blockelet, S Schmitz
MFCS 2011 (Mathematical Foundations of Computer Science) 6907, 108--119, 2011
412011
The Power of Priority Channel Systems
C Haase, S Schmitz, P Schnoebelen
Logical Methods in Computer Science 10 (4:4), 1--39, 2014
402014
Alternating Vector Addition Systems with States
JB Courtois, S Schmitz
MFCS 2014 (Mathematical Foundations of Computer Science) 8634, 220--231, 2014
362014
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
282016
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
272018
Automata Column: The Complexity of Reachability in Vector Addition Systems
S Schmitz
ACM SIGLOG News 3 (1), 4--21, 2016
27*2016
An Experimental Ambiguity Detection Tool
S Schmitz
Science of Computer Programming 75 (1--2), 71--84, 2010
252010
Complexity Bounds for Ordinal-Based Termination (Invited Talk)
S Schmitz
RP 2014 (Reachability Problems) 8762, 1--19, 2014
24*2014
On the Computational Complexity of Dominance Links in Grammatical Formalisms
S Schmitz
ACL 2010 (Association for Computational Linguistics), 514-524, 2010
232010
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20