Editable Biblio is accessible from the internal network (or through VPN): http://10.10.24.239:8080/biblio/?section=publication&id=8267376982271481923&mode=view

Martin Plátek, Markéta Lopatková, Dana Pardubská (2014): On the Complexity of Reductions by Restarting Automata. In: NCMA, pp. 207-222, Österreichische Computer Gesellschaft , Wien, Austria, ISBN 978-3-85403-304-2 (local PDF, bibtex)