Formal Analysis of Online Algorithms
DOI10.1007/978-3-642-24372-1_16zbMATH Open1348.68298OpenAlexW46711333MaRDI QIDQ3172916FDOQ3172916
Benjamin Aminof, Robby Lampert, Orna Kupferman
Publication date: 7 October 2011
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_16
Recommendations
- Online-bounded analysis
- Convergence analysis of online algorithms
- General algorithmic frameworks for online problems
- Finite-State Online Algorithms and Their Automated Competitive Analysis
- Reasoning about online algorithms with weighted automata
- Reasoning about online algorithms with weighted automata
- Online algorithms: a survey
- A new measure for the study of on-line algorithms
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
Formal languages and automata (68Q45) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (6)
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
- Reasoning about online algorithms with weighted automata
- Learning Weighted Automata
- Stochastization of Weighted Automata
- Generalization bounds for learning weighted automata
- Learning weighted automata over principal ideal domains
This page was built for publication: Formal Analysis of Online Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172916)
