Ronald L. Graham

172 papers A* 9A 1B 3C 4Misc 3Journal 132Unranked 12
YearRankTypeTitle / Venue / Authors
2025 J jnl
Lower bounds for online scheduling on four processors.
J. Sched.
Oliver Braun, Fan Chung, Ronald L. Graham
2022 J jnl
Card guessing with partial feedback.
Comb. Probab. Comput.
Persi Diaconis, Ronald L. Graham, Xiaoyu He, Sam Spiro
2022 J jnl
Guessing about Guessing: Practical Strategies for Card Guessing with Feedback.
Am. Math. Mon.
Persi Diaconis, Ronald L. Graham, Sam Spiro
2019 J jnl
Three-dimensional Floorplan Representations by Using Corner Links and Partial Order.
ACM Trans. Design Autom. Electr. Syst.
Ilgweon Kang, Fang Qiao, Dongwon Park, Daniel Kane, Evangeline F. Y. Young, Chung-Kuan Cheng, Ronald L. Graham
2018 — conf
Tree Structures and Algorithms for Physical Design.
ISPD
Chung-Kuan Cheng, Ronald L. Graham, Ilgweon Kang, Dongwon Park, Xinyuan Wang
2016 — conf
3D floorplan representations: Corner links and partial order.
3DIC
Fang Qiao, Ilgweon Kang, Daniel Kane, Fung Yu Young, Chung-Kuan Cheng, Ronald L. Graham
2016 J jnl
Anarchy Is Free in Network Creation.
ACM Trans. Algorithms
Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh
2015 J jnl
Partition and sum is fast.
CoRR
Steve Butler, Ronald L. Graham, Richard Stong
2014 J jnl
Single-processor scheduling with time restrictions.
J. Sched.
Oliver Braun, Fan Chung Graham, Ronald L. Graham
2013 C conf
Anarchy Is Free in Network Creation.
WAW
Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh
2013 J jnl
Anarchy is free in network creation.
CoRR
Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh
2013 J jnl
Constructing Points through Folding and Intersection.
Int. J. Comput. Geom. Appl.
Steve Butler, Erik D. Demaine, Ronald L. Graham, Tomohiro Tachi
2013 — ch.
Ramsey Theory in the Work of Paul Erdős.
The Mathematics of Paul Erdős II
Ronald L. Graham, Jaroslav Nesetril
2013 J jnl
Subdivision Using Angle Bisectors Is Dense in the Space of Triangles.
Am. Math. Mon.
Steve Butler, Ronald L. Graham
2013 — book
The Mathematics of Paul Erdős I
Ronald L. Graham, Jaroslav Nesetril, Steve Butler
2013 — book
The Mathematics of Paul Erdős II
Ronald L. Graham, Jaroslav Nesetril, Steve Butler
2012 J jnl
A note on marking lines in [k] n - In honor of Rick Wilson's 65th birthday.
Des. Codes Cryptogr.
Steve Butler, Ronald L. Graham
2012 — conf
Character design and stamp algorithms for Character Projection Electron-Beam Lithography.
ASP-DAC
Peng Du, Wenbo Zhao, Shih-Hung Weng, Chung-Kuan Cheng, Ronald L. Graham
2011 J jnl
Bus Matrix Synthesis Based on Steiner Graphs for Power Efficient System-on-Chip Communications.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Renshen Wang, Yulei Zhang, Nan-Chi Chou, Evangeline F. Y. Young, Chung-Kuan Cheng, Ronald L. Graham
2011 J jnl
Hypercube orientations with only two in-degrees.
J. Comb. Theory A
Joe Buhler, Steve Butler, Ronald L. Graham, Eric Tressler
2010 J jnl
Descent polynomials for permutations with bounded drop size.
Eur. J. Comb.
Fan R. K. Chung, Anders Claesson, Mark Dukes, Ronald L. Graham
2010 J jnl
Finding Patterns Avoiding Many Monochromatic Constellations.
Exp. Math.
Steve Butler, Kevin P. Costello, Ronald L. Graham
2010 J jnl
How to play the Majority game with a liar.
Discret. Math.
Steve Butler, Jia Mao, Ronald L. Graham
2010 J jnl
Irreducible Apollonian Configurations and Packings.
Discret. Comput. Geom.
Steve Butler, Ronald L. Graham, Gerhard Guettler, Colin L. Mallows
2010 — conf
Physical synthesis of bus matrix for high bandwidth low power on-chip communications.
ISPD
Renshen Wang, Evangeline F. Y. Young, Ronald L. Graham, Chung-Kuan Cheng
2010 J jnl
Tiling Polygons with Lattice Triangles.
Discret. Comput. Geom.
Steve Butler, Fan R. K. Chung, Ronald L. Graham, Miklós Laczkovich
2009 J jnl
Approximately optimal trees for group key management with batch updates.
Theor. Comput. Sci.
Minming Li, Ze Feng, Nan Zang, Ronald L. Graham, Frances F. Yao
2009 B conf
Bubblesort and Juggling Sequences.
ISAAC
Ronald L. Graham
2009 J jnl
Minimum perimeter rectangles that enclose congruent non-overlapping circles.
Discret. Math.
Boris D. Lubachevsky, Ronald L. Graham
2009 J jnl
Packing equal squares into a large square.
J. Comb. Theory A
Fan R. K. Chung, Ronald L. Graham
2008 — conf
3-D floorplanning using labeled tree and dual sequences.
ISPD
Renshen Wang, Evangeline F. Y. Young, Yi Zhu, Fan Chung Graham, Ronald L. Graham, Chung-Kuan Cheng
2008 A* conf
Analysis of greedy approximations with nonsubmodular potential functions.
SODA
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, Peng-Jun Wan, Weili Wu, Wenbo Zhao
2008 J jnl
Enumerating split-pair arrangements.
J. Comb. Theory A
Ronald L. Graham, Nan Zang
2008 J jnl
Erratum: Quasi-random graphs with given degree sequences.
Random Struct. Algorithms
Fan Chung Graham, Ronald L. Graham
2008 J jnl
Quasi-random graphs with given degree sequences.
Random Struct. Algorithms
Fan Chung Graham, Ronald L. Graham
2007 C conf
Approximately Optimal Trees for Group Key Management with Batch Updates.
TAMC
Minming Li, Ze Feng, Ronald L. Graham, Frances F. Yao
2007 C conf
How to Play the Majority Game with Liars.
AAIM
Steve Butler, Jia Mao, Ronald L. Graham
2007 J jnl
Oblivious and Adaptive Strategies for the Majority and Plurality Problems.
Algorithmica
Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao
2007 J jnl
Optimal Tree Structures for Group Key Management with Batch Updates.
SIAM J. Discret. Math.
Ronald L. Graham, Minming Li, Frances F. Yao
2006 J jnl
Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings.
Discret. Comput. Geom.
Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan
2006 J jnl
Apollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions.
Discret. Comput. Geom.
Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan
2006 A* conf
Communication latency aware low power NoC synthesis.
DAC
Yuanfang Hu, Yi Zhu, Hongyu Chen, Ronald L. Graham, Chung-Kuan Cheng
2006 J jnl
Maximizing data locality in distributed systems.
J. Comput. Syst. Sci.
Fan R. K. Chung, Ronald L. Graham, Ranjita Bhagwan, Stefan Savage, Geoffrey M. Voelker
2006 J jnl
On the construction of zero-deficiency parallel prefix circuits with minimum depth.
ACM Trans. Design Autom. Electr. Syst.
Haikun Zhu, Chung-Kuan Cheng, Ronald L. Graham
2006 J jnl
Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines.
Theory Comput. Syst.
Fan R. K. Chung, Ronald L. Graham, Jia Mao, George Varghese
2006 A conf
Timing model reduction for hierarchical timing analysis.
ICCAD
Shuo Zhou, Yi Zhu, Yuanfang Hu, Ronald L. Graham, Mike Hutton, Chung-Kuan Cheng
2005 J jnl
Apollonian Circle Packings: Geometry and Group Theory I. The Apollonian Group.
Discret. Comput. Geom.
Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan
2005 — conf
Constructing zero-deficiency parallel prefix adder of minimum depth.
ASP-DAC
Haikun Zhu, Chung-Kuan Cheng, Ronald L. Graham
2005 Misc conf
Oblivious and Adaptive Strategies for the Majority and Plurality Problems.
COCOON
Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao
2004 — ch.
Euclidean Ramsey Theory.
Handbook of Discrete and Computational Geometry, 2nd Ed.
Ronald L. Graham
2004 B conf
Parallelism versus memory allocation in pipelined router forwarding engines.
SPAA
Fan R. K. Chung, Ronald L. Graham, George Varghese
2003 — conf
A hierarchical three-way interconnect architecture for hexagonal processors.
SLIP
Feng Zhou, Esther Y. Cheng, Bo Yao, Chung-Kuan Cheng, Ronald L. Graham
2003 J jnl
Finding Favorites
Electron. Colloquium Comput. Complex.
Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao
2003 J jnl
Floorplan representations: Complexity and connections.
ACM Trans. Design Autom. Electr. Syst.
Bo Yao, Hongyu Chen, Chung-Kuan Cheng, Ronald L. Graham
2003 J jnl
Guessing Secrets with Inner Product Questions.
Internet Math.
Fan R. K. Chung, Ronald L. Graham, Linyuan Lu
2002 C conf
Balancing the Interconnect Topology for Arrays of Processors between Cost and Power.
ICCD
Esther Y. Cheng, Feng Zhou, Bo Yao, Chung-Kuan Cheng, Ronald L. Graham
2002 A* conf
Guessing secrets with inner product questions.
SODA
Fan R. K. Chung, Ronald L. Graham, Linyuan Lu
2002 J jnl
New bounds on a hypercube coloring problem.
Inf. Process. Lett.
Hung Q. Ngo, Ding-Zhu Du, Ronald L. Graham
2002 J jnl
Ramsey Properties of Families of Graphs.
J. Comb. Theory B
Ronald L. Graham, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski
2002 J jnl
Sparse Quasi-Random Graphs.
Comb.
Fan R. K. Chung, Ronald L. Graham
2001 J jnl
Combinatorics for the East Model.
Adv. Appl. Math.
Fan Chung, Persi Diaconis, Ronald L. Graham
2001 J jnl
Distance Realization Problems with Applications to Internet Tomography.
J. Comput. Syst. Sci.
Fan R. K. Chung, Mark W. Garrett, Ronald L. Graham, David Shallcross
2001 J jnl
Dynamic location problems with limited look-ahead .
Theor. Comput. Sci.
Fan R. K. Chung, Ronald L. Graham
2001 J jnl
Guessing Secrets.
Electron. J. Comb.
Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton
2001 A* conf
Guessing secrets.
SODA
Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton
2001 — conf
New Bounds on a Hypercube Coloring Problem and Linear Codes.
ITCC
Hung Quang Ngo, Ding-Zhu Du, Ronald L. Graham
2001 J jnl
On Bipartite Graphs with Linear Ramsey Numbers.
Comb.
Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski
2001 — conf
Revisiting floorplan representations.
ISPD
Bo Yao, Hongyu Chen, Chung-Kuan Cheng, Ronald L. Graham
2000 J jnl
Improving Dense Packings of Equal Disks in a Square.
Electron. J. Comb.
David W. Boll, Jerry Donovan, Ronald L. Graham, Boris D. Lubachevsky
2000 J jnl
On graphs with linear Ramsey numbers.
J. Graph Theory
Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski
1999 — ed.
Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, Proceedings of a DIMACS Workshop, Stirín Castle, Czech Republic, May 19-25, 1997
Contemporary Trends in Discrete Mathematics
Ronald L. Graham, Jan Kratochvíl, Jaroslav Nesetril, Fred S. Roberts
1998 Misc conf
Combinatorial Problems Arising in Massive Data Sets (Abstract).
COCOON
Fan R. K. Chung, Ronald L. Graham
1998 J jnl
Dense packings of congruent circles in a circle.
Discret. Math.
Ronald L. Graham, Boris D. Lubachevsky, Kari J. Nurmela, Patric R. J. Östergård
1998 J jnl
Forced Convex n -Gons in the Plane.
Discret. Comput. Geom.
Fan R. K. Chung, Ronald L. Graham
1997 J jnl
Curved Hexagonal Packings of Equal Disks in a Circle.
Discret. Comput. Geom.
Boris D. Lubachevsky, Ronald L. Graham
1997 J jnl
Random walks on generating sets for finite groups.
Electron. J. Comb.
Fan R. K. Chung, Ronald L. Graham
1997 J jnl
Stratified random walks on the n-cube.
Random Struct. Algorithms
Fan R. K. Chung, Ronald L. Graham
1997 J jnl
The Steiner ratio for the dual normed plane.
Discret. Math.
Peng-Jun Wan, Ding-Zhu Du, Ronald L. Graham
1996 J jnl
On sampling with Markov chains.
Random Struct. Algorithms
Fan R. K. Chung, Ronald L. Graham, Shing-Tung Yau
1996 J jnl
Repeated Patterns of Dense Packings of Equal Disks in a Square.
Electron. J. Comb.
Ronald L. Graham, Boris D. Lubachevsky
1995 J jnl
A tight lower bound for the Steiner ratio in Minkowski planes.
Discret. Math.
Biao Gao, Ding-Zhu Du, Ronald L. Graham
1995 Misc conf
Dense Packings of 3k(k+1)+1 Equal Disks in a Circle for k=1, 2, 3, 4 and 5.
COCOON
Boris D. Lubachevsky, Ronald L. Graham
1995 J jnl
Dense Packings of Equal Disks in an Equilateral Triangle: from 22 to 34 and Beyond.
Electron. J. Comb.
Ronald L. Graham, Boris D. Lubachevsky
1995 J jnl
On the Cover Polynomial of a Digraph.
J. Comb. Theory B
Fan R. K. Chung, Ronald L. Graham
1994 J jnl
A Note on the Binomial Drop Polynomial of a Poset.
J. Comb. Theory A
Joe Buhler, Ronald L. Graham
1994 — book
Concrete Mathematics: A Foundation for Computer Science, 2nd Ed.
Ronald L. Graham, Donald E. Knuth, Oren Patashnik
1994 — book
Concrete mathematics - a foundation for computer science (2. ed.).
Ronald L. Graham, Donald E. Knuth, Oren Patashnik
1994 B conf
Quasi-Random Combinatorial Structures (Abstract).
ISAAC
Ronald L. Graham
1994 J jnl
Recent trends in Euclidean Ramsey theory.
Discret. Math.
Ronald L. Graham
1994 J jnl
Routing Permutations on Graphs Via Matchings.
SIAM J. Discret. Math.
Noga Alon, Fan R. K. Chung, Ronald L. Graham
1994 — conf
The Tight Lower Bound for the Steiner Ratio in Minkowski Planes.
SCG
Biao Gao, Ding-Zhu Du, Ronald L. Graham
1993 J jnl
Lexicographic Ramsey Theory.
J. Comb. Theory A
Peter C. Fishburn, Ronald L. Graham
1993 J jnl
Minimum Steiner Trees in Normed Planes.
Discret. Comput. Geom.
Ding-Zhu Du, Biao Gao, Ronald L. Graham, Zicheng Liu, Peng-Jun Wan
1993 J jnl
On hypergraphs having evenly distributed subhypergraphs.
Discret. Math.
Fan R. K. Chung, Ronald L. Graham
1993 A* conf
Routing permutations on graphs via matchings.
STOC
Noga Alon, Fan R. K. Chung, Ronald L. Graham
1992 J jnl
Binomial coefficient codes over GF(2).
Discret. Math.
Persi Diaconis, Ronald L. Graham
1992 J jnl
Bounds for arrays of dots with distinct slopes or lengths.
Comb.
Paul Erdös, Ronald L. Graham, Imre Z. Ruzsa, Herbert Taylor
1992 J jnl
Quasi-Random Subsets of Integer
J. Comb. Theory A
Fan R. K. Chung, Ronald L. Graham
1992 J jnl
Universal cycles for combinatorial structures.
Discret. Math.
Fan R. K. Chung, Persi Diaconis, Ronald L. Graham
1991 J jnl
Quasi-random tournaments.
J. Graph Theory
Fan R. K. Chung, Ronald L. Graham
1990 J jnl
Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions.
Random Struct. Algorithms
Persi Diaconis, Ronald L. Graham, John A. Morrison
1990 J jnl
Iterated combinatorial density theorems.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham, Vojtech Rödl
1990 J jnl
Penny-Packing and Two-Dimensional Codes.
Discret. Comput. Geom.
Ronald L. Graham, Neil J. A. Sloane
1990 J jnl
Quasi-Random Hypergraphs.
Random Struct. Algorithms
Fan R. K. Chung, Ronald L. Graham
1989 J jnl
A dynamic location problem for graphs.
Comb.
Fan R. K. Chung, Ronald L. Graham, Michael E. Saks
1989 — book
Concrete mathematics - a foundation for computer science.
Ronald L. Graham, Donald E. Knuth, Oren Patashnik
1989 J jnl
Maximal antiramsey graphs and the strong chromatic number.
J. Graph Theory
Stefan A. Burr, Paul Erdös, Ronald L. Graham, Vera T. Sós
1989 A* conf
On the Improbability of Reaching Byzantine Agreements (Preliminary Version)
STOC
Ronald L. Graham, Andrew Chi-Chih Yao
1989 J jnl
Quasi-random graphs.
Comb.
Fan R. K. Chung, Ronald L. Graham, Richard M. Wilson
1988 J jnl
On induced subgraphs of the cube.
J. Comb. Theory A
Fan R. K. Chung, Zoltán Füredi, Ronald L. Graham, Paul D. Seymour
1988 J jnl
On the Fractional Covering Number of Hypergraphs.
SIAM J. Discret. Math.
Fan R. K. Chung, Zoltán Füredi, M. R. Garey, Ronald L. Graham
1988 J jnl
Pursuit - Evasion games on graphs.
J. Graph Theory
Fan R. K. Chung, Joel E. Cohen, Ronald L. Graham
1988 J jnl
Quantitative theorems for regular systems of equations.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham, Vojtech Rödl
1987 J jnl
Highly irregular graphs.
J. Graph Theory
Yousef Alavi, Gary Chartrand, Fan R. K. Chung, Paul Erdös, Ronald L. Graham, Ortrud R. Oellermann
1987 J jnl
Induced restricted Ramsey theorems for spaces.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham, Vojtech Rödl
1987 J jnl
On subsets of abelian groups with no 3-term arithmetic progression.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham, Vojtech Rödl
1987 J jnl
The Radon transform on Abelian Groups.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham
1986 J jnl
Large minimal sets which force long arithmetic progressions.
J. Comb. Theory A
Ronald L. Graham, Jaroslav Nesetril
1986 J jnl
Some intersection theorems for ordered sets and graphs.
J. Comb. Theory A
Fan R. K. Chung, Ronald L. Graham, Peter Frankl, James B. Shearer
1985 J jnl
Classes of interval graphs under expanding length restrictions.
J. Graph Theory
Peter C. Fishburn, Ronald L. Graham
1985 J jnl
Intersection Theorems for Vector Spaces.
Eur. J. Comb.
Peter Frankl, Ronald L. Graham
1985 J jnl
On the History of the Minimum Spanning Tree Problem.
IEEE Ann. Hist. Comput.
Ronald L. Graham, Pavol Hell
1985 J jnl
On the addressing problem for directed graphs.
Graphs Comb.
Fan R. K. Chung, Ronald L. Graham, Peter M. Winkler
1985 J jnl
On the covering radius of codes.
IEEE Trans. Inf. Theory
Ronald L. Graham, Neil J. A. Sloane
1985 J jnl
Quantitative Forms of a Theorem of Hilbert.
J. Comb. Theory A
Tom C. Brown, Paul Erdös, Fan R. K. Chung, Ronald L. Graham
1983 J jnl
A Canonical Partition Theorem for Equivalence Relations on Z
J. Comb. Theory A
Walter A. Deuber, Ronald L. Graham, Hans Jürgen Prömel, Bernd Voigt
1983 J jnl
Edge-colored complete graphs with precisely colored subgraphs.
Comb.
Fan R. K. Chung, Ronald L. Graham
1983 J jnl
Euclidean Ramsey theorems on the
J. Graph Theory
Ronald L. Graham
1983 J jnl
Finding the Convex Hull of a Simple Polygon.
J. Algorithms
Ronald L. Graham, F. Frances Yao
1982 — conf
Applications of the FKG Inequality and Its Relatives.
ISMP
Ronald L. Graham
1982 J jnl
Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs.
J. Comb. Theory A
Fan R. K. Chung, Paul Erdös, Ronald L. Graham
1981 J jnl
Homogeneous Collinear Sets in Partitions of Z
J. Comb. Theory A
Ronald L. Graham, Wen-Ching Winnie Li, Jerome L. Paul
1981 J jnl
Minimal decompositions of graphs into mutually isomorphic subgraphs.
Comb.
Fan R. K. Chung, Paul Erdös, Ronald L. Graham
1981 J jnl
Universal caterpillars.
J. Comb. Theory B
Fan R. K. Chung, Ronald L. Graham, James B. Shearer
1980 J jnl
A Note on the Intersection Properties of Subsets of Integers.
J. Comb. Theory A
Ronald L. Graham, Miklós Simonovits, Vera T. Sós
1980 J jnl
Information Bounds Are Weak in the Shortest Distance Problem.
J. ACM
Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao
1980 J jnl
Lower bounds for constant weight codes.
IEEE Trans. Inf. Theory
Ronald L. Graham, Neil J. A. Sloane
1980 J jnl
On Additive Bases and Harmonious Graphs.
SIAM J. Algebraic Discret. Methods
Ronald L. Graham, Neil J. A. Sloane
1980 J jnl
On Partitions of E
J. Comb. Theory A
Ronald L. Graham
1980 J jnl
On Unimodality for Linear Extensions of Partial Orders.
SIAM J. Algebraic Discret. Methods
F. R. K. Chung, Peter C. Fishburn, Ronald L. Graham
1980 J jnl
On a Diophantine Equation Arising in Graph Theory.
Eur. J. Comb.
Ronald L. Graham
1980 J jnl
On the Structure of t-Designs.
SIAM J. Algebraic Discret. Methods
Ronald L. Graham, Shuo-Yen Robert Li, Wen-Ching Winnie Li
1980 J jnl
Some Monotonicity Properties of Partial Orders.
SIAM J. Algebraic Discret. Methods
Ronald L. Graham, Andrew C. Yao, F. Frances Yao
1979 J jnl
Combinatorial designs related to the strong perfect graph conjecture.
Discret. Math.
Vasek Chvátal, Ronald L. Graham, André F. Perold, Sue Whitesides
1978 J jnl
Addition chains with multiplicative cost.
Discret. Math.
Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao
1978 J jnl
On graphs which contain all small trees.
J. Comb. Theory B
Fan R. K. Chung, Ronald L. Graham
1978 J jnl
On subgraph number independence in trees.
J. Comb. Theory B
Ronald L. Graham, Endre Szemerédi
1978 J jnl
Performance Guarantees for Scheduling Algorithms.
Oper. Res.
M. R. Garey, Ronald L. Graham, David S. Johnson
1978 J jnl
The Number of Baxter Permutations.
J. Comb. Theory A
Fan R. K. Chung, Ronald L. Graham, V. E. Hoggatt Jr., Mark Kleiman
1977 J jnl
On the distance matrix of a directed graph.
J. Graph Theory
Ronald L. Graham, Alan J. Hoffman, H. Hosoya
1976 J jnl
On the distance matrix of a tree.
Discret. Math.
M. Edelberg, M. R. Garey, Ronald L. Graham
1976 J jnl
Resource Constrained Scheduling as Generalized Bin Packing.
J. Comb. Theory A
M. R. Garey, Ronald L. Graham, David S. Johnson, Andrew Chi-Chih Yao
1976 A* conf
Some NP-Complete Geometric Problems
STOC
M. R. Garey, Ronald L. Graham, David S. Johnson
1975 J jnl
Bounds for Multiprocessor Scheduling with Resource Constraints.
SIAM J. Comput.
M. R. Garey, Ronald L. Graham
1975 J jnl
On Packing Squares with Equal Squares.
J. Comb. Theory A
Paul Erdös, Ronald L. Graham
1975 J jnl
The Largest Small Hexagon.
J. Comb. Theory A
Ronald L. Graham
1974 J jnl
Performance Bounds on the Splitting Algorithm for Binary Testing.
Acta Informatica
M. R. Garey, Ronald L. Graham
1974 J jnl
Problem #7.
SIGSAM Bull.
Stephen C. Johnson, Ronald L. Graham
1974 J jnl
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms.
SIAM J. Comput.
David S. Johnson, Alan J. Demers, Jeffrey D. Ullman, M. R. Garey, Ronald L. Graham
1973 A* conf
Bounds on Scheduling with Limited Resources.
SOSP
M. R. Garey, Ronald L. Graham
1973 J jnl
Covering the Positive Integers by Disjoint Sets of the Form {[n alpha + beta]: n = 1, 2, ...}.
J. Comb. Theory A
Ronald L. Graham
1973 J jnl
Euclidean Ramsey Theorems I.
J. Comb. Theory A
Paul Erdös, Ronald L. Graham, Peter Montgomery, Bruce Lee Rothschild, Joel Spencer, Ernst G. Straus
1972 J jnl
An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set.
Inf. Process. Lett.
Ronald L. Graham
1972 — conf
Bounds on multiprocessing anomalies and related packing algorithms.
AFIPS Spring Joint Computing Conference
Ronald L. Graham
1972 J jnl
Complements and transitive closures.
Discret. Math.
Ronald L. Graham, Donald E. Knuth, Theodore S. Motzkin
1972 J jnl
Optimal Scheduling for Two-Processor Systems.
Acta Informatica
Edward G. Coffman Jr., Ronald L. Graham
1972 A* conf
Worst-Case Analysis of Memory Allocation Algorithms
STOC
M. R. Garey, Ronald L. Graham, Jeffrey D. Ullman
1969 J jnl
Bounds on Multiprocessing Timing Anomalies.
SIAM Journal of Applied Mathematics
Ronald L. Graham
1969 J jnl
Universal Single Transition Time Asynchronous State Assignments.
IEEE Trans. Computers
Arthur D. Friedman, Ronald L. Graham, Jeffrey D. Ullman
1968 J jnl
An Upper Bound on Minimum Distance for a k-ary Code
Inf. Control.
Aaron D. Wyner, Ronald L. Graham
1968 J jnl
On Finite 0-Simple Semigroups and Graph Theory.
Math. Syst. Theory
Ronald L. Graham
1967 J jnl
On n-Valued Functionally Complete Truth Functions.
J. Symb. Log.
Ronald L. Graham