McGraw Hill Book Company / Addison-Wesley Publishing Company / Prentice-Hall / AT&T / The times / /
Currency
pence / /
Facility
College Park / University of Maryland / /
IndustryTerm
search path backwards / list search algorithm / balanced search trees / balanced tree algorithms / gives algorithms / Search path / certain real-time applications / tree algorithms / concurrent balanced tree algorithms / individual search / expected search cost / search speed / nonrecursive algorithms / search moves / sub-linear algorithms / use search fingers / search key / search costs / search taking / skip list algorithms / search trees / deletion algorithm / expected search time / actual search taking / search / equivalent algorithms / memory management / real-time systems / self-adjusting tree algorithms / /
Organization
National Science Foundation / MIT / University of Maryland / College Park / Univ. of Waterloo / /
Person
William Pugh Binary / John Allen / Ian Munro / Cecilia Aragon / Tom Papadakis / Alan Demers / James Discroll / Thomas / Raimund Seidel / Doug McIlroy / Patricio Poblette / James Macropol / Tim Teitelbaum / /
Position
forward / /
ProgrammingLanguage
Pascal / C / /
ProvinceOrState
Maryland / /
PublishedMedium
Journal of the ACM / /
Technology
concurrent balanced tree algorithms / ANALYSIS OF SKIP LIST ALGORITHMS / self-adjusting tree algorithms / time algorithm / non-recursive AVL tree algorithms / sub-linear algorithms / shared memory / Skip list search algorithm / resulting algorithms / tree algorithms / deletion algorithm / 4 gives algorithms / N. Algorithms / Balanced tree algorithms / Caching / skip list algorithms / AVL tree algorithms / 3 tree algorithms / /
Skip Lists: A Probabilistic Alternative to Balanced Trees Skip lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforced balancing and as