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

First Page		Document Content
Date: 2013-11-25 11:07:04 Analysis of algorithms Online algorithms Finite fields Computer science Computational complexity theory XTR List update problem Competitive analysis Applied mathematics		Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract The best randomized Add to Reading List Source URL: www14.in.tum.de Download Document from Source Website File Size: 197,04 KB Share Document on Facebook

	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 DocID: 1sCbZ - View Document
	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 DocID: 1s5hf - View Document
	Competitive Online Algorithms Susanne Albers Overview arrive one by one and must be scheduled immediately DocID: 1ri9G - View Document
	Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract The best randomized DocID: 1r8O0 - View Document
	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/ DocID: 1r4RN - View Document