Skip Lists: A Probabilistic Alternative to Balanced Trees (1990)

by William Pugh
Citations:325 - 1 self

Active Bibliography

Data Structures with Unpredictable Timing – Darrell Bethea, Michael K. Reiter
2 Skip trees, an alternative data structure to Skip lists in a concurrent approach – Xavier Messeguer - 1997
3 Adaptive Memoization – Umut A. Acar, Guy E. Blelloch, Robert Harper - 2003
12 Strongly history-independent hashing with applications – Guy E. Blelloch - 2007
35 Self-Adjusting Computation – Umut A. Acar - 2005
6 Strengthening invariants for efficient computation – Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum - 2001
Potentials and Limitations of Visual Methods for the Exploration of Complex Data Structures – Tobias Lauer - 2007
3 Smoothed Analysis of Binary Search Trees – Bodo Manthey , Rüdiger Reischuk - 2006
12 Algorithm Design and Software Libraries: Recent Developments in the LEDA Project – Kurt Mehlhorn, Stefan Näher - 1992
145 Certificate Revocation and Certificate Update – Moni Naor, Kobbi Nissim - 1998
8 Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel A* Graph Search – Nihar R. Mahapatra, Shantanu Dutt - 1995
27 Enumerating Longest Increasing Subsequences and Patience Sorting – Sergei Bespamyatnikh, Michael Segal - 2000
An Overview over Red-Black and Finger Trees – Heather D. Booth - 1992
6 Adaptive Structuring Of Binary Search Trees Using Conditional Rotations – R. P. Cheetham, B. J. Oommen, D. T. H. Ng - 1987
12 STABLE NETWORKS AND PRODUCT GRAPHS – Tomás Feder
29 Data Structures for Traveling Salesmen – M. L. Fredman, D. S. Johnson, L. A. Mcgeoch, G. Ostheimer - 1995
1 Using read-copy-update techniques for system V – Andrea Arcangeli, Suse Labs, Mingming Cao, Paul E. Mckenney, Dipankar Sarma - 2003
Exploiting Deferred Destruction: An Analysis of . . . – Paul E. McKenney, Jonathan Walpole - 2005
Using read-copy-update techniques for system V IPC in the Linux 2.5 Kernel – Andrea Arcangeli, Mingming Cao, Paul E. McKenney, Dipankar Sarma - 2003