Key independent optimality (2002)

Cached

Download Links

by John Iacono
Venue:In International Symp. on Algorithms and Computation
Citations:8 - 2 self

Documents Related by Co-Citation

32 Lower bounds for accessing binary search trees with rotations – Robert Wilber - 1989
9061 Introduction to Algorithms – Matteo Frigo, Volker Strumpen - 2009
46 On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof – Richard Cole
31 Sequential access in splay trees takes linear time – R E TARJAN
42 Alternatives to splay trees with O(log n) worst-case access times – John Iacono
619 Data Structures and Network Algorithms – R E Tarjan - 1983
561 The Input/Output complexity of sorting and related problems – A Aggarwal, J S Vitter - 1988
716 Non-Uniform Random Variate Generation – Luc Devroye - 1986
685 Online Computation and Competitive Analysis – A Borodin, R El-Yaniv - 1998