| 
|
QuoteRef: pughW6_1990
topics >
all references >
ThesaHelp:
references p-r
ThesaHelp:
ACM references m-z
Topic:
search algorithms
Topic:
probability
Reference
Pugh, W., "Skip lists: a probabilistic alternative to balanced trees", Communications of the ACM, 33, 6, June 1990, pp. 668-676. Google
668 ;;Quote: skip list is a randomized data structure for balanced trees; simple and space efficient (1.5 pointers per node)
668 ;;Quote: skip list of nodes with k forwarding pointers; levels chosen randomly then never changes; simple updates
ThesaHelp: references p-r (245 items)
ThesaHelp: ACM references m-z (280 items)
Topic: search algorithms (40 items)
Topic: probability (21 items)