Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Analysing deletions in competitive self-adjusting linear list algorithms
There has been a great deal of work on self-adjusting algorithms for linear lists. Almost all of the prior work focused only on successful searches, but in [3] we designed and analysed self-adjusting algorithm...
-
Chapter and Conference Paper
Randomized competitive algorithms for successful and unsuccessful search on self-adjusting linear lists
This paper studies the classical Dictionary problem using a self-adjusting linear list. We design and analyze randomized, on-line algorithms for a sequence of successful and unsuccessful searches which are com...