- 37
- 6
- 4
- 4
- 3
- 3
- 1
- 1
- 1
- 1
Sylvain Schmitz
61
Documents
Présentation
Publications
- 12
- 8
- 8
- 6
- 5
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 8
- 7
- 5
- 5
- 5
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 7
- 5
- 3
- 9
- 4
- 6
- 5
- 2
- 6
- 3
- 1
- 2
- 2
- 12
- 11
- 6
- 2
- 1
|
|
Games on Graphspp.1-491, inPress, ⟨10.48550/arXiv.2305.10546⟩
Ouvrages
hal-04273394v1
|
Informatique Mathématique Une photographie en 20202020
Ouvrages
hal-03431823v1
|
On the Computation of the Zariski Closure of Finitely Generated Groups of MatricesProceedings of ISSAC 2022, 2022, Villeneuve-d’Ascq, France. ⟨10.1145/3476446.3536172⟩
Communication dans un congrès
hal-03450297v1
|
|
Branching in Well-Structured Transition Systems (Invited Talk)29th EACSL Annual Conference on Computer Science Logic (CSL 2021), 2021, Ljubljana, Slovenia. pp.3:1--3:3, ⟨10.4230/LIPIcs.CSL.2021.3⟩
Communication dans un congrès
hal-03439623v1
|
|
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed DimensionLICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--13, ⟨10.1109/LICS.2019.8785796⟩
Communication dans un congrès
hal-02267524v1
|
|
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-CompleteLICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--12, ⟨10.1109/LICS.2019.8785848⟩
Communication dans un congrès
hal-02267529v1
|
|
|
|
The Parametric Complexity of Lossy Counter MachinesICALP 2019, Jul 2019, Patras, Greece. pp.129:1--129:15, ⟨10.4230/LIPIcs.ICALP.2019.129⟩
Communication dans un congrès
hal-02020728v2
|
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets13th International Conference on Reachability Problems (RP 2019), 2019, Brussels, Belgium. pp.193--201, ⟨10.1007/978-3-030-30806-3_15⟩
Communication dans un congrès
hal-03440052v1
|
|
|
|
Decidable XPath Fragments in the Real World38th ACM Symposium on Principles of Database Systems (PODS'19), Jun 2019, Amsterdam, Netherlands. ⟨10.1145/3294052.3319685⟩
Communication dans un congrès
hal-01852475v1
|
|
|
A Hypersequent Calculus with Clusters for Linear FramesTwefth Conference on Advances in Modal Logic, Jul 2018, Bern, Switzerland. pp.36--55
Communication dans un congrès
hal-01756126v2
|
|
|
A Hypersequent Calculus with Clusters for Tense Logic over OrdinalsFSTTCS 2018 - 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2018, Ahmedabad, India. pp.15:1--15:19, ⟨10.4230/LIPIcs.FSTTCS.2018.15⟩
Communication dans un congrès
hal-01852077v2
|
|
|
The Complexity of Diagnosability and Opacity Verification for Petri NetsPetri nets 2017 - 38th International Conference on Applications and Theory of Petri Nets and Concurrency, Jun 2017, Zaragoza, Spain. pp.200--220, ⟨10.1007/978-3-319-57861-3_13⟩
Communication dans un congrès
hal-01484476v2
|
Perfect Half-Space GamesLogic in Computer Science, 2017, Reykjavik, Iceland. ⟨10.1109/LICS.2017.8005105⟩
Communication dans un congrès
hal-01633355v1
|
|
Ideal Decompositions for Vector Addition SystemsSTACS 2016 - 33rd Symposium on Theoretical Aspects of Computer Science, 2016, Orléans, France. pp.1--13, ⟨10.4230/LIPIcs.STACS.2016.1⟩
Communication dans un congrès
hal-01275991v1
|
|
|
|
A Sequent Calculus for a Modal Logic on Finite Data TreesCSL 2016, Sep 2016, Marseille, France. pp.1--16, ⟨10.4230/LIPIcs.CSL.2016.32⟩
Communication dans un congrès
hal-01191172v2
|
|
|
The Complexity of Coverability in ν-Petri NetsLICS 2016 - 31th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York, United States. pp.467--476, ⟨10.1145/2933575.2933593⟩
Communication dans un congrès
hal-01265302v2
|
|
|
Deciding Piecewise Testable Separability for Regular Tree LanguagesICALP 2016, Jul 2016, Rome, Italy. pp.97:1--97:15, ⟨10.4230/LIPIcs.ICALP.2016.97⟩
Communication dans un congrès
hal-01276119v4
|
|
|
Coverability Trees for Petri Nets with Unordered DataFoSSaCS, 2016, Eindhoven, Netherlands. pp.445--461, ⟨10.1007/978-3-662-49630-5_26⟩
Communication dans un congrès
hal-01252674v1
|
|
|
The Ideal View on Rackoff's Coverability TechniqueRP 2015 - 9th International Workshop on Reachability Problems, Sep 2015, Warsaw, Poland. pp.1--13, ⟨10.1007/978-3-319-24537-9_8⟩
Communication dans un congrès
hal-01176755v3
|
Demystifying Reachability in Vector Addition SystemsLICS 2015, Jul 2015, Kyoto, Japan. pp.56--67, ⟨10.1109/LICS.2015.16⟩
Communication dans un congrès
hal-01168388v1
|
|
Fixed-dimensional energy games are in pseudo-polynomial timeICALP 2015: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, Jul 2015, Kyoto, Japan. pp.260--272, ⟨10.1007/978-3-662-47666-6_21⟩
Communication dans un congrès
hal-01168300v1
|
|
Complexity Bounds for Ordinal-Based Termination8th International Workshop on Reachability Problems, Sep 2014, Oxford, United Kingdom. pp.1--19, ⟨10.1007/978-3-319-11439-2_1⟩
Communication dans un congrès
hal-01076701v1
|
|
Non-Elementary Complexities for Branching VASS, MELL, and ExtensionsJoint meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2014, Vienna, Austria. pp.61:1--61:1, ⟨10.1145/2603088.2603129⟩
Communication dans un congrès
hal-01076694v1
|
|
|
|
Alternating Vector Addition Systems with States39th International Symposium on Mathematical Foundations of Computer Science, Aug 2014, Budapest, Bulgaria. pp.220--231, ⟨10.1007/978-3-662-44522-8_19⟩
Communication dans un congrès
hal-00980878v2
|
Implicational Relevance Logic is 2-ExpTime-CompleteJoint 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda Calculi and Applications, Jul 2014, Vienna, Austria. pp.395--409, ⟨10.1007/978-3-319-08918-8_27⟩
Communication dans un congrès
hal-01076698v1
|
|
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems16th International Conference on Foundations of Software Science and Computation Structures, Mar 2013, Rome, Italy. pp.273--288, ⟨10.1007/978-3-642-37075-5_18⟩
Communication dans un congrès
hal-00793808v1
|
|
|
|
On LR Parsing with Selective DelaysCompilers Construction, Mar 2013, Rome, Italy. pp.244--263, ⟨10.1007/978-3-642-37051-9_13⟩
Communication dans un congrès
hal-00769668v1
|
The Power of Well-Structured Systems24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. pp.5--24, ⟨10.1007/978-3-642-40184-8_2⟩
Communication dans un congrès
hal-00907964v1
|
|
The Power of Priority Channel Systems24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. pp.319--333, ⟨10.1007/978-3-642-40184-8_23⟩
Communication dans un congrès
hal-00793809v1
|
|
Model Checking Parse TreesTwenty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2013, New Orleans, United States. pp.153--162, ⟨10.1109/LICS.2013.21⟩
Communication dans un congrès
hal-00907951v1
|
|
|
|
The Ordinal Recursive Complexity of of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets27th ACM/IEEE Symposium on Logic in Computer Science, Jun 2012, Dubrovnik, Croatia. pp.355--364, ⟨10.1109/LICS.2012.46⟩
Communication dans un congrès
hal-00793811v1
|
|
|
Model Checking Coverability Graphs of Vector Addition SystemsMCFS, 2011, Warsaw, Poland. pp.108--119, ⟨10.1007/978-3-642-22993-0_13⟩
Communication dans un congrès
hal-00600077v1
|
Forward Analysis and Model Checking for Trace Bounded WSTS32nd International Conference on Application and Theory of Petri Nets, Jun 2011, Newcastle, United Kingdom. p. 49--68, ⟨10.1007/978-3-642-21834-7_4⟩
Communication dans un congrès
hal-00610011v1
|
|
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma26th Annual IEEE Symposium on Logic in Computer Science, Jun 2011, Toronto, Canada. p. 269--278, ⟨10.1109/LICS.2011.39⟩
Communication dans un congrès
hal-00609871v1
|
|
|
|
A Note on Sequential Rule-Based POS TaggingFSMNLP, 2011, Blois, France. pp.83--87
Communication dans un congrès
hal-00600260v2
|
Multiply-Recursive Upper Bounds with Higman's Lemma38th International Colloquium on Automata, Languages and Programming, Jul 2011, Zürich, Switzerland. p. 441--452, ⟨10.1007/978-3-642-22012-8_35⟩
Communication dans un congrès
hal-00609865v1
|
|
|
|
Lexical Disambiguation in LTAG using Left Context5th Language & Technology Conference - LTC'11, Nov 2011, Poznań, Poland. pp.395-399
Communication dans un congrès
hal-00629902v1
|
|
|
On the Computational Complexity of Dominance Links in Grammatical FormalismsACL 2010, 2010, Uppsala, Sweden. pp.514--524
Communication dans un congrès
hal-00482396v6
|
|
|
Random Generation of Deterministic Tree (Walking) Automata14th International Conference on Implementation and Application of Automata - CIAA 2009, Jul 2009, Sydney, Australia. pp.115--124, ⟨10.1007/978-3-642-02979-0_15⟩
Communication dans un congrès
inria-00408316v1
|
Feature Unification in TAG Derivation TreesNinth International Workshop on Tree Adjoining Grammars and Related Formalisms, Jun 2008, Tübingen, Germany. p. 141-148
Communication dans un congrès
hal-00276326v1
|
|
|
|
Calculs d'unification sur les arbres de dérivation TAGTALN'08, 15ème Conférence sur le Traitement Automatique des Langues Naturelles, Jun 2008, Avignon, France. p. 320--329
Communication dans un congrès
inria-00270922v1
|
|
|
Conservative Ambiguity Detection in Context-Free Grammars34th International Colloquium on Automata, Languages and Programming, Jul 2007, Wroclaw, Poland. pp.692-703, ⟨10.1007/978-3-540-73420-8_60⟩
Communication dans un congrès
hal-00610222v1
|
|
|
On Ordinal Invariants in Well Quasi Orders and Finite Antichain OrdersPeter M. Schuster; Monika Seisenberger; Andreas Weiermann. Well-Quasi Orders in Computation, Logic, Language and Reasoning, 53, Springer, 2020, Trends in Logic, ⟨10.1007/978-3-030-30229-0_2⟩
Chapitre d'ouvrage
halshs-01625981v1
|
|
|
Lexical Disambiguation in LTAG using Left ContextZygmunt Vetulani; Joseph Mariani. Human Language Technology. Challenges for Computer Science and Linguistics. 5th Language and Technology Conference, LTC 2011, Poznan, Poland, November 25-27, 2011, Revised Selected Papers, 8387, Springer, pp.67-79, 2014, Lecture Notes in Computer Science (LNCS) series / Lecture Notes in Artificial Intelligence (LNAI) subseries, ISBN 978-3-319-08957-7. ⟨10.1007/978-3-319-08958-4_6⟩
Chapitre d'ouvrage
hal-00921246v1
|
|
|
Algorithmic Complexity of Well-Quasi-OrdersLogic in Computer Science [cs.LO]. École normale supérieure Paris-Saclay, 2017
HDR
tel-01663266v1
|
|
|
Approximating Context-Free Grammars for Parsing and VerificationSoftware Engineering [cs.SE]. Université Nice Sophia Antipolis, 2007. English. ⟨NNT : ⟩
Thèse
tel-00271168v1
|
|
|
Systèmes de preuveMaster. Préparation à l'agrégation de mathématiques, option informatique, France. 2018
Cours
cel-01903833v1
|
|
|
Logique propositionnelleMaster. Préparation à l'agrégation de mathématiques, option informatique, France. 2018
Cours
cel-01903823v1
|
|
|
Algorithmic Aspects of WQO TheoryMaster. France. 2012
Cours
cel-00727025v2
|
|
|
XPath BenchmarkLogiciel hal-02079114v1 |
|
|
XPath ParserLogiciel hal-02079276v1 |