1. G. Andrews, The Theory of Partitions, Addison-Wesley, 1976. (Encyclopedia of Mathematics and its Applications, Volume 2.)
2. J. Bentley, B. Weide, and A. Yao, Optimal expected time algorithms for closest point problems, ACM Trans. Math. Soft. 6 (1980), 536–580.
3. J-D. Boissonnat, and M. Teillaud, A hierarchical representation of objects: the Delaunay tree, Proc. 2nd ACM Symp. on Computational Geometry (1986), 260–268.
4. P. Chew, The simplest Voronoi diagram algorithm takes linear expected time, manuscript, 1988.
5. K. Clarkson, Personal communication, 1989.