@inproceedings{fd02ee4d7c8440d0b957a2cb6bc37726,
title = "Reasoning about online algorithms with weighted automata",
abstract = "We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in IR≥0. By relating the {"}unbounded look ahead{"} of optimal offline algorithms with nondeterminism, and relating the {"}no look ahead{"} of online algorithms with determinism, we are able to solve problems about the competitive ratio of online algorithms, and the memory they require, by reducing them to questions about determinization and approximated determinization of weighted automata.",
author = "Benjamin Aminof and Orna Kupferman and Robby Lampert",
year = "2009",
doi = "10.1137/1.9781611973068.91",
language = "American English",
isbn = "9780898716801",
series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "Association for Computing Machinery (ACM)",
pages = "835--844",
booktitle = "Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms",
address = "United States",
note = "20th Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 04-01-2009 Through 06-01-2009",
}