Map
Index
Random
Help
Quotes
Subtopics
Referenced
th

QuoteRef: pughW6_1990

all references > ThesaHelp: references p-r


--topics--
probability
search algorithms

--subtopics--
randomized algoriths
skip list

--referenced--
ACM references m-z

Reference

Pugh, W., "Skip lists: a probabilistic alternative to balanced trees," Communications of the ACM, 33.6, June 1990, p. 668-676

Quotes up

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

Collected barberCB 6/90 filed
Copyright © 2002-2023 by C.B. Barber
Thesa, Avev, and thid-... are trademarks of C.B. Barber