Robert E. Tarjan, Amortized Computational Complexity,
SIAM J. Alg. Disc.
Meth., 6, No. 2, April 1985, 306-318.
Richard Bird, Geraint Jones, Oege de Moor, More haste, less speed: lazy versus eager evaluation,
J. Functional Programming, Nov. 1997,
1-6.
Gerth Stølting Brodal,
Chapter 7, Worst-Case Efficient Priority Queues,
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete
Algorithms, 52-58.
James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan,
Relaxed Heaps: an Alternative to Fibonacci Heaps with
Applications to Parallel Computation , ACM, 31
No. 11,
November 1988, 1341-1354.
Nicholas Pippenger, Pure Versus Impure Lisp ,
23rd ACM Conf. on Principles of Programming Languages, 1996, 104-109.
Peter Høyer, A General Technique for Implementation of
Efficient Priority Queues, www.brics.dk/~hoyer/ Short version
in Proc. 3rd Israel Symp. on Theory of Computing and
Systems (ISTCS) 1995, IEEE Computer Society Press, 57-66.
Gary L. Peterson,
A Balanced Tree Scheme for Meldable Heaps With Updates,
Technical Report GIT-ICS-87-23,
School of Information and Computer Science, Georgia
Institute of Technology, 1987.
M. L. Fredman and R. E. Tarjan,
Fibonacci heaps and their uses in improved network
optimization algorithms,
J. Assoc. Comput. Mach., 34 (1987), 596--615.
Timothy M. Chan, Remarks on k-Level Algorithms in the Plane,
July 7, 1999, 1-17.
Julien Basch, Leonidas J. Guibas, John Hershberger,
Data Structures for Mobile Data,
Proceedings of the Eighth Annual ACM-SIAM Symposium
on Discrete Algorithms, 1997, 747-756.
Demet Aksoy, Michael Franklin,
Scheduling for Large-Scale On-Demand Data Broadcasting,
Proc.~IEEE INFOCOM Conf., San Francisco, CA, 1998, 651-659.
