Splay trees as priority queues

References

• Gonnet , G. H. 1984 . Handbook of Algorithms and Data Structures , Reading, Mass : Addison-Wesley .
   Google Scholar
• Jones , D. W. 1986 . An empirical comparison of priority queue and event-set implementations . Comm. ACM , 29 : 300 – 311 .
   Web of Science ®Google Scholar
• Kingston , J. H. 1985 . Analysis of tree algorithms for the simulation event list . Acta Inform. , 22 : 15 – 33 .
   Google Scholar
• Kingston , J. H. 1986 . The amortized complexity of Henriksen's algorithm . BIT , 26 : 156 – 163 .
   Google Scholar
• Mäkinen , E. 1987 . On top-down splaying . BIT , 27 : 330 – 339 .
   Google Scholar
• Sleator , D. D. and Tarjan , R. E. 1985 . Self-adjusting binary search trees . J. ACM , 32 : 652 – 686 .
   Web of Science ®Google Scholar
• Tarjan , R. E. 1985 . Amortized computational complexity . SIAM J. Appl. Disc. Meth. , 6 : 306 – 318 .
   Google Scholar