论文信息 - Implementing Online GreedyFuture - 字舞流文

Implementing Online GreedyFuture

Brent Heeringa | Donny Huang | D. Huang | Brent Heeringa

[1] Norman Abramson,et al. Information theory and coding , 1963 .

[2] Robert E. Tarjan,et al. Rotation distance, triangulations, and hyperbolic geometry , 1986, STOC '86.

[3] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.

[4] Ben Pfaff,et al. Performance analysis of BSTs in system software , 2004, SIGMETRICS '04/Performance '04.

[5] Quentin F. Stout,et al. Tree rebalancing in optimal time and space , 1986, CACM.

[6] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[7] Erik D. Demaine,et al. Dynamic optimality - almost [competitive online binary search tree] , 2007, 45th Annual IEEE Symposium on Foundations of Computer Science.

[8] Daniel Dominic Sleator,et al. O(log log n)-competitive dynamic binary search trees , 2006, SODA '06.

[9] Robert E. Tarjan,et al. Sequential access in splay trees takes linear time , 1985, Comb..

[10] Robert E. Wilber. Lower Bounds for Accessing Binary Search Trees with Rotations , 1989, SIAM J. Comput..

[11] J. Ian Munro,et al. On the Competitiveness of Linear Search , 2000, ESA.

[12] Kyle Fox,et al. Upper Bounds for Maximally Greedy Binary Search Trees , 2011, WADS.

[13] Ben Pfa. Performance Analysis of BSTs in System Software , 2004 .