Merging priority queues - Data Structures and Problem Solving Using Java - page 891

M. L. Fredman, R. Sedgewick, D. D. Sleator, and R. E. Tarjan, “The Pair-
ing Heap: A New Form of Self-adjusting Heap,” Algorithmica 1 (1986),
111-129.

3.

M. L. Fredman and R. E. Tarjan, “Fibonacci Heaps and Their Uses in
Improved Network Optimization Algorithms,” Journal of the ACM 34
(1987), 596-615.

4.

B. M. E. Moret and H. D. Shapiro, “An Empirical Analysis of Algorithms
for Constructing a Minimum Spanning Tree,” Proceedings of the Second
Workshop on Algorithms and Data Structures (1991), 400-411.

5.

D. D. Sleator and R. E. Tarjan, “Self-adjusting Heaps,” SIAM Journal on
Computing 15 (1986), 52-69.

6.

M. A. Weiss, Data Structures and Algorithm Analysis in Java, 2nd ed.,
Addison-Wesley, Reading, MA, 2007.

7.