Follow
Sylvain Schmitz
Sylvain Schmitz
Université Paris Cité
Verified email at irif.fr - Homepage
Title
Cited by
Cited by
Year
On the Length of Strongly Monotone Descending Chains over
S Schmitz, L Schütze
arXiv preprint arXiv:2310.02847, 2023
2023
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices
K Nosan, A Pouly, S Schmitz, M Shirmohammadi, J Worrell
ISSAC 2022 (Symbolic and Algebraic Computation), 2022
32022
The Ideal View on Rackoff's Coverability Technique
R Lazić, S Schmitz
Information and Computation 277, 2021
26*2021
Branching in Well-Structured Transition Systems (Invited Talk)
S Schmitz
CSL 2021 (Computer Science Logic), 2021
12021
Accessibilité des systèmes d'addition de vecteurs
J Leroux, S Schmitz
Informatique Mathématique : Une photographie en 2020, 35--79, 2020
2020
On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
M Džamonja, S Schmitz, P Schnoebelen
Well-Quasi Orders in Computation, Logic, Language and Reasoning, 29-54, 2020
72020
Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets
S Schmitz, G Zetzsche
RP 2019 (Reachability Problems), 2019
52019
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension
J Leroux, S Schmitz
LICS 2019 (Logic in Computer Science), 2019
952019
The Parametric Complexity of Lossy Counter Machines
S Schmitz
ICALP 2019 (Automata, Languages and Programming), 2019
112019
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete
P Jančar, S Schmitz
LICS 2019 (Logic in Computer Science), 2019
82019
Decidable XPath Fragments in the Real World
D Baelde, A Lick, S Schmitz
PODS 2019 (Principles of Database Systems), 285--302, 2019
6*2019
A Hypersequent Calculus with Clusters for Linear Frames
D Baelde, A Lick, S Schmitz
AiML 2018 (Advances in Modal Logic) 12, 36--55, 2018
72018
A Hypersequent Calculus with Clusters for Tense Logic over Ordinals
D Baelde, A Lick, S Schmitz
FSTTCS 2018 (Foundations of Software Technology and Theoretical Computer …, 2018
22018
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
332018
Algorithmic Complexity of Well-Quasi-Orders
S Schmitz
École Normale Supérieure Paris-Saclay, 2017
132017
Perfect Half Space Games
T Colcombet, M Jurdziński, R Lazić, S Schmitz
LICS 2017 (Logic in Computer Science), 1--11, 2017
232017
A Sequent Calculus for a Modal Logic on Finite Data Trees
D Baelde, S Lunel, S Schmitz
CSL 2016 (Computer Science Logic) 62, 32:1--32:16, 2016
152016
Forward Analysis and Model Checking for Trace Bounded WSTS
P Chambart, A Finkel, S Schmitz
Theoretical Computer Science 637, 1--29, 2016
19*2016
Implicational Relevance Logic is 2-EXPTIME-Complete
S Schmitz
Journal of Symbolic Logic 81 (2), 641--661, 2016
112016
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
332016
The system can't perform the operation now. Try again later.
Articles 1–20