-
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...
-
Article
On the efficiency of maximum-flow algorithms on networks with small integer capacities
The performance of maximum-flow algoirthms that work in phases is studied as a function of the maximum arc capacity,C, of the network and a quantity we call thetotal potential, P, of the network, which is related...
-
Chapter and Conference Paper
The complexity of selection resolution, conflict resolution and maximum finding on multiple access channels