TY - GEN
T1 - Reasoning about online algorithms with weighted automata
AU - Aminof, Benjamin
AU - Kupferman, Orna
AU - Lampert, Robby
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=70349084125&partnerID=8YFLogxK
U2 - 10.1137/1.9781611973068.91
DO - 10.1137/1.9781611973068.91
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:70349084125
SN - 9780898716801
T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
SP - 835
EP - 844
BT - Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms
PB - Association for Computing Machinery (ACM)
T2 - 20th Annual ACM-SIAM Symposium on Discrete Algorithms
Y2 - 4 January 2009 through 6 January 2009
ER -