Skip Lists: A Randomized Dictionary (ResearchIndex)

See this document in CiteSeerX!

Skip Lists: A Randomized Dictionary (1999) (Make Corrections)
Michiel Smid

Rate this article:

(Enter summary)
Abstract: Introduction We consider the dictionary problem: Given a set S of n real numbers, store them in a data structure such that the following three operations can be performed eciently: 1. Search(x): Given a real number x, nd the largest element of S[f1g that is less than or equal to x. (By introducing 1, this operation is always well-dened.) 2. Insert(x): Given a real number x, insert it into the data structure. (Hence, we set S := S [ fxg.) 3. Delete(x): Given a real number x, delete it from... (Update)

Active bibliography (related documents): More All
0.5: Algorithm Design and Software Libraries: Recent Developments.. - Mehlhorn, Näher (1992) (Correct)
0.0: Combinatorics with a Geometric Flavor: Some Examples - Kalai (2000) (Correct)
0.0: Efficient Strategies for Topics in Internet Algorithmics - Bagchi (2002) (Correct)

Similar documents based on text: More All
0.6: A Skip List Cookbook - Pugh (1989) (Correct)
0.5: Skip Lists: A Probabilistic Alternative to Balanced Trees - Pugh (1990) (Correct)
0.1: Stepwise construction of the Dedekind-MacNeille completion - Ganter, Kuznetsov (1998) (Correct)

BibTeX entry: (Update)

@misc{ smid-skip,
  author = "Michiel Smid",
  title = "Skip Lists: A Randomized Dictionary",
  url = "citeseer.ist.psu.edu/smid99skip.html" }