On randomization in on-line computation

Authors:
Allan Borodin;Ran El-Yaniv
Affiliations:
Univ. of Toronto, Toronto, Ont., Canada;Technion—Israel Institute of Technology, Haifa, Israel
Venue:
Information and Computation
Year:
1999

Citing 0
Cited 3

A guessing game and randomized online algorithms

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Online k-server routing problems

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Randomized algorithms for on-line scheduling problems: how low can't you go?

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract