1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman.The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)
2. M. R. Brown. Implementation and analysis of binomial queue algorithms,SIAM J. Comput. 7, 298–319 (1978)
3. C. A. Crane. Linear lists and priority queues as balanced binary trees, (Ph.D. Thesis)STAN-CS-72-259, Computer Science Department. Stanford University (February 1972)
4. D. B. Johnson. Efficient special purpose priority queues,Proc. 15th Annual Allerton Conference on Communication, Control, andComputing. Department of Electrical Engineering and the Coordinated Science Laboratory, University of Illinois, 1–7 (1977)
5. D. B. Johnson. Efficient algorithms for shortest paths in sparse networks,J. ACM 24, 1–13 (1977)