Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference11 articles.
1. Blum, A., Chawla, S., Kalai, A.: Static optimality and dynamic search-optimality in lists and trees. Algorithmica 36(3), 249–260 (2008)
2. Demaine, E., Harmon, D., Iacono, J., Kane, D., Patrǎscu, M.: The geometry of binary search trees. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 496–505 (2009)
3. Derryberry, J., Sleator, D.D., Wang, C.C.: A lower bound framework for binary search trees with rotations. Tech. Rep. CMU-CS-05-187, Carnegie Mellon University (2005)
4. Fredman, M.L.: A priority queue transform. In: Algorithm Engineering (WAE), pp. 243–257 (1999)
5. Fredman, M.L., Sedgewick, R., Sleator, D.D., Tarjan, R.E.: The pairing heap: a new form of self-adjusting heap. Algorithmica 1(1), 111–129 (1986)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献