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
30 Sequential access in splay trees takes linear time – R E Tarjan - 1985
45 On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof – Richard Cole
42 Alternatives to splay trees with O(log n) worst-case access times – J Iacono - 2001
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
6 Mihai Pǎtra¸scu. Dynamic optimality — almost – Erik D Demaine, Dion Harmon, John Iacono
9 On the competitiveness of linear search – J I Munro - 2000
8 A simplified and dynamic unified structure – Mihai Bădoiu, Erik D. Demaine - 2004
114 Optimum binary search trees – D Knuth - 1971
176 Tarjan. Scaling and related techniques for geometry problems – H N Gabow, J L Bentley, R E - 1984
12 Canonical forms for competitive binary search tree algorithms – J M Lucas - 1988
7 A lower bound framework for binary search trees with rotations – Jonathan Derryberry, Daniel Dominic Sleator, Chengwen Chris Wang - 2005
8 The geometry of binary search trees – Erik D. Demaine, Dion Harmon, John Iacono, Daniel Kane - 2009
177 An algorithm for the organization of information – G Adelson-Velskii, E M Landis - 1962
16 Optimal Biweighted Binary Trees And The Complexity Of Maintaining Partial Sums – Haripriyan Hampapuram, Michael, Michael L. Fredman, Siam J. Comput C - 1998
16 o(loglogn)-competitive dynamic binary search trees – C C Wang, J Derryberry, D D Sleator - 2006
21 Static Optimality and Dynamic Search-Optimality in Lists and Trees – Avrim Blum, Shuchi Chawla, Adam Kalai - 2002
49 sleator and Robert endre tarjan, “Self-Adjusting Binary Search Trees – Daniel dominic - 1985
20 Tight bounds for the partial-sums problem – Mihai Pǎtrascu, Erik D. Demaine - 2004