An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.
The antipode construction for sphere packings.
What Are All the Best Sphere Packings in Low Dimensions?
Penny-Packing and Two-Dimensional Codes.
On expections of integral quadratic forms.
The sphere packing problem.
Minimal-Energy Clusters of Hard Spheres.
On Cayley's enumeration of alkanes (or 4-valent trees).
Approximate squaring.
On kissing numbers in dimensions 32 to 128.
The EKG sequence.
Sloping binary numbers: a new sequence related to the binary numbers.
A slow-growing sequence defined by an unusual recurrence.
Acyclic digraphs and eigenvalues of -matrices.
Page 1