Amortized efficiency of list update and paging rules
Communications of the ACM
Semirings, automata, languages
Semirings, automata, languages
An optimal online algorithm for metrical task systems
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Competitive algorithms for server problems
Journal of Algorithms
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Reasoning about infinite computations
Information and Computation
Online computation and competitive analysis
Online computation and competitive analysis
Principles of Optimal Page Replacement
Journal of the ACM (JACM)
Model checking
Trackless online algorithms for the server problem
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
MONA 1.x: New Techniques for WS1S and WS2S
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Reducing Model Checking of the Many to the Few
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Finite-state transducers in language and speech processing
Computational Linguistics
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Anzu: a tool for property synthesis
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Solving games without determinization
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Verifying quantitative properties using bound functions
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Coping with selfish on-going behaviors
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Coping with selfish on-going behaviors
Information and Computation
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
| Hi-index | 0.00 |
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 R≥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.