@InProceedings{avanzini_et_al:LIPIcs.FSCD.2016.10,
author = {Avanzini, Martin and Moser, Georg},
title = {{Complexity of Acyclic Term Graph Rewriting}},
booktitle = {1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)},
pages = {10:1--10:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-010-1},
ISSN = {1868-8969},
year = {2016},
volume = {52},
editor = {Kesner, Delia and Pientka, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.10},
URN = {urn:nbn:de:0030-drops-59901},
doi = {10.4230/LIPIcs.FSCD.2016.10},
annote = {Keywords: Program Analysis, Graph Rewriting, Complexity Analysis}
}