Go to the corresponding LIPIcs Volume Portal 
Allender, Eric ; Krebs, Andreas ; McKenzie, Pierre
pdfformat: 

@InProceedings{allender_et_al:LIPIcs:2017:8066, author = {Eric Allender and Andreas Krebs and Pierre McKenzie}, title = {{Better Complexity Bounds for Cost Register Automata}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {24:124:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770460}, ISSN = {18688969}, year = {2017}, volume = {83}, editor = {Kim G. Larsen and Hans L. Bodlaender and JeanFrancois Raskin}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8066}, URN = {urn:nbn:de:0030drops80661}, doi = {10.4230/LIPIcs.MFCS.2017.24}, annote = {Keywords: computational complexity, cost registers} }
Keywords:  computational complexity, cost registers  
Seminar:  42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)  
Issue Date:  2017  
Date of publication:  22.11.2017 