Sylvain Schmitz. Complexity Bounds for Ordinal-Based Termination - (Invited Talk). In Joël Ouaknine, Igor Potapov, James Worrell, editors, Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings. Volume 8762 of Lecture Notes in Computer Science, pages 1-19, Springer, 2014. [doi]
@inproceedings{Schmitz14-1,
title = {Complexity Bounds for Ordinal-Based Termination - (Invited Talk)},
author = {Sylvain Schmitz},
year = {2014},
doi = {10.1007/978-3-319-11439-2_1},
url = {http://dx.doi.org/10.1007/978-3-319-11439-2_1},
researchr = {https://researchr.org/publication/Schmitz14-1},
cites = {0},
citedby = {0},
pages = {1-19},
booktitle = {Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings},
editor = {Joël Ouaknine and Igor Potapov and James Worrell},
volume = {8762},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-11438-5},
}