#### Filter Results:

- Full text PDF available (171)

#### Publication Year

1948

2017

- This year (2)
- Last 5 years (18)
- Last 10 years (46)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's 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… (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)

- 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)

- 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.

- F R Chung, R L Graham
- Proceedings of the National Academy of Sciences…
- 1981

A natural measure of the amount of unavoidable clustering that must occur in any bounded infinite sequence of real numbers is studied. We determine the extreme value for this measure and exhibit sequences that achieve this value.

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

Of particular interest are those B for which the maximum families consist of socalled “kernel systems,” i.e., the family of all supersets of some fixed set in B. For example, we show that the set of all (cyclic) translates of a block of consecutive integers in [n] is such a family. It turns out rather unexpectedly that many of the results we obtain here… (More)

- P Erdős, R L Graham
- 1980

The present paper represents essentially a chapter in a forthcoming "Monographie" in the l Enseignement Mathématique series i ) with the title "Old and new problems and results in combinatorial number theory" by the above authors . Basically we will discuss various problems in elementary number theory, most of which have a combinatorial flavor . In general… (More)

- M. R. Garey, Ronald L. Graham
- SIAM J. Comput.
- 1975

One well-studied model ofa multiprocessing system involves a fixed number n of identical abstract processors, a finite set of tasks to be executed, each requiring a specified amount of computation time, and a partial ordering on the tasks which requires certain tasks to be completed before certain others can be initiated. The nonpreemptive operation of the… (More)