The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ronald L. Graham: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  99. Bubblesort and Juggling Sequences. [Citation Graph (, )][DBLP]


  100. 3-D floorplanning using labeled tree and dual sequences. [Citation Graph (, )][DBLP]


  101. Physical synthesis of bus matrix for high bandwidth low power on-chip communications. [Citation Graph (, )][DBLP]


  102. Analysis of greedy approximations with nonsubmodular potential functions. [Citation Graph (, )][DBLP]


  103. Irreducible Apollonian Configurations and Packings. [Citation Graph (, )][DBLP]


  104. Minimum perimeter rectangles that enclose congruent non-overlapping circles. [Citation Graph (, )][DBLP]


  105. How to play the Majority game with a liar. [Citation Graph (, )][DBLP]


  106. Descent polynomials for permutations with bounded drop size. [Citation Graph (, )][DBLP]


Search in 0.018secs, Finished in 0.626secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002