@booklet {el-yaniv-taimcolaa1996,
	title = {There Are Infinitely Many Competitive-Optimal Online List Accessing Algorithms},
	howpublished = {Discussion Papers},
	year = {1996},
	month = {6},
	abstract = {This paper presents a new family of optimal, 2-competitive, deterministic online list accessing algorithms. This family includes as members the well known MOVE-TO-FRONT (MTF) algorithm, and the recent, more "conservative" algorithm TIMESTAMP due to Albres.},
	url = {{\textquoteright}},
	author = {Ran El-Yaniv}
}
