On the power of randomization in on-line algorithms
type: Item
instance of: scholarly article
title: On the power of randomization in on-line algorithms
zbMATH Open document ID: 0784.68038
DOI: 10.1007/BF01294260
author: V. Pereyra
published in: Algorithmica
publication date: 1994-01-19T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 488276
zbMATH Keywords: competitive analysis
zbMATH Keywords: randomized algorithms
zbMATH Keywords: on-line algorithms
Wikidata QID: Q29028151
MaRDI profile type: Publication
cites work: Q3138905
cites work: An optimal on-line algorithm for metrical task system
cites work: Q3138906
cites work: Random walks on weighted graphs and applications to on-line algorithms
cites work: Competitive paging algorithms
cites work: Competitive \(k\)-server algorithms
cites work: Q5817866
cites work: Competitive snoopy caching
cites work: Competitive algorithms for server problems
cites work: Borel determinacy
cites work: A strongly competitive randomized paging algorithm
full work available at URL: https://doi.org/10.1007/bf01294260
OpenAlex ID: W2056760235
DBLP publication ID: journals/algorithmica/Ben-DavidBKTW94
description: scientific article; zbMATH DE number 488276