A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight w i , 1 ≤ i ≤ n, the time to access item i is O wi; the data structure is dynamic. We present deterministic and randomized variations, which are nearly identical; the deterministic one simply ensures the balance condition that the randomized one achieves probabilistically. We use the same method to analyze both. Search(X, i). Determine if i is in X. Insert(X,doi:10.1007/3-540-36136-7_1 fatcat:uomitb252vbzznktj2rb44bdqu