%0 Conference Paper %1 conf/mfcs/AllenderKM17 %A Allender, Eric %A Krebs, Andreas %A McKenzie, Pierre %B MFCS %D 2017 %E Larsen, Kim G. %E Bodlaender, Hans L. %E Raskin, Jean-François %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K %P 24:1-24:14 %T Better Complexity Bounds for Cost Register Automata. %U http://dblp.uni-trier.de/db/conf/mfcs/mfcs2017.html#AllenderKM17 %V 83 %@ 978-3-95977-046-0

@inproceedings{conf/mfcs/AllenderKM17, added-at = {2023-12-14T15:35:30.000+0100}, author = {Allender, Eric and Krebs, Andreas and McKenzie, Pierre}, biburl = {https://www.bibsonomy.org/bibtex/27b0838638761b0dadb1a4c8a90cdfefc/admin}, booktitle = {MFCS}, crossref = {conf/mfcs/2017}, editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-François}, ee = {https://doi.org/10.4230/LIPIcs.MFCS.2017.24}, interhash = {ed107feba5197b9dbcc29f5f28a7900a}, intrahash = {7b0838638761b0dadb1a4c8a90cdfefc}, isbn = {978-3-95977-046-0}, keywords = {}, pages = {24:1-24:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2023-12-14T15:35:30.000+0100}, title = {Better Complexity Bounds for Cost Register Automata.}, url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2017.html#AllenderKM17}, volume = 83, year = 2017 }