default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonald L. Graham
Ronald Lewis Graham – Ron Graham 0001
Person information
- affiliation: University of California, San Diego, USA
- award (1993): Euler Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j145]Persi Diaconis, Ronald L. Graham, Xiaoyu He
, Sam Spiro:
Card guessing with partial feedback. Comb. Probab. Comput. 31(1): 1-20 (2022)- [j144]Persi Diaconis, Ronald L. Graham, Sam Spiro:
Guessing about Guessing: Practical Strategies for Card Guessing with Feedback. Am. Math. Mon. 129(7): 607-622 (2022) - 2021
- [j143]Fan Chung, Persi Diaconis, Ron Graham:
Permanental generating functions and sequential importance sampling. Adv. Appl. Math. 126: 101916 (2021) - 2020
- [j142]Fan Chung, Ron Graham:
Efficient Packings of Unit Squares in a Large Square. Discret. Comput. Geom. 64(3): 690-699 (2020)
2010 – 2019
- 2019
- [j141]Ilgweon Kang, Fang Qiao, Dongwon Park, Daniel Kane, Evangeline F. Y. Young, Chung-Kuan Cheng, Ronald L. Graham:
Three-dimensional Floorplan Representations by Using Corner Links and Partial Order. ACM Trans. Design Autom. Electr. Syst. 24(1): 13:1-13:33 (2019) - 2018
- [j140]Fan Chung, Jon Folkman, Ron Graham:
Sum sequences modulo n. J. Comb. Theory A 158: 290-314 (2018) - [j139]Joe Buhler, Ron Graham, Alfred W. Hales:
Maximally Nontransitive Dice. Am. Math. Mon. 125(5): 387-399 (2018) - [c32]Chung-Kuan Cheng, Ronald L. Graham, Ilgweon Kang, Dongwon Park, Xinyuan Wang:
Tree Structures and Algorithms for Physical Design. ISPD 2018: 120-125 - 2017
- [j138]Steve Butler, Ron Graham, Catherine H. Yan:
Parking distributions on trees. Eur. J. Comb. 65: 168-185 (2017) - [j137]Fan Chung, Ron Graham:
The drop polynomial of a weighted digraph. J. Comb. Theory B 126: 62-82 (2017) - 2016
- [j136]Oliver Braun, Fan Chung, Ron Graham:
Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions. OR Spectr. 38(2): 531-540 (2016) - [j135]Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh:
Anarchy Is Free in Network Creation. ACM Trans. Algorithms 12(2): 15:1-15:10 (2016) - [j134]Steve Butler, Ron Graham, Richard Stong:
Inserting Plus Signs and Adding. Am. Math. Mon. 123(3): 274-279 (2016) - [j133]Steve Butler, Persi Diaconis, Ron Graham:
The Mathematics of the Flip and Horseshoe Shuffles. Am. Math. Mon. 123(6): 542-556 (2016) - [c31]Fang Qiao, Ilgweon Kang, Daniel Kane, Fung Yu Young, Chung-Kuan Cheng, Ronald L. Graham:
3D floorplan representations: Corner links and partial order. 3DIC 2016: 1-5 - 2015
- [j132]Steve Butler, Fan Chung, Jay Cummings, Ron Graham:
Edge flipping in the complete graph. Adv. Appl. Math. 69: 46-64 (2015) - [j131]Steve Butler, Paul Erdös, Ron Graham:
Egyptian Fractions with Each Denominator Having Three Distinct Prime Divisors. Integers 15: A51 (2015) - [i3]Steve Butler, Ronald L. Graham, Richard Stong:
Partition and sum is fast. CoRR abs/1501.04067 (2015) - 2014
- [j130]Persi Diaconis, Steven N. Evans, Ron Graham:
Unseparated pairs and fixed points in random permutations. Adv. Appl. Math. 61: 102-124 (2014) - [j129]Abbas Alhakim, Steve Butler, Ron Graham:
De Bruijn Sequences with Varying Combs. Integers 14A: A1 (2014) - [j128]Oliver Braun, Fan Chung Graham, Ronald L. Graham:
Single-processor scheduling with time restrictions. J. Sched. 17(4): 399-403 (2014) - 2013
- [j127]Steve Butler, Erik D. Demaine, Ronald L. Graham, Tomohiro Tachi:
Constructing Points through Folding and Intersection. Int. J. Comput. Geom. Appl. 23(1): 49-64 (2013) - [j126]Fan Chung, Ron Graham:
Inversion-descent polynomials for restricted permutations. J. Comb. Theory A 120(2): 366-378 (2013) - [j125]Steve Butler, Ronald L. Graham:
Subdivision Using Angle Bisectors Is Dense in the Space of Triangles. Am. Math. Mon. 120(7): 622-630 (2013) - [c30]Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh:
Anarchy Is Free in Network Creation. WAW 2013: 220-231 - [p1]Ronald L. Graham, Jaroslav Nesetril:
Ramsey Theory in the Work of Paul Erdős. The Mathematics of Paul Erdős II 2013: 171-193 - [e3]Ronald L. Graham, Jaroslav Nesetril, Steve Butler:
The Mathematics of Paul Erdős I. Springer 2013, ISBN 978-1-4614-7257-5 [contents] - [e2]Ronald L. Graham, Jaroslav Nesetril, Steve Butler:
The Mathematics of Paul Erdős II. Springer 2013, ISBN 978-1-4614-7253-7 [contents] - [i2]Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh:
Anarchy is free in network creation. CoRR abs/1307.3113 (2013) - 2012
- [j124]Fan Chung, Ron Graham:
Edge flipping in graphs. Adv. Appl. Math. 48(1): 37-63 (2012) - [j123]Steve Butler, Ronald L. Graham:
A note on marking lines in [k] n - In honor of Rick Wilson's 65th birthday. Des. Codes Cryptogr. 65(3): 165-175 (2012) - [c29]Peng Du, Wenbo Zhao, Shih-Hung Weng, Chung-Kuan Cheng, Ronald L. Graham:
Character design and stamp algorithms for Character Projection Electron-Beam Lithography. ASP-DAC 2012: 725-730 - 2011
- [j122]Joe Buhler, Steve Butler, Ronald L. Graham, Eric Tressler:
Hypercube orientations with only two in-degrees. J. Comb. Theory A 118(6): 1695-1702 (2011) - [j121]Renshen Wang, Yulei Zhang, Nan-Chi Chou, Evangeline F. Y. Young, Chung-Kuan Cheng, Ronald L. Graham:
Bus Matrix Synthesis Based on Steiner Graphs for Power Efficient System-on-Chip Communications. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 30(2): 167-179 (2011) - 2010
- [j120]Steve Butler, Ronald L. Graham, Gerhard Guettler, Colin L. Mallows:
Irreducible Apollonian Configurations and Packings. Discret. Comput. Geom. 44(3): 487-507 (2010) - [j119]Steve Butler, Fan R. K. Chung, Ronald L. Graham, Miklós Laczkovich:
Tiling Polygons with Lattice Triangles. Discret. Comput. Geom. 44(4): 896-903 (2010) - [j118]Steve Butler, Jia Mao, Ronald L. Graham:
How to play the Majority game with a liar. Discret. Math. 310(3): 622-629 (2010) - [j117]Fan R. K. Chung, Anders Claesson, Mark Dukes, Ronald L. Graham:
Descent polynomials for permutations with bounded drop size. Eur. J. Comb. 31(7): 1853-1867 (2010) - [j116]Steve Butler, Kevin P. Costello, Ronald L. Graham:
Finding Patterns Avoiding Many Monochromatic Constellations. Exp. Math. 19(4): 399-411 (2010) - [j115]Ron Graham, József Solymosi:
Some Ramsey-type results for the n-cube. J. Comb. Theory A 117(2): 189-195 (2010) - [c28]Renshen Wang, Evangeline F. Y. Young, Ronald L. Graham, Chung-Kuan Cheng:
Physical synthesis of bus matrix for high bandwidth low power on-chip communications. ISPD 2010: 91-96
2000 – 2009
- 2009
- [j114]Boris D. Lubachevsky, Ronald L. Graham:
Minimum perimeter rectangles that enclose congruent non-overlapping circles. Discret. Math. 309(8): 1947-1962 (2009) - [j113]Fan R. K. Chung, Ronald L. Graham:
Packing equal squares into a large square. J. Comb. Theory A 116(6): 1167-1175 (2009) - [j112]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) - [c27]Ronald L. Graham:
Bubblesort and Juggling Sequences. ISAAC 2009: 1 - 2008
- [j111]Ronald L. Graham, Nan Zang:
Enumerating split-pair arrangements. J. Comb. Theory A 115(2): 293-303 (2008) - [j110]Fan Chung Graham, Ronald L. Graham:
Quasi-random graphs with given degree sequences. Random Struct. Algorithms 32(1): 1-19 (2008) - [j109]Fan Chung Graham, Ronald L. Graham:
Erratum: Quasi-random graphs with given degree sequences. Random Struct. Algorithms 33(4): 536 (2008) - [j108]Fan Chung, Ron Graham:
Primitive Juggling Sequences. Am. Math. Mon. 115(3): 185-194 (2008) - [c26]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 - [c25]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
- [j107]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) - [j106]Ronald L. Graham, Minming Li, Frances F. Yao:
Optimal Tree Structures for Group Key Management with Batch Updates. SIAM J. Discret. Math. 21(2): 532-547 (2007) - [c24]Steve Butler, Jia Mao, Ronald L. Graham:
How to Play the Majority Game with Liars. AAIM 2007: 221-230 - [c23]Minming Li, Ze Feng, Ronald L. Graham, Frances F. Yao:
Approximately Optimal Trees for Group Key Management with Batch Updates. TAMC 2007: 284-295 - 2006
- [j105]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. Discret. Comput. Geom. 35(1): 1-36 (2006) - [j104]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. Discret. Comput. Geom. 35(1): 37-72 (2006) - [j103]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) - [j102]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) - [j101]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) - [c22]Yuanfang Hu, Yi Zhu, Hongyu Chen, Ronald L. Graham, Chung-Kuan Cheng:
Communication latency aware low power NoC synthesis. DAC 2006: 574-579 - [c21]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 - 2005
- [j100]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. Discret. Comput. Geom. 34(4): 547-585 (2005) - [c20]Haikun Zhu, Chung-Kuan Cheng, Ronald L. Graham:
Constructing zero-deficiency parallel prefix adder of minimum depth. ASP-DAC 2005: 883-888 - [c19]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 - 2004
- [c18]Fan R. K. Chung, Ronald L. Graham, George Varghese:
Parallelism versus memory allocation in pipelined router forwarding engines. SPAA 2004: 103-111 - [r1]Ronald L. Graham:
Euclidean Ramsey Theory. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 239-254 - 2003
- [j99]Fan R. K. Chung, Ronald L. Graham, Linyuan Lu:
Guessing Secrets with Inner Product Questions. Internet Math. 1(2): 177-192 (2003) - [j98]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) - [c17]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 - [i1]Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao:
Finding Favorites. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j97]Fan R. K. Chung, Ronald L. Graham:
Sparse Quasi-Random Graphs. Comb. 22(2): 217-244 (2002) - [j96]Hung Q. Ngo, Ding-Zhu Du, Ronald L. Graham:
New bounds on a hypercube coloring problem. Inf. Process. Lett. 84(5): 265-269 (2002) - [j95]Ronald L. Graham, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski:
Ramsey Properties of Families of Graphs. J. Comb. Theory B 86(2): 413-419 (2002) - [c16]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 - [c15]Fan R. K. Chung, Ronald L. Graham, Linyuan Lu:
Guessing secrets with inner product questions. SODA 2002: 247-253 - 2001
- [j94]Fan Chung, Persi Diaconis, Ronald L. Graham:
Combinatorics for the East Model. Adv. Appl. Math. 27(1): 192-206 (2001) - [j93]Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski:
On Bipartite Graphs with Linear Ramsey Numbers. Comb. 21(2): 199-209 (2001) - [j92]Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton:
Guessing Secrets. Electron. J. Comb. 8(1) (2001) - [j91]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) - [j90]Fan R. K. Chung, Ronald L. Graham:
Dynamic location problems with limited look-ahead . Theor. Comput. Sci. 261(2): 213-226 (2001) - [c14]Bo Yao, Hongyu Chen, Chung-Kuan Cheng, Ronald L. Graham:
Revisiting floorplan representations. ISPD 2001: 138-143 - [c13]Hung Quang Ngo, Ding-Zhu Du, Ronald L. Graham:
New Bounds on a Hypercube Coloring Problem and Linear Codes. ITCC 2001: 542-546 - [c12]Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton:
Guessing secrets. SODA 2001: 723-726 - 2000
- [j89]David W. Boll, Jerry Donovan, Ronald L. Graham, Boris D. Lubachevsky:
Improving Dense Packings of Equal Disks in a Square. Electron. J. Comb. 7 (2000) - [j88]Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski:
On graphs with linear Ramsey numbers. J. Graph Theory 35(3): 176-192 (2000)
1990 – 1999
- 1999
- [e1]Ronald L. Graham, Jan Kratochvíl, Jaroslav Nesetril, Fred S. Roberts:
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. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 49, DIMACS/AMS 1999, ISBN 0-8218-0963-6 [contents] - 1998
- [j87]Fan R. K. Chung, Ronald L. Graham:
Forced Convex n -Gons in the Plane. Discret. Comput. Geom. 19(3): 367-371 (1998) - [j86]Ronald L. Graham, Boris D. Lubachevsky, Kari J. Nurmela, Patric R. J. Östergård:
Dense packings of congruent circles in a circle. Discret. Math. 181(1-3): 139-154 (1998) - [c11]Fan R. K. Chung, Ronald L. Graham:
Combinatorial Problems Arising in Massive Data Sets (Abstract). COCOON 1998: 2 - 1997
- [j85]Fan R. K. Chung, Ronald L. Graham:
Random walks on generating sets for finite groups. Electron. J. Comb. 4(2) (1997) - [j84]Boris D. Lubachevsky, Ronald L. Graham:
Curved Hexagonal Packings of Equal Disks in a Circle. Discret. Comput. Geom. 18(2): 179-194 (1997) - [j83]Peng-Jun Wan, Ding-Zhu Du, Ronald L. Graham:
The Steiner ratio for the dual normed plane. Discret. Math. 171(1-3): 261-275 (1997) - [j82]Fan R. K. Chung, Ronald L. Graham:
Stratified random walks on the n-cube. Random Struct. Algorithms 11(3): 199-222 (1997) - 1996
- [j81]Ronald L. Graham, Boris D. Lubachevsky:
Repeated Patterns of Dense Packings of Equal Disks in a Square. Electron. J. Comb. 3(1) (1996) - [j80]Fan R. K. Chung, Ronald L. Graham, Shing-Tung Yau:
On sampling with Markov chains. Random Struct. Algorithms 9(1-2): 55-77 (1996) - 1995
- [j79]Ronald L. Graham, Boris D. Lubachevsky:
Dense Packings of Equal Disks in an Equilateral Triangle: from 22 to 34 and Beyond. Electron. J. Comb. 2 (1995) - [j78]Biao Gao, Ding-Zhu Du, Ronald L. Graham:
A tight lower bound for the Steiner ratio in Minkowski planes. Discret. Math. 142(1-3): 49-63 (1995) - [j77]Fan R. K. Chung, Ronald L. Graham:
On the Cover Polynomial of a Digraph. J. Comb. Theory B 65(2): 273-290 (1995) - [c10]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 - 1994
- [b3]Ronald L. Graham, Donald E. Knuth, Oren Patashnik:
Concrete Mathematics: A Foundation for Computer Science, 2nd Ed. Addison-Wesley 1994, ISBN 0-201-55802-5 - [b2]Ronald L. Graham, Donald E. Knuth, Oren Patashnik:
Concrete mathematics - a foundation for computer science (2. ed.). Addison-Wesley 1994, ISBN 978-0-201-55802-9, pp. I-XIII, 1-657 - [j76]Ronald L. Graham:
Recent trends in Euclidean Ramsey theory. Discret. Math. 136(1-3): 119-127 (1994) - [j75]Joe Buhler, Ronald L. Graham:
A Note on the Binomial Drop Polynomial of a Poset. J. Comb. Theory A 66(2): 321-326 (1994) - [j74]Noga Alon, Fan R. K. Chung, Ronald L. Graham:
Routing Permutations on Graphs Via Matchings. SIAM J. Discret. Math. 7(3): 513-530 (1994) - [c9]Biao Gao, Ding-Zhu Du, Ronald L. Graham:
The Tight Lower Bound for the Steiner Ratio in Minkowski Planes. SCG 1994: 183-191 - [c8]Ronald L. Graham:
Quasi-Random Combinatorial Structures (Abstract). ISAAC 1994: 10 - 1993
- [j73]Ding-Zhu Du, Biao Gao, Ronald L. Graham, Zicheng Liu, Peng-Jun Wan:
Minimum Steiner Trees in Normed Planes. Discret. Comput. Geom. 9: 351-370 (1993) - [j72]Fan R. K. Chung, Ronald L. Graham:
On hypergraphs having evenly distributed subhypergraphs. Discret. Math. 111(1-3): 125-129 (1993) - [j71]Peter C. Fishburn, Ronald L. Graham:
Lexicographic Ramsey Theory. J. Comb. Theory A 62(2): 280-298 (1993) - [c7]Noga Alon, Fan R. K. Chung, Ronald L. Graham:
Routing permutations on graphs via matchings. STOC 1993: 583-591 - 1992
- [j70]Paul Erdös, Ronald L. Graham, Imre Z. Ruzsa, Herbert Taylor:
Bounds for arrays of dots with distinct slopes or lengths. Comb. 12(1): 39-44 (1992) - [j69]Persi Diaconis, Ronald L. Graham:
Binomial coefficient codes over GF(2). Discret. Math. 106-107: 181-188 (1992) - [j68]Fan R. K. Chung, Persi Diaconis, Ronald L. Graham:
Universal cycles for combinatorial structures. Discret. Math. 110(1-3): 43-59 (1992) - [j67]Fan R. K. Chung, Ronald L. Graham:
Quasi-Random Subsets of Integern. J. Comb. Theory A 61(1): 64-86 (1992) - 1991
- [j66]Fan R. K. Chung, Ronald L. Graham:
Quasi-random tournaments. J. Graph Theory 15(2): 173-198 (1991) - 1990
- [j65]Ronald L. Graham, Neil J. A. Sloane:
Penny-Packing and Two-Dimensional Codes. Discret. Comput. Geom. 5: 1-11 (1990) - [j64]Peter Frankl, Ronald L. Graham, Vojtech Rödl:
Iterated combinatorial density theorems. J. Comb. Theory A 54(1): 95-111 (1990) - [j63]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) - [j62]Fan R. K. Chung, Ronald L. Graham:
Quasi-Random Hypergraphs. Random Struct. Algorithms 1(1): 105-124 (1990)
1980 – 1989
- 1989
- [b1]Ronald L. Graham, Donald E. Knuth, Oren Patashnik:
Concrete mathematics - a foundation for computer science. Addison-Wesley 1989, ISBN 978-0-201-14236-5, pp. I-XIII, 1-623 - [j61]Fan R. K. Chung, Ronald L. Graham, Michael E. Saks:
A dynamic location problem for graphs. Comb. 9(2): 111-131 (1989) - [j60]Fan R. K. Chung, Ronald L. Graham, Richard M. Wilson:
Quasi-random graphs. Comb. 9(4): 345-362 (1989) - [j59]Stefan A. Burr, Paul Erdös, Ronald L. Graham, Vera T. Sós:
Maximal antiramsey graphs and the strong chromatic number. J. Graph Theory 13(3): 263-282 (1989) - [c6]Ronald L. Graham, Andrew Chi-Chih Yao:
On the Improbability of Reaching Byzantine Agreements (Preliminary Version). STOC 1989: 467-478 - 1988
- [j58]Peter Frankl, Ronald L. Graham, Vojtech Rödl:
Quantitative theorems for regular systems of equations. J. Comb. Theory A 47(2): 246-261 (1988) - [j57]Fan R. K. Chung, Zoltán Füredi, Ronald L. Graham, Paul D. Seymour:
On induced subgraphs of the cube. J. Comb. Theory A 49(1): 180-187 (1988) - [j56]Fan R. K. Chung, Joel E. Cohen, Ronald L. Graham:
Pursuit - Evasion games on graphs. J. Graph Theory 12(2): 159-167 (1988) - [j55]Fan R. K. Chung, Zoltán Füredi, M. R. Garey, Ronald L. Graham:
On the Fractional Covering Number of Hypergraphs. SIAM J. Discret. Math. 1(1): 45-49 (1988) - 1987
- [j54]Peter Frankl, Ronald L. Graham, Vojtech Rödl:
Induced restricted Ramsey theorems for spaces. J. Comb. Theory A 44(1): 120-128 (1987) - [j53]Peter Frankl, Ronald L. Graham:
The Radon transform on Abelian Groups. J. Comb. Theory A 44(1): 168-171 (1987) - [j52]Peter Frankl, Ronald L. Graham, Vojtech Rödl:
On subsets of abelian groups with no 3-term arithmetic progression. J. Comb. Theory A 45(1): 157-161 (1987) - [j51]Yousef Alavi, Gary Chartrand, Fan R. K. Chung, Paul Erdös, Ronald L. Graham, Ortrud R. Oellermann:
Highly irregular graphs. J. Graph Theory 11(2): 235-249 (1987) - 1986
- [j50]Ronald L. Graham, Jaroslav Nesetril:
Large minimal sets which force long arithmetic progressions. J. Comb. Theory A 42(2): 270-276 (1986) - [j49]Fan R. K. Chung, Ronald L. Graham, Peter Frankl, James B. Shearer:
Some intersection theorems for ordered sets and graphs. J. Comb. Theory A 43(1): 23-37 (1986) - 1985
- [j48]Ronald L. Graham, Pavol Hell:
On the History of the Minimum Spanning Tree Problem. IEEE Ann. Hist. Comput. 7(1): 43-57 (1985) - [j47]Peter Frankl, Ronald L. Graham:
Intersection Theorems for Vector Spaces. Eur. J. Comb. 6(2): 183-187 (1985) - [j46]Fan R. K. Chung, Ronald L. Graham, Peter M. Winkler:
On the addressing problem for directed graphs. Graphs Comb. 1(1): 41-50 (1985) - [j45]Tom C. Brown, Paul Erdös, Fan R. K. Chung, Ronald L. Graham:
Quantitative Forms of a Theorem of Hilbert. J. Comb. Theory A 38(2): 210-216 (1985) - [j44]Peter C. Fishburn, Ronald L. Graham:
Classes of interval graphs under expanding length restrictions. J. Graph Theory 9(4): 459-472 (1985) - [j43]Ronald L. Graham, Neil J. A. Sloane:
On the covering radius of codes. IEEE Trans. Inf. Theory 31(3): 385-401 (1985) - 1983
- [j42]Fan R. K. Chung, Ronald L. Graham:
Edge-colored complete graphs with precisely colored subgraphs. Comb. 3(3): 315-324 (1983) - [j41]Ronald L. Graham, F. Frances Yao:
Finding the Convex Hull of a Simple Polygon. J. Algorithms 4(4): 324-331 (1983) - [j40]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 A 34(3): 331-339 (1983) - [j39]Ronald L. Graham:
Euclidean Ramsey theorems on the n-sphere. J. Graph Theory 7(1): 105-114 (1983) - 1982
- [j38]Fan R. K. Chung, Paul Erdös, Ronald L. Graham:
Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs. J. Comb. Theory A 32(2): 241-251 (1982) - [c5]Ronald L. Graham:
Applications of the FKG Inequality and Its Relatives. ISMP 1982: 115-131 - 1981
- [j37]Fan R. K. Chung, Paul Erdös, Ronald L. Graham:
Minimal decompositions of graphs into mutually isomorphic subgraphs. Comb. 1(1): 13-24 (1981) - [j36]Ronald L. Graham, Wen-Ching Winnie Li, Jerome L. Paul:
Homogeneous Collinear Sets in Partitions of Zn. J. Comb. Theory A 31(1): 21-32 (1981) - [j35]Fan R. K. Chung, Ronald L. Graham, James B. Shearer:
Universal caterpillars. J. Comb. Theory B 31(3): 348-355 (1981) - 1980
- [j34]Ronald L. Graham:
On a Diophantine Equation Arising in Graph Theory. Eur. J. Comb. 1(2): 107-112 (1980) - [j33]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) - [j32]Ronald L. Graham:
On Partitions of En. J. Comb. Theory A 28(1): 89-97 (1980) - [j31]Ronald L. Graham, Miklós Simonovits, Vera T. Sós:
A Note on the Intersection Properties of Subsets of Integers. J. Comb. Theory A 28(1): 106-110 (1980) - [j30]Ronald L. Graham, Shuo-Yen Robert Li, Wen-Ching Winnie Li:
On the Structure of t-Designs. SIAM J. Algebraic Discret. Methods 1(1): 8-14 (1980) - [j29]Ronald L. Graham, Andrew C. Yao, F. Frances Yao:
Some Monotonicity Properties of Partial Orders. SIAM J. Algebraic Discret. Methods 1(3): 251-258 (1980) - [j28]Ronald L. Graham, Neil J. A. Sloane:
On Additive Bases and Harmonious Graphs. SIAM J. Algebraic Discret. Methods 1(4): 382-404 (1980) - [j27]F. R. K. Chung, Peter C. Fishburn, Ronald L. Graham:
On Unimodality for Linear Extensions of Partial Orders. SIAM J. Algebraic Discret. Methods 1(4): 405-410 (1980) - [j26]Ronald L. Graham, Neil J. A. Sloane:
Lower bounds for constant weight codes. IEEE Trans. Inf. Theory 26(1): 37-43 (1980)
1970 – 1979
- 1979
- [j25]Vasek Chvátal, Ronald L. Graham, André F. Perold, Sue Whitesides:
Combinatorial designs related to the strong perfect graph conjecture. Discret. Math. 26(2): 83-92 (1979) - 1978
- [j24]Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao:
Addition chains with multiplicative cost. Discret. Math. 23(2): 115-119 (1978) - [j23]M. R. Garey, Ronald L. Graham, David S. Johnson:
Performance Guarantees for Scheduling Algorithms. Oper. Res. 26(1): 3-21 (1978) - [j22]Fan R. K. Chung, Ronald L. Graham:
On graphs which contain all small trees. J. Comb. Theory B 24(1): 14-23 (1978) - [j21]Ronald L. Graham, Endre Szemerédi:
On subgraph number independence in trees. J. Comb. Theory B 24(2): 213-222 (1978) - [j20]Fan R. K. Chung, Ronald L. Graham, V. E. Hoggatt Jr., Mark Kleiman:
The Number of Baxter Permutations. J. Comb. Theory A 24(3): 382-394 (1978) - 1977
- [j19]Ronald L. Graham, Alan J. Hoffman, H. Hosoya:
On the distance matrix of a directed graph. J. Graph Theory 1(1): 85-88 (1977) - 1976
- [j18]M. Edelberg, M. R. Garey, Ronald L. Graham:
On the distance matrix of a tree. Discret. Math. 14(1): 23-39 (1976) - [j17]M. R. Garey, Ronald L. Graham, David S. Johnson, Andrew Chi-Chih Yao:
Resource Constrained Scheduling as Generalized Bin Packing. J. Comb. Theory A 21(3): 257-298 (1976) - [c4]M. R. Garey, Ronald L. Graham, David S. Johnson:
Some NP-Complete Geometric Problems. STOC 1976: 10-22 - 1975
- [j16]Ronald L. Graham:
The Largest Small Hexagon. J. Comb. Theory A 18(2): 165-170 (1975) - [j15]Paul Erdös, Ronald L. Graham:
On Packing Squares with Equal Squares. J. Comb. Theory A 19(1): 119-123 (1975) - [j14]M. R. Garey, Ronald L. Graham:
Bounds for Multiprocessor Scheduling with Resource Constraints. SIAM J. Comput. 4(2): 187-200 (1975) - 1974
- [j13]M. R. Garey, Ronald L. Graham:
Performance Bounds on the Splitting Algorithm for Binary Testing. Acta Informatica 3: 347-355 (1974) - [j12]Stephen C. Johnson, Ronald L. Graham:
Problem #7. SIGSAM Bull. 8(1): 4 (1974) - [j11]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
- [j10]Paul Erdös, Ronald L. Graham, Peter Montgomery, Bruce Lee Rothschild, Joel Spencer, Ernst G. Straus:
Euclidean Ramsey Theorems I. J. Comb. Theory A 14(3): 341-363 (1973) - [j9]Ronald L. Graham:
Covering the Positive Integers by Disjoint Sets of the Form {[n alpha + beta]: n = 1, 2, ...}. J. Comb. Theory A 15(3): 354-358 (1973) - [c3]M. R. Garey, Ronald L. Graham:
Bounds on Scheduling with Limited Resources. SOSP 1973: 104-111 - 1972
- [j8]Edward G. Coffman Jr., Ronald L. Graham:
Optimal Scheduling for Two-Processor Systems. Acta Informatica 1: 200-213 (1972) - [j7]Ronald L. Graham, Donald E. Knuth, Theodore S. Motzkin:
Complements and transitive closures. Discret. Math. 2(1): 17-29 (1972) - [j6]Ronald L. Graham:
An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set. Inf. Process. Lett. 1(4): 132-133 (1972) - [c2]Ronald L. Graham:
Bounds on multiprocessing anomalies and related packing algorithms. AFIPS Spring Joint Computing Conference 1972: 205-217 - [c1]M. R. Garey, Ronald L. Graham, Jeffrey D. Ullman:
Worst-Case Analysis of Memory Allocation Algorithms. STOC 1972: 143-150
1960 – 1969
- 1969
- [j5]Ronald L. Graham:
Bounds on Multiprocessing Timing Anomalies. SIAM Journal of Applied Mathematics 17(2): 416-429 (1969) - [j4]Arthur D. Friedman, Ronald L. Graham, Jeffrey D. Ullman:
Universal Single Transition Time Asynchronous State Assignments. IEEE Trans. Computers 18(6): 541-547 (1969) - 1968
- [j3]Aaron D. Wyner, Ronald L. Graham:
An Upper Bound on Minimum Distance for a k-ary Code. Inf. Control. 13(1): 46-52 (1968) - [j2]Ronald L. Graham:
On Finite 0-Simple Semigroups and Graph Theory. Math. Syst. Theory 2(4): 325-339 (1968) - 1967
- [j1]Ronald L. Graham:
On n-Valued Functionally Complete Truth Functions. J. Symb. Log. 32(2): 190-195 (1967)
Coauthor Index
[j143] [j142] [j140] [j137] [j136] [j132] [j128] [j126] [j124] [j119] [j117] [j113] [j110] [j109] [j108] [c26] [j107] [j103] [j102] [c19] [c18] [j99] [i1] [j97] [c15] [j94] [j92] [j91] [j90] [c12] [j87] [c11] [j85] [j82] [j80] [j77] [j74] [j72] [c7] [j68] [j67] [j66] [j62] [j61] [j60] [j57] [j56] [j55] [j51] [j49] [j46] [j45] [j42] [j38] [j37] [j35] [j27] [j22] [j20]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-30 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
