1990 · 57 citations · 22 references
ComputingComputer ScienceAlgorithmsParallel ComputingScientific ComputingComputational ComplexityGraph AlgorithmsGraph TheoryRandom WalksRandom Graph TheoryRandom Walk AlgorithmsRandom Walks On GraphsRandomized Graph AlgorithmsWeighted Graph Representations
We study the design and analysis of randomized on-line algorithms. We show that this problem is closely related to the synthesis of random walks on graphs with positive real costs on their edges.
22
Anna R. Karlin, Mark S. Manasse, Larry Rudolph et al. · Algorithmica · 1988 · 612 citations
Amos Fiat, Richard M. Karp, Michael Luby et al. · Journal of Algorithms · 1991 · 459 citations · Full text