On randomization in on-line computation.

DOI10.1006/inco.1998.2775zbMath1045.68982OpenAlexW2050329843MaRDI QIDQ1854274

Allan Borodin, Ran El-Yaniv

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/84622da1f3cd2c5323f695ec084e04120c2031e3

zbMATH Keywords

randomized on-line algorithmsYao principle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Theory of operating systems (68N25)

Related Items (5)

Online \(k\)-server routing problems ⋮ On the online min-wait relocation problem ⋮ Min-Cost Bipartite Perfect Matching with Delays ⋮ Metrical service systems with multiple servers ⋮ Randomized algorithms for on-line scheduling problems: How low can't you go?

Cites Work

• On the power of randomization in on-line algorithms
• New Ressults on Server Problems
• Competitive paging algorithms
• An optimal on-line algorithm for metrical task system
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On randomization in on-line computation.