Publications : Mathieu HILAIRE

[GH21]

S. Göller and M. Hilaire. Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete. In Proceedings of the 38th Annual Symposium on Theoretical Aspects of Computer Science (STACS'21), volume 187 of Leibniz International Proceedings in Informatics, Saarbrücken, Germany, March 2021. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2021.36.
[ BibTex | DOI | Web page | PDF ]

[Hil18]

M. Hilaire. Complexity of the reachability problem for parametric timed automata. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2018.
[ BibTex | PDF ]

[CHM⁺16]

N. Cohen, M. Hilaire, N. A. Martins, N. Nisse, and S. Pérennes. Spy-Game on Graphs. In Proceedings of the 8th International Conference on Fun with Algorithms (FUN'16), volume 49 of Leibniz International Proceedings in Informatics, pages 10:1--10:16, La Maddalena, Italy, June 2016. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
doi: 10.4230/LIPIcs.FUN.2016.10.
[ BibTex | DOI | Web page | PDF ]

This file was generated by bibtex2html 1.98.