Improved Randomized On-Line Algorithms for the List Update Problem
From MaRDI portal
Publication:4388893
DOI10.1137/S0097539794277858zbMath0907.68054MaRDI QIDQ4388893
Publication date: 10 May 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539794277858
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68W10: Parallel algorithms in computer science
68P05: Data structures
Related Items
List Update with Locality of Reference, Unnamed Item, Self-adjusting grid networks, Relative Worst-Order Analysis: A Survey, List update with probabilistic locality of reference, On the list update problem with advice, On the separation and equivalence of paging strategies and other online algorithms, On list update and work function algorithms., List factoring and relative worst order analysis, Parameterized analysis of paging and list update algorithms, A Survey of Algorithms and Models for List Update