#### Filter Results:

- Full text PDF available (147)

#### Publication Year

1948

2017

- This year (1)
- Last 5 years (15)
- Last 10 years (40)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ronald L. Graham
- SIAM Journal of Applied Mathematics
- 1969

Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Each copy of any part of a JSTOR transmission must contain the same copyright notice that… (More)

- David S. Johnson, Alan J. Demers, Jeffrey D. Ullman, M. R. Garey, Ronald L. Graham
- SIAM J. Comput.
- 1974

The following abstract problem models several practical problems in computer science and operations research: given a list L of real numbers between 0 and 1, place the elements of L into a minimum number L* of "bins" so that no bin contains numbers whose sum exceeds 1. Motivated by the likelihood that an excessive amount of computation will be required by… (More)

- Fan Chung Graham, Ronald L. Graham, Richard M. Wilson
- Combinatorica
- 1988

We introduce a large equivalence class of graph properties, all of which are shared by so-called random graphs. Unlike random graphs, however, it is often relatively easy to verify that a particular family of graphs possesses some property in this class.

- Fan Chung Graham, Ronald L. Graham, Peter Frankl, James B. Shearer
- J. Comb. Theory, Ser. A
- 1986

A classical topic in combinatorics is the study of problems of the following type: What are the maximum families F of subsets of a finite set with the property that the intersection of any two sets in the family satisfies some specified condition? Typical restrictions on the intersections F n F of any F and F' in F are: (i) FnF'# 0, where all FEF have k… (More)

- Ronald L. Graham, N. J. A. Sloane
- IEEE Trans. Information Theory
- 1985

The covering radius R of a code is the maximal distance of any vector from the code. This work gives a number of new results concerning t[ n, k], the minimal covering radius of any binary code of length n and dimension k. For example r[ n, 41 and t [ n, 51 are determined exactly, and reasonably tight bounds on t[ n, k] are obtained for any k when n is… (More)

- M. R. Garey, Ronald L. Graham, David S. Johnson, Andrew Chi-Chih Yao
- J. Comb. Theory, Ser. A
- 1976

- Fan Chung Graham, Persi Diaconis, Ronald L. Graham
- Discrete Mathematics
- 1992

- Edward G. Coffman, Ronald L. Graham
- Acta Informatica
- 1972

Despite the recognized potential of multiprocessing little is known concerning the general problem of finding efficient algorithms which compute minimallength schedules for given computations and m≧2 processors. In this paper we formulate a general model of computation structures and exhibit an efficient algorithm for finding optimal nonpreemptive schedules… (More)