@InProceedings{frohn_et_al:LIPIcs.RTA.2015.334,
author = {Frohn, Florian and Giesl, J\"{u}rgen and Hensel, Jera and Aschermann, Cornelius and Str\"{o}der, Thomas},
title = {{Inferring Lower Bounds for Runtime Complexity}},
booktitle = {26th International Conference on Rewriting Techniques and Applications (RTA 2015)},
pages = {334--349},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-85-9},
ISSN = {1868-8969},
year = {2015},
volume = {36},
editor = {Fern\'{a}ndez, Maribel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2015.334},
URN = {urn:nbn:de:0030-drops-52068},
doi = {10.4230/LIPIcs.RTA.2015.334},
annote = {Keywords: Term Rewriting, Runtime Complexity, Lower Bounds, Induction}
}