• Publications
  • Influence
Concrete mathematics - a foundation for computer science
From the Publisher: This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solidExpand
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
This work examines the performance of a number of simple algorithms which obtain “good” placements and shows that neither the first-fit nor the best-fit algorithm will ever use more than $\frac{17}{10}L^ * + 2$ bins. Expand
Quasi-random graphs
A large equivalence class of graph properties is introduced, all of which are shared by so-called random graphs, and it is often relatively easy to verify that a particular family of graphs possesses some property in this class. Expand
Spearman's Footrule as a Measure of Disarray
SUMMARY Spearman's measure of disarray D is the sum of the absolute values of the difference between the ranks. We treat D as a metric on the set of permutations. The limiting mean, variance andExpand
An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set
  • R. Graham
  • Computer Science
  • Inf. Process. Lett.
  • 1 June 1972
P can be chosen to I&E the centroid oC the triangle formed by X, y and z and Express each si E S in polar coordinates th origin P and 8 = 0 in the direction of zu~ arhitnry fixed half-line L from P. Expand
Some intersection theorems for ordered sets and graphs
On etablit quelques theoremes d'intersections pour les ensembles ordonnes et les graphes en utilisant la fonction d'entropie
On the History of the Minimum Spanning Tree Problem
There are several apparently independent sources and algorithmic solutions of the minimum spanning tree problem and their motivations, and they have appeared in Czechoslovakia, France, and Poland, going back to the beginning of this century. Expand