@InProceedings{guerrini_et_al:LIPIcs.FSCD.2017.17,
author = {Guerrini, Stefano and Solieri, Marco},
title = {{Is the Optimal Implementation Inefficient? Elementarily Not}},
booktitle = {2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)},
pages = {17:1--17:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-047-7},
ISSN = {1868-8969},
year = {2017},
volume = {84},
editor = {Miller, Dale},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2017.17},
URN = {urn:nbn:de:0030-drops-77337},
doi = {10.4230/LIPIcs.FSCD.2017.17},
annote = {Keywords: optimality, sharing graphs, lambda-calculus, complexity, linear logic, proof nets}
}