论文信息 - Splay trees as priority queues - 字舞流文

Splay trees as priority queues

[1] Erkki Mäkinen. On top-down splaying , 1987, BIT Comput. Sci. Sect..

[2] R. Tarjan. Amortized Computational Complexity , 1985 .

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

[4] Gaston H. Gonnet,et al. Handbook Of Algorithms And Data Structures , 1984 .

[5] Douglas W. Jones,et al. An empirical comparison of priority-queue and event-set implementations , 1986, CACM.

[6] Jeffrey H. Kingston. The amortized complexity of Henriksen's algorithm , 1986, BIT.