| 2009 |
|---|
| 105 | EE | Minming Li,
Ze Feng,
Nan Zang,
Ronald L. Graham,
Frances F. Yao:
Approximately optimal trees for group key management with batch updates.
Theor. Comput. Sci. 410(11): 1013-1021 (2009) |
| 2008 |
|---|
| 104 | EE | Renshen Wang,
Evangeline F. Y. Young,
Yi Zhu,
Fan Chung Graham,
Ronald L. Graham,
Chung-Kuan Cheng:
3-D floorplanning using labeled tree and dual sequences.
ISPD 2008: 54-59 |
| 103 | EE | Ding-Zhu Du,
Ronald L. Graham,
Panos M. Pardalos,
Peng-Jun Wan,
Weili Wu,
Wenbo Zhao:
Analysis of greedy approximations with nonsubmodular potential functions.
SODA 2008: 167-175 |
| 2007 |
|---|
| 102 | EE | Steve Butler,
Jia Mao,
Ronald L. Graham:
How to Play the Majority Game with Liars.
AAIM 2007: 221-230 |
| 101 | EE | Minming Li,
Ze Feng,
Ronald L. Graham,
Frances F. Yao:
Approximately Optimal Trees for Group Key Management with Batch Updates.
TAMC 2007: 284-295 |
| 100 | EE | Fan R. K. Chung,
Ronald L. Graham,
Jia Mao,
Andrew Chi-Chih Yao:
Oblivious and Adaptive Strategies for the Majority and Plurality Problems.
Algorithmica 48(2): 147-157 (2007) |
| 99 | EE | Ronald L. Graham,
Minming Li,
Frances F. Yao:
Optimal Tree Structures for Group Key Management with Batch Updates.
SIAM J. Discrete Math. 21(2): 532-547 (2007) |
| 2006 |
|---|
| 98 | EE | Yuanfang Hu,
Yi Zhu,
Hongyu Chen,
Ronald L. Graham,
Chung-Kuan Cheng:
Communication latency aware low power NoC synthesis.
DAC 2006: 574-579 |
| 97 | EE | Shuo Zhou,
Yi Zhu,
Yuanfang Hu,
Ronald L. Graham,
Mike Hutton,
Chung-Kuan Cheng:
Timing model reduction for hierarchical timing analysis.
ICCAD 2006: 415-422 |
| 96 | EE | Haikun Zhu,
Chung-Kuan Cheng,
Ronald L. Graham:
On the construction of zero-deficiency parallel prefix circuits with minimum depth.
ACM Trans. Design Autom. Electr. Syst. 11(2): 387-409 (2006) |
| 95 | EE | Ronald L. Graham,
Jeffrey C. Lagarias,
Colin L. Mallows,
Allan R. Wilks,
Catherine H. Yan:
Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings.
Discrete & Computational Geometry 35(1): 1-36 (2006) |
| 94 | EE | Ronald L. Graham,
Jeffrey C. Lagarias,
Colin L. Mallows,
Allan R. Wilks,
Catherine H. Yan:
Apollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions.
Discrete & Computational Geometry 35(1): 37-72 (2006) |
| 93 | EE | Fan R. K. Chung,
Ronald L. Graham,
Ranjita Bhagwan,
Stefan Savage,
Geoffrey M. Voelker:
Maximizing data locality in distributed systems.
J. Comput. Syst. Sci. 72(8): 1309-1316 (2006) |
| 92 | EE | Fan R. K. Chung,
Ronald L. Graham,
Jia Mao,
George Varghese:
Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines.
Theory Comput. Syst. 39(6): 829-849 (2006) |
| 2005 |
|---|
| 91 | EE | Haikun Zhu,
Chung-Kuan Cheng,
Ronald L. Graham:
Constructing zero-deficiency parallel prefix adder of minimum depth.
ASP-DAC 2005: 883-888 |
| 90 | EE | Fan R. K. Chung,
Ronald L. Graham,
Jia Mao,
Andrew Chi-Chih Yao:
Oblivious and Adaptive Strategies for the Majority and Plurality Problems.
COCOON 2005: 329-338 |
| 89 | EE | Ronald L. Graham,
Jeffrey C. Lagarias,
Colin L. Mallows,
Allan R. Wilks,
Catherine H. Yan:
Apollonian Circle Packings: Geometry and Group Theory I. The Apollonian Group.
Discrete & Computational Geometry 34(4): 547-585 (2005) |
| 2004 |
|---|
| 88 | EE | Fan R. K. Chung,
Ronald L. Graham,
George Varghese:
Parallelism versus memory allocation in pipelined router forwarding engines.
SPAA 2004: 103-111 |
| 2003 |
|---|
| 87 | EE | Feng Zhou,
Esther Y. Cheng,
Bo Yao,
Chung-Kuan Cheng,
Ronald L. Graham:
A hierarchical three-way interconnect architecture for hexagonal processors.
SLIP 2003: 133-139 |
| 86 | EE | Bo Yao,
Hongyu Chen,
Chung-Kuan Cheng,
Ronald L. Graham:
Floorplan representations: Complexity and connections.
ACM Trans. Design Autom. Electr. Syst. 8(1): 55-80 (2003) |
| 85 | EE | Fan R. K. Chung,
Ronald L. Graham,
Jia Mao,
Andrew Chi-Chih Yao:
Finding Favorites
Electronic Colloquium on Computational Complexity (ECCC)(078): (2003) |
| 84 | | Fan R. K. Chung,
Ronald L. Graham,
Linyuan Lu:
Guessing Secrets with Inner Product Questions.
Internet Mathematics 1(2): (2003) |
| 2002 |
|---|
| 83 | EE | Esther Y. Cheng,
Feng Zhou,
Bo Yao,
Chung-Kuan Cheng,
Ronald L. Graham:
Balancing the Interconnect Topology for Arrays of Processors between Cost and Power.
ICCD 2002: 180-186 |
| 82 | EE | Fan R. K. Chung,
Ronald L. Graham,
Linyuan Lu:
Guessing secrets with inner product questions.
SODA 2002: 247-253 |
| 81 | EE | Fan R. K. Chung,
Ronald L. Graham:
Sparse Quasi-Random Graphs.
Combinatorica 22(2): 217-244 (2002) |
| 80 | EE | Hung Q. Ngo,
Ding-Zhu Du,
Ronald L. Graham:
New bounds on a hypercube coloring problem.
Inf. Process. Lett. 84(5): 265-269 (2002) |
| 79 | EE | Ronald L. Graham,
Tomasz Luczak,
Vojtech Rödl,
Andrzej Rucinski:
Ramsey Properties of Families of Graphs.
J. Comb. Theory, Ser. B 86(2): 413-419 (2002) |
| 2001 |
|---|
| 78 | EE | Bo Yao,
Hongyu Chen,
Chung-Kuan Cheng,
Ronald L. Graham:
Revisiting floorplan representations.
ISPD 2001: 138-143 |
| 77 | EE | Hung Quang Ngo,
Ding-Zhu Du,
Ronald L. Graham:
New Bounds on a Hypercube Coloring Problem and Linear Codes.
ITCC 2001: 542-546 |
| 76 | EE | Fan R. K. Chung,
Ronald L. Graham,
Frank Thomson Leighton:
Guessing secrets.
SODA 2001: 723-726 |
| 75 | EE | Ronald L. Graham,
Vojtech Rödl,
Andrzej Rucinski:
On Bipartite Graphs with Linear Ramsey Numbers.
Combinatorica 21(2): 199-209 (2001) |
| 74 | EE | Fan R. K. Chung,
Ronald L. Graham,
Frank Thomson Leighton:
Guessing Secrets.
Electr. J. Comb. 8(1): (2001) |
| 73 | EE | Fan R. K. Chung,
Mark W. Garrett,
Ronald L. Graham,
David Shallcross:
Distance Realization Problems with Applications to Internet Tomography.
J. Comput. Syst. Sci. 63(3): 432-448 (2001) |
| 72 | EE | Fan R. K. Chung,
Ronald L. Graham:
Dynamic location problems with limited look-ahead .
Theor. Comput. Sci. 261(2): 213-226 (2001) |
| 2000 |
|---|
| 71 | EE | David W. Boll,
Jerry Donovan,
Ronald L. Graham,
Boris D. Lubachevsky:
Improving Dense Packings of Equal Disks in a Square.
Electr. J. Comb. 7: (2000) |
| 1998 |
|---|
| 70 | EE | Fan R. K. Chung,
Ronald L. Graham:
Combinatorial Problems Arising in Massive Data Sets (Abstract).
COCOON 1998: 2 |
| 69 | EE | Fan R. K. Chung,
Ronald L. Graham:
Forced Convex n -Gons in the Plane.
Discrete & Computational Geometry 19(3): 367-371 (1998) |
| 68 | EE | Ronald L. Graham,
Boris D. Lubachevsky,
Kari J. Nurmela,
Patric R. J. Östergård:
Dense packings of congruent circles in a circle.
Discrete Mathematics 181(1-3): 139-154 (1998) |
| 1997 |
|---|
| 67 | EE | Boris D. Lubachevsky,
Ronald L. Graham:
Curved Hexagonal Packings of Equal Disks in a Circle.
Discrete & Computational Geometry 18(2): 179-194 (1997) |
| 66 | EE | Peng-Jun Wan,
Ding-Zhu Du,
Ronald L. Graham:
The Steiner ratio for the dual normed plane.
Discrete Mathematics 171(1-3): 261-275 (1997) |
| 65 | EE | Fan R. K. Chung,
Ronald L. Graham:
Random walks on generating sets for finite groups.
Electr. J. Comb. 4(2): (1997) |
| 64 | | Fan R. K. Chung,
Ronald L. Graham:
Stratified random walks on the n-cube.
Random Struct. Algorithms 11(3): 199-222 (1997) |
| 1996 |
|---|
| 63 | EE | Ronald L. Graham,
Boris D. Lubachevsky:
Repeated Patterns of Dense Packings of Equal Disks in a Square.
Electr. J. Comb. 3(1): (1996) |
| 62 | | Fan R. K. Chung,
Ronald L. Graham,
S.-T. Yau:
On sampling with Markov chains.
Random Struct. Algorithms 9(1-2): 55-77 (1996) |
| 1995 |
|---|
| 61 | | Boris D. Lubachevsky,
Ronald L. Graham:
Dense Packings of 3k(k+1)+1 Equal Disks in a Circle for k=1, 2, 3, 4 and 5.
COCOON 1995: 303-312 |
| 60 | EE | Biao Gao,
Ding-Zhu Du,
Ronald L. Graham:
A tight lower bound for the Steiner ratio in Minkowski planes.
Discrete Mathematics 142(1-3): 49-63 (1995) |
| 59 | EE | Ronald L. Graham,
Boris D. Lubachevsky:
Dense Packings of Equal Disks in an Equilateral Triangle: from 22 to 34 and Beyond.
Electr. J. Comb. 2: (1995) |
| 58 | EE | Fan R. K. Chung,
Ronald L. Graham:
On the Cover Polynomial of a Digraph.
J. Comb. Theory, Ser. B 65(2): 273-290 (1995) |
| 1994 |
|---|
| 57 | | Ronald L. Graham:
Quasi-Random Combinatorial Structures (Abstract).
ISAAC 1994: 10 |
| 56 | EE | Biao Gao,
Ding-Zhu Du,
Ronald L. Graham:
The Tight Lower Bound for the Steiner Ratio in Minkowski Planes.
Symposium on Computational Geometry 1994: 183-191 |
| 55 | | Joe Buhler,
Ronald L. Graham:
A Note on the Binomial Drop Polynomial of a Poset.
J. Comb. Theory, Ser. A 66(2): 321-326 (1994) |
| 54 | EE | Noga Alon,
Fan R. K. Chung,
Ronald L. Graham:
Routing Permutations on Graphs Via Matchings.
SIAM J. Discrete Math. 7(3): 513-530 (1994) |
| 1993 |
|---|
| 53 | EE | Noga Alon,
Fan R. K. Chung,
Ronald L. Graham:
Routing permutations on graphs via matchings.
STOC 1993: 583-591 |
| 52 | | Ding-Zhu Du,
Biao Gao,
Ronald L. Graham,
Zi-Cheng Liu,
Peng-Jun Wan:
Minimum Steiner Trees in Normed Planes.
Discrete & Computational Geometry 9: 351-370 (1993) |
| 51 | EE | Fan R. K. Chung,
Ronald L. Graham:
On hypergraphs having evenly distributed subhypergraphs.
Discrete Mathematics 111(1-3): 125-129 (1993) |
| 50 | | Peter C. Fishburn,
Ronald L. Graham:
Lexicographic Ramsey Theory.
J. Comb. Theory, Ser. A 62(2): 280-298 (1993) |
| 1992 |
|---|
| 49 | | Paul Erdös,
Ronald L. Graham,
Imre Z. Ruzsa,
Herbert Taylor:
Bounds for arrays of dots with distinct slopes or lengths.
Combinatorica 12(1): 39-44 (1992) |
| 48 | EE | Persi Diaconis,
Ronald L. Graham:
Binomial coefficient codes over GF(2).
Discrete Mathematics 106-107: 181-188 (1992) |
| 47 | EE | Fan R. K. Chung,
Persi Diaconis,
Ronald L. Graham:
Universal cycles for combinatorial structures.
Discrete Mathematics 110(1-3): 43-59 (1992) |
| 46 | | Fan R. K. Chung,
Ronald L. Graham:
Quasi-Random Subsets of Integern.
J. Comb. Theory, Ser. A 61(1): 64-86 (1992) |
| 1990 |
|---|
| 45 | | Ronald L. Graham,
Neil J. A. Sloane:
Penny-Packing and Two-Dimensional Codes.
Discrete & Computational Geometry 5: 1-11 (1990) |
| 44 | EE | Peter Frankl,
Ronald L. Graham,
Vojtech Rödl:
Iterated combinatorial density theorems.
J. Comb. Theory, Ser. A 54(1): 95-111 (1990) |
| 43 | | Fan R. K. Chung,
Ronald L. Graham:
Quasi-Random Hypergraphs.
Random Struct. Algorithms 1(1): 105-124 (1990) |
| 42 | | Persi Diaconis,
Ronald L. Graham,
John A. Morrison:
Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions.
Random Struct. Algorithms 1(1): 51-72 (1990) |
| 1989 |
|---|
| 41 | | Ronald L. Graham,
Andrew Chi-Chih Yao:
On the Improbability of Reaching Byzantine Agreements (Preliminary Version)
STOC 1989: 467-478 |
| 40 | | Fan R. K. Chung,
Ronald L. Graham,
Michael E. Saks:
A dynamic location problem for graphs.
Combinatorica 9(2): 111-131 (1989) |
| 39 | | Fan R. K. Chung,
Ronald L. Graham,
Richard M. Wilson:
Quasi-random graphs.
Combinatorica 9(4): 345-362 (1989) |
| 1988 |
|---|
| 38 | EE | Peter Frankl,
Ronald L. Graham,
Vojtech Rödl:
Quantitative theorems for regular systems of equations.
J. Comb. Theory, Ser. A 47(2): 246-261 (1988) |
| 37 | EE | Fan R. K. Chung,
Zoltán Füredi,
Ronald L. Graham,
Paul D. Seymour:
On induced subgraphs of the cube.
J. Comb. Theory, Ser. A 49(1): 180-187 (1988) |
| 36 | | Fan R. K. Chung,
Zoltán Füredi,
M. R. Garey,
Ronald L. Graham:
On the Fractional Covering Number of Hypergraphs.
SIAM J. Discrete Math. 1(1): 45-49 (1988) |
| 1987 |
|---|
| 35 | EE | Peter Frankl,
Ronald L. Graham,
Vojtech Rödl:
Induced restricted Ramsey theorems for spaces.
J. Comb. Theory, Ser. A 44(1): 120-128 (1987) |
| 34 | EE | Peter Frankl,
Ronald L. Graham:
The Radon transform on Abelian Groups.
J. Comb. Theory, Ser. A 44(1): 168-171 (1987) |
| 33 | EE | Peter Frankl,
Ronald L. Graham,
Vojtech Rödl:
On subsets of abelian groups with no 3-term arithmetic progression.
J. Comb. Theory, Ser. A 45(1): 157-161 (1987) |
| 1986 |
|---|
| 32 | EE | Ronald L. Graham,
Jaroslav Nesetril:
Large minimal sets which force long arithmetic progressions.
J. Comb. Theory, Ser. A 42(2): 270-276 (1986) |
| 31 | EE | Fan R. K. Chung,
Ronald L. Graham,
Peter Frankl,
James B. Shearer:
Some intersection theorems for ordered sets and graphs.
J. Comb. Theory, Ser. A 43(1): 23-37 (1986) |
| 1985 |
|---|
| 30 | | Ronald L. Graham,
Neil J. A. Sloane:
On the covering radius of codes.
IEEE Transactions on Information Theory 31(3): 385-401 (1985) |
| 29 | | Tom C. Brown,
Paul Erdös,
Fan R. K. Chung,
Ronald L. Graham:
Quantitative Forms of a Theorem of Hilbert.
J. Comb. Theory, Ser. A 38(2): 210-216 (1985) |
| 28 | | Ronald L. Graham,
Louis Solomon:
Arrangements in Unitary and Orthogonal Geometry over Finite Fields.
J. Comb. Theory, Ser. A 38(2): 217-229 (1985) |
| 1983 |
|---|
| 27 | | Fan R. K. Chung,
Ronald L. Graham:
Edge-colored complete graphs with precisely colored subgraphs.
Combinatorica 3(3): 315-324 (1983) |
| 26 | | Ronald L. Graham,
F. Frances Yao:
Finding the Convex Hull of a Simple Polygon.
J. Algorithms 4(4): 324-331 (1983) |
| 25 | | Walter A. Deuber,
Ronald L. Graham,
Hans Jürgen Prömel,
Bernd Voigt:
A Canonical Partition Theorem for Equivalence Relations on Zt.
J. Comb. Theory, Ser. A 34(3): 331-339 (1983) |
| 1982 |
|---|
| 24 | | Fan R. K. Chung,
Paul Erdös,
Ronald L. Graham:
Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs.
J. Comb. Theory, Ser. A 32(2): 241-251 (1982) |
| 1981 |
|---|
| 23 | | Fan R. K. Chung,
Paul Erdös,
Ronald L. Graham:
Minimal decompositions of graphs into mutually isomorphic subgraphs.
Combinatorica 1(1): 13-24 (1981) |
| 22 | | Ronald L. Graham,
Wen-Ching Winnie Li,
J. L. Paul:
Homogeneous Collinear Sets in Partitions of Zn.
J. Comb. Theory, Ser. A 31(1): 21-32 (1981) |
| 21 | EE | Fan R. K. Chung,
Ronald L. Graham,
James B. Shearer:
Universal caterpillars.
J. Comb. Theory, Ser. B 31(3): 348-355 (1981) |
| 1980 |
|---|
| 20 | EE | Ronald L. Graham,
Andrew Chi-Chih Yao,
F. Frances Yao:
Information Bounds Are Weak in the Shortest Distance Problem.
J. ACM 27(3): 428-444 (1980) |
| 1978 |
|---|
| 19 | | Fan R. K. Chung,
Ronald L. Graham,
V. E. Hoggatt Jr.,
M. Kleiman:
The Number of Baxter Permutations.
J. Comb. Theory, Ser. A 24(3): 382-394 (1978) |
| 18 | EE | Fan R. K. Chung,
Ronald L. Graham:
On graphs which contain all small trees.
J. Comb. Theory, Ser. B 24(1): 14-23 (1978) |
| 17 | EE | Ronald L. Graham,
Endre Szemerédi:
On subgraph number independence in trees.
J. Comb. Theory, Ser. B 24(2): 213-222 (1978) |
| 1976 |
|---|
| 16 | | M. R. Garey,
Ronald L. Graham,
David S. Johnson:
Some NP-Complete Geometric Problems
STOC 1976: 10-22 |
| 15 | | M. R. Garey,
Ronald L. Graham,
David S. Johnson:
Resource Constrained Scheduling as Generalized Bin Packing.
J. Comb. Theory, Ser. A 21(3): 257-298 (1976) |
| 1975 |
|---|
| 14 | | Ronald L. Graham:
The Largest Small Hexagon.
J. Comb. Theory, Ser. A 18(2): 165-170 (1975) |
| 13 | | Paul Erdös,
Ronald L. Graham:
On Packing Squares with Equal Squares.
J. Comb. Theory, Ser. A 19(1): 119-123 (1975) |
| 12 | | M. R. Garey,
Ronald L. Graham:
Bounds for Multiprocessor Scheduling with Resource Constraints.
SIAM J. Comput. 4(2): 187-200 (1975) |
| 1974 |
|---|
| 11 | | M. R. Garey,
Ronald L. Graham:
Performance Bounds on the Splitting Algorithm for Binary Testing
Acta Inf. 3: 347-355 (1974) |
| 10 | | David S. Johnson,
Alan J. Demers,
Jeffrey D. Ullman,
M. R. Garey,
Ronald L. Graham:
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms.
SIAM J. Comput. 3(4): 299-325 (1974) |
| 1973 |
|---|
| 9 | | M. R. Garey,
Ronald L. Graham:
Bounds on Scheduling with Limited Resources.
SOSP 1973: 104-111 |
| 8 | | Paul Erdös,
Ronald L. Graham,
P. Montgomery,
B. L. Rothschild,
Joel Spencer,
Ernst G. Straus:
Euclidean Ramsey Theorems I.
J. Comb. Theory, Ser. A 14(3): 341-363 (1973) |
| 7 | | Ronald L. Graham:
Covering the Positive Integers by Disjoint Sets of the Form {[n alpha + beta]: n = 1, 2, ...}.
J. Comb. Theory, Ser. A 15(3): 354-358 (1973) |
| 1972 |
|---|
| 6 | | M. R. Garey,
Ronald L. Graham,
Jeffrey D. Ullman:
Worst-Case Analysis of Memory Allocation Algorithms
STOC 1972: 143-150 |
| 5 | | Edward G. Coffman Jr.,
Ronald L. Graham:
Optimal Scheduling for Two-Processor Systems
Acta Inf. 1: 200-213 (1972) |
| 4 | | Ronald L. Graham:
An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set.
Inf. Process. Lett. 1(4): 132-133 (1972) |
| 1969 |
|---|
| 3 | | Ronald L. Graham:
Bounds on Multiprocessing Timing Anomalies.
SIAM Journal of Applied Mathematics 17(2): 416-429 (1969) |
| 1968 |
|---|
| 2 | | A. D. Wyner,
Ronald L. Graham:
An Upper Bound on Minimum Distance for a k-ary Code
Information and Control 13(1): 46-52 (1968) |
| 1 | | Ronald L. Graham:
On Finite 0-Simple Semigroups and Graph Theory.
Mathematical Systems Theory 2(4): 325-339 (1968) |
