Nick Reingold, Jeffery Westbrook, Daniel D. Sleator  Home/Search
Context Related
| yale.edu/~westbroo...stupdaterws.ps.Z yale.edu/homes/wes...stupdaterws.ps.Z yale.edu/HTML/YALE...stupdaterws.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: yale.edu/~westbrook/pubs (more) From: yale.edu/HTML/YALE/CS/HyPl...pubs (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We prove upper and lower bounds on the competitiveness of randomized algorithms for the list update problem of Sleator and Tarjan. We give a simple and elegant randomized algorithm that is more competitive than the best previous randomized algorithm due to Irani. Our algorithm uses randomness only during an initialization phase, and from then on runs completely deterministically. It is the first randomized competitive algorithm with this property to beat the deterministic lower bound. We... (Update)
Similar documents based on text: More All
0.6: Offline List Update is NP-hard - Ambühl (2000) (Correct)
0.3: Off-line Algorithms for The List Update Problem - Reingold, Westbrook (1995) (Correct)
0.2: Revisiting the COUNTER Algorithms for List Update - Albers, Mitzenmacher (Correct)
BibTeX entry: (Update)
N. Reingold, J. Westbrook and D.D. Sleator. Randomized competitive algorithms for the list update problem. Algorithmica, 11(1):15--32, 1994. http://citeseer.ist.psu.edu/reingold92randomized.html More
@article{ reingold94randomized,
author = "Nick Reingold and Jeffery Westbrook and Daniel Dominic Sleator",
title = "Randomized Competitive Algorithms for the List Update Problem",
journal = "Algorithmica",
volume = "11",
number = "1",
pages = "15-32",
year = "1994",
url = "citeseer.ist.psu.edu/reingold92randomized.html" }
Citations (may not include all citations):488 Amortized efficiency of list update and paging rules (context) - Sleator, Tarjan - 1985
234 Competitive snoopy caching (context) - Karlin, Manasse et al. - 1988
90 An optimal online algorithm for metrical task systems (context) - Borodin, Linial et al. - 1987
86 the power of randomization in on-line algorithms (context) - Ben-David, Borodin et al. - 1990
75 Competitive randomized algorithms for non-uniform problems (context) - Karlin, Manasse et al. - 1990
72 A locally adaptive data compression scheme (context) - Bentley, Sleator et al. - 1986
61 Memory versus randomization in on-line algorithms (context) - Raghavan, Snir - 1990
61 Competitive algorithms for replication and migration problem.. (context) - Black, Sleator - 1989
46 Elementary Numerical Analysis (context) - Conte, de Boor - 1980
37 Amortized analyses of self-organizing sequential search heur.. (context) - Bentley, McGeoch - 1985
32 On self-organizing sequential search heuristics (context) - Rivest - 1976
30 Two results on the list update problem (context) - Irani - 1991
28 Randomized algorithms for multiprocessor page migration - Westbrook - 1991
22 A graph-theoretic game and its application to the k-server p.. - Alon, Karp et al. - 1991
21 On fast algorithms for two servers - Chrobak, Larmore - 1991
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.yale.edu/~westbrook/pubs.html): More
Randomized Algorithms For Multiprocessor Page Migration - Westbrook (Correct)
Short Encodings of Planar Graphs and Maps - Keeler, Westbrook (1993) (Correct)
Online Load Balancing and Network Flow - Phillips, Westbrook (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC