A lower bound for randomized list update algorithms
Author:
- Boris TeiaBTBoris Teia
- 1 August 1993
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 47 (1) , 5-9
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Two results on the list update problemInformation Processing Letters, 1991
- Amortized analyses of self-organizing sequential search heuristicsCommunications of the ACM, 1985
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985