On randomization in on-line computation.
type: Item
instance of: scholarly article
title: On randomization in on-line computation.
zbMATH Open document ID: 1045.68982
author: Allan Borodin
author: Ran El-Yaniv
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1853038
zbMATH Keywords: randomized on-line algorithms
zbMATH Keywords: Yao principle
MaRDI profile type: Publication
OpenAlex ID: W2050329843
cites work: Q5561633
cites work: On the power of randomization in on-line algorithms
cites work: Q4223058
cites work: An optimal on-line algorithm for metrical task system
cites work: New Ressults on Server Problems
cites work: Competitive paging algorithms
cites work: Q3245634
cites work: Q5583591
cites work: Q3999542
cites work: Q4220385
DOI: 10.1006/INCO.1998.2775
description: scientific article; zbMATH DE number 1853038