1. Faster algorithms for the shortest path problem;Ahuja;J. Assoc. Comput. Mach.,1990
2. Hash functions for priority queues;Ajtai;Inform. and Comput.,1984
3. Lower bounds for algebraic computation trees;Ben-Or,1983
4. B. Dixon, M. Rauch, and R. E. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time, unpublished manuscript.
5. An alternative to Fibonacci heaps with applications to parallel computation;Driscoll;Comm. ACM,1988