Randomized online computation with high probability guarantees

DOI10.1007/S00453-022-00925-ZMaRDI QIDQ2134747zbMATH OpenOpenAlexFDO

Authors Dennis Komm, Rastislav Královič, Richard Královič, Tobias Mömke

Publication date 3 May 2022

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00453-022-00925-z

zbMATH Keywords

randomizationonline algorithmsbounds with high probability

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Recommendations

• Randomized Online Algorithms with High Probability Guarantees
• Randomized Competitive Analysis for Two-Server Problems
• Randomized competitive analysis for two server problems
• Randomized algorithms for metrical task systems

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• An optimal on-line algorithm for metrical task system
• Competitive algorithms for server problems
• Competitive analysis of randomized paging algorithms
• Competitive paging algorithms
• Design and analysis of randomized algorithms. Introduction to design paradigms.
• On-line randomized call control revisited
• Probability Inequalities for Sums of Bounded Random Variables
• Randomized Online Algorithms with High Probability Guarantees
• The \(k\)-server problem
• Weighted sums of certain dependent random variables

Cited in

(2)

• scientific article; zbMATH DE number 7650400 (Why is no real title available?)
• Randomized Online Algorithms with High Probability Guarantees

This page was built for publication: Randomized online computation with high probability guarantees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2134747)