- 8
- 2
- 1
Sylvain Schmitz
11
Documents
Présentation
Publications
- 7
- 3
- 3
- 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
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 3
- 5
- 11
- 2
Complexity Hierarchies Beyond ElementaryACM Transactions on Computation Theory, 2016, 8 (1), ⟨10.1145/2858784⟩
Article dans une revue
hal-01267354v1
|
|
Implicational Relevance Logic is 2-ExpTime-CompleteThe Journal of Symbolic Logic, 2016, 81 (2), pp.641--661. ⟨10.1017/jsl.2015.7⟩
Article dans une revue
hal-01340113v1
|
|
Non-Elementary Complexities for Branching VASS, MELL, and ExtensionsACM Transactions on Computational Logic, 2015, 16 (3:20), pp.1--30. ⟨10.1145/2733375⟩
Article dans une revue
hal-01168290v1
|
|
The Power of Priority Channel SystemsLogical Methods in Computer Science, 2014, 10 (4:4), pp.1--39. ⟨10.2168/LMCS-10(4:4)2014⟩
Article dans une revue
hal-01091086v1
|
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
|
|
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
|
|
|
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
|
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
|
|
Algorithmic Complexity of Well-Quasi-OrdersLogic in Computer Science [cs.LO]. École normale supérieure Paris-Saclay, 2017
HDR
tel-01663266v1
|