A Combined BIT and TIMESTAMP Algorithm for the List Update Problem Susanne Albers, Bernhard von Stengel, Ralph Werchner International Computer Science Institute, 1947 Center Street, Berkeley, CA 94704, USA Email: falbers

Source URL: www14.in.tum.de

A Competitive Analysis of the List Update Problem with Lookahead Susanne Albers Abstract We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if

Source URL: www14.in.tum.de

Competitive Online Algorithms Susanne Albers Overview arrive one by one and must be scheduled immediately

Source URL: www14.in.tum.de

• Online algorithms
• Analysis of algorithms
• Computer science
• Applied mathematics
• Computer programming
• K-server problem
• Metrical task system
• Adversary model
• Competitive analysis
• List update problem
• Algorithm
• Randomized algorithm

Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract The best randomized

Source URL: www14.in.tum.de

• Analysis of algorithms
• Online algorithms
• Finite fields
• Computer science
• Computational complexity theory
• XTR
• List update problem
• Competitive analysis
• Applied mathematics

Online Algorithms: A Study of Graph-Theoretic Concepts Susanne Albers Max-Planck-Institut fur Informatik, Im Stadtwald, 66123 Saarbrucken, Germany. , http://www.mpi-sb.mpg.de/~ albers/

Source URL: www14.in.tum.de

• Online algorithms
• Analysis of algorithms
• Computer science
• Applied mathematics
• Mathematics
• Competitive analysis
• Cache replacement policies
• List update problem
• Algorithm
• K-server problem
• Time complexity
• Adversary model

Mathemati al Programming manus ript No. (will be inserted by the editor) Susanne Albers Online Algorithms: A Survey

Source URL: www14.in.tum.de

• Online algorithms
• Analysis of algorithms
• Adversary model
• List update problem
• K-server problem
• Algorithm
• Randomized algorithm
• Competitive analysis
• Metrical task system

Online Algorithms Susanne Albers University of Freiburg, Germany 1 Introduction This book chapter reviews fundamental concepts and results in the area of

Source URL: www14.in.tum.de

• Online algorithms
• Analysis of algorithms
• Competitive analysis
• Adversary model
• List update problem
• Metrical task system
• K-server problem
• Randomized algorithm
• Algorithm
• Page replacement algorithm
• Ski rental problem

Average Case Analyses of List Update Algorithms, with Applications to Data Compression Susanne Albers Michael Mitzenmachery

Source URL: www14.in.tum.de

• Analysis of algorithms
• Online algorithms
• List update problem
• Competitive analysis
• Expected value
• Algorithm
• XTR

ELSEVIER Information Processing

Source URL: www.maths.lse.ac.uk

• Online algorithms
• Analysis of algorithms
• Applied mathematics
• List update problem
• Computer science
• Mathematics
• Algorithm
• Competitive analysis
• Page replacement algorithm

Optimal Projective Algorithms for the List Update Problem Christoph Amb¨uhl1 , Bernd G¨artner1 , and Bernhard von Stengel2 1 Institute for Theoretical Computer Science, ETH Z¨urich, 8092 Z¨urich, Switzerland.

Source URL: www.maths.lse.ac.uk

• Online algorithms
• Analysis of algorithms
• Computer science
• Mathematics
• Applied mathematics
• Competitive analysis
• List update problem
• Algorithm
• Permutation
• Adversary model
• Homography