Randomized online computation with high probability guarantees
From MaRDI portal
Publication:2134747
DOI10.1007/s00453-022-00925-zMaRDI QIDQ2134747
Rastislav Královič, Richard Královič, Dennis Komm, Tobias Mömke
Publication date: 3 May 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-00925-z
Cites Work
- Unnamed Item
- The \(k\)-server problem
- Competitive analysis of randomized paging algorithms
- Design and analysis of randomized algorithms. Introduction to design paradigms.
- Weighted sums of certain dependent random variables
- On-line Randomized Call Control Revisited
- Randomized Online Algorithms with High Probability Guarantees
- Competitive algorithms for server problems
- Competitive paging algorithms
- An optimal on-line algorithm for metrical task system
- Probability Inequalities for Sums of Bounded Random Variables