2 citations found. Retrieving documents...
W. Pugh, A Skip List Cookbook, Technical Report, CS-TR-2286.1, University of Maryland, College Park,1990

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Algorithm Design and Software Libraries: Recent Developments.. - Mehlhorn, Näher (1992)   (15 citations)  (Correct)

....segment trees [4] interval trees [8] and dynamization of order decomposable searching problems [17] Asymptotically efficient realizations of augmented trees are usually based on weight balanced trees [16] in the case of range and segment trees implementations are available in LEDA. Skip lists [18, 19] were recently proposed as an alternative to balanced trees for one dimensional dictionaries. We argue in section 5 that skip lists can also serve as the basis for augmented tree schemes. They lead to simpler and more efficient programs. Related but weaker results were also obtained by [10] 2 ....

....and height larger than the height of any other tower. The height of the tower for an element is chosen randomly when the element is inserted. The height is h with probability p(1 Gamma p) h for all h 0; here p is a parameter between 0 and 1 (p = 1 2 and p = 3 4 work well in practice) In [18, 19] it is shown that the search time in skip lists is logarithmic and that skip lists lead to very simple and efficient algorithms for other tree operations, e.g. insertions, deletions, finger searching, merging, joining, and splitting. We will now sketch that skip lists are also an alternative to ....

W. Pugh, A Skip List Cookbook, Technical Report, CS-TR-2286.1, University of Maryland, College Park,1990


Skip Lists: A Randomized Dictionary - Smid (1999)   (Correct)

....ne (1=2) k = 4m(1=2) dlog ne 4m 1 n 4: This proves that the expected number of nodes on the search path to element xm is less than or equal to E(h) A B 3 dlog ne 2dlog ne 4 = 3dlog ne 7: 41 9 Further reading Skip lists were invented by William Pugh in 1989. See [7, 8, 9]. Another randomized dictionary, based on binary search trees, was introduced in 1989 by Aragon and Seidel [10] An introduction to probability theory can be found in the book by Cormen, Leiserson and Rivest [2] The standard book on this topic is Feller [3] Comprehensive overviews of randomized ....

W. Pugh. A skip list cookbook. Technical Report, University of Maryland, 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC