Ronald L. Graham

From MaRDI portal
Person:1065803

Available identifiers

zbMath Open graham.ronald-lWikidataQ712620 ScholiaQ712620MaRDI QIDQ1065803

List of research outcomes

PublicationDate of PublicationType
Dense packings of 3k(k+1)+1 equal disks in a circle for k = 1, 2, 3, 4, and 52023-12-12Paper
Card guessing with partial feedback2023-03-31Paper
On Levine’s notorious hat puzzle2022-08-12Paper
Guessing about Guessing: Practical Strategies for Card Guessing with Feedback2022-08-03Paper
https://portal.mardi4nfdi.de/entity/Q33904272022-03-24Paper
Permanental generating functions and sequential importance sampling2021-04-23Paper
https://portal.mardi4nfdi.de/entity/Q51336432020-11-10Paper
Efficient packings of unit squares in a large square2020-10-23Paper
Card Guessing with Partial Feedback2020-10-10Paper
Slow Fibonacci walks2020-01-31Paper
Reflections on a Theme of Ulam2019-06-12Paper
Permutations resilient to deletions2019-01-24Paper
Anarchy Is Free in Network Creation2018-10-30Paper
The Digraph Drop Polynomial2018-10-09Paper
Explicit Error Bounds for Lattice Edgeworth Expansions2018-10-09Paper
Sum sequences modulo \(n\)2018-07-18Paper
Inserting Plus Signs and Adding2018-07-12Paper
The Mathematics of the Flip and Horseshoe Shuffles2018-07-12Paper
Maximally Nontransitive Dice2018-07-11Paper
Well dispersed sequences in \([0,1^{d}\)]2018-05-02Paper
https://portal.mardi4nfdi.de/entity/Q45912942017-11-14Paper
Statistical problems involving permutations with restricted positions2017-10-09Paper
Unseparated pairs and fixed points in random permutations2017-10-05Paper
Juggling card sequences2017-09-20Paper
Parking distributions on trees2017-08-31Paper
The drop polynomial of a weighted digraph2017-08-22Paper
Reflections on Paul Erdős on His Birth Centenary2016-06-15Paper
The matrix cover polynomial2016-05-25Paper
Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions2016-05-04Paper
On the discrepancy of circular sequences of reals2016-04-13Paper
https://portal.mardi4nfdi.de/entity/Q34625052016-01-15Paper
CONSTRUCTING POINTS THROUGH FOLDING AND INTERSECTION2015-12-22Paper
https://portal.mardi4nfdi.de/entity/Q34499432015-10-30Paper
Magical Mathematics2015-10-28Paper
Edge flipping in the complete graph2015-08-21Paper
https://portal.mardi4nfdi.de/entity/Q52620532015-07-09Paper
Routing permutations on graphs via matchings2015-05-07Paper
Coefficients of the Inflated Eulerian Polynomial2015-04-05Paper
Single-processor scheduling with time restrictions2015-01-22Paper
Anarchy Is Free in Network Creation2015-01-13Paper
Unrolling Residues to Avoid Progressions2014-11-12Paper
On the history of the Euclidean Steiner tree problem2014-07-01Paper
Address of the Chairman of the Fields Medal Commitee2014-06-03Paper
Paul Erdős and Egyptian Fractions2014-05-19Paper
Generalized Eulerian sums2014-04-11Paper
An interstice relationship for flowers with four petals2014-03-24Paper
Juggling mathematics and magic2014-01-24Paper
Subdivision Using Angle Bisectors Is Dense in the Space of Triangles2013-10-29Paper
https://portal.mardi4nfdi.de/entity/Q28556362013-10-25Paper
ORIGAMI RINGS2013-04-24Paper
Preface to the John Selfridge Memorial Issue2013-01-17Paper
Inversion-descent polynomials for restricted permutations2013-01-10Paper
A note on marking lines in \([k^n\)]2012-11-28Paper
Finding Patterns Avoiding Many Monochromatic Constellations2012-08-31Paper
https://portal.mardi4nfdi.de/entity/Q28801012012-04-12Paper
https://portal.mardi4nfdi.de/entity/Q32240762012-03-29Paper
Enumerating (Multiplex) juggling sequences2012-01-24Paper
Edge flipping in graphs2011-12-08Paper
Magical Mathematics2011-11-15Paper
Hypercube orientations with only two in-degrees2011-06-17Paper
Shuffling with ordered cards2011-06-14Paper
Can You Hear the Shape of a Beatty Sequence?2011-05-06Paper
https://portal.mardi4nfdi.de/entity/Q30635342011-01-03Paper
Open Problems in Euclidean Ramsey Theory2010-12-20Paper
https://portal.mardi4nfdi.de/entity/Q30608562010-12-13Paper
Irreducible Apollonian configurations and packings2010-11-08Paper
Tiling polygons with lattice triangles2010-11-08Paper
Descent polynomials for permutations with bounded drop size2010-10-18Paper
A symmetrical Eulerian identity2010-08-30Paper
https://portal.mardi4nfdi.de/entity/Q35794422010-08-06Paper
Some Ramsey-type results for the \(n\)-cube2010-04-27Paper
How to play the majority game with a liar2010-03-29Paper
Packing equal squares into a large square2009-11-26Paper
The elementary proof of the prime number theorem2009-09-25Paper
Minimum perimeter rectangles that enclose congruent non-overlapping circles2009-06-19Paper
Approximately optimal trees for group key management with batch updates2009-03-20Paper
Primitive Juggling Sequences2009-02-26Paper
Jumping sequences2008-11-21Paper
https://portal.mardi4nfdi.de/entity/Q35094022008-07-01Paper
Optimal Tree Structures for Group Key Management with Batch Updates2008-05-22Paper
Enumerating split-pair arrangements2008-03-06Paper
Quasi‐random graphs with given degree sequences2008-01-18Paper
How to Play the Majority Game with Liars2008-01-04Paper
Approximately Optimal Trees for Group Key Management with Batch Updates2007-11-13Paper
Oblivious and adaptive strategies for the majority and plurality problems2007-10-10Paper
On minimal colorings without monochromatic solutions to a linear equation2007-08-22Paper
https://portal.mardi4nfdi.de/entity/Q57544842007-08-22Paper
https://portal.mardi4nfdi.de/entity/Q57544912007-08-22Paper
https://portal.mardi4nfdi.de/entity/Q34248772007-03-05Paper
Parallelism versus memory allocation in pipelined router forwarding engines2007-01-25Paper
https://portal.mardi4nfdi.de/entity/Q34150152007-01-12Paper
Maximizing data locality in distributed systems2006-12-07Paper
Apollonian circle packings: Geometry and group theory. II: Super-Apollonian group and integral packings2006-03-21Paper
Apollonian circle packings: Geometry and group theory. III: Higher dimensions2006-03-21Paper
Apollonian circle packings: Geometry and group theory. I: The Apollonian group2006-03-02Paper
Computing and Combinatorics2006-01-11Paper
https://portal.mardi4nfdi.de/entity/Q56927182005-09-28Paper
A discrete Fourier kernel and Fraenkel's tiling conjecture2005-09-07Paper
Guessing Secrets with Inner Product Questions2005-04-11Paper
Generalized de Bruijn cycles2004-12-13Paper
https://portal.mardi4nfdi.de/entity/Q48289392004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q48235152004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q44323052003-12-08Paper
https://portal.mardi4nfdi.de/entity/Q44100132003-10-13Paper
Ramsey properties of families of graphs2003-08-20Paper
Apollonian circle packings: Number theory2003-06-25Paper
Combinatorics for the East model2003-03-13Paper
New bounds on a hypercube coloring problem.2003-01-21Paper
On the History of the Minimum Spanning Tree Problem2002-11-25Paper
Sparse quasi-random graphs2002-11-03Paper
On the Set of Common Differences in van der Waerden’s Theorem on Arithmetic Progressions2002-10-10Paper
Distance realization problems with applications to internet tomography2002-07-04Paper
On bipartite graphs with linear Ramsey numbers2002-02-13Paper
https://portal.mardi4nfdi.de/entity/Q27683722002-01-30Paper
Dynamic location problems with limited look-ahead2001-08-23Paper
On graphs with linear Ramsey numbers2001-07-23Paper
Guessing secrets2001-02-19Paper
Improving dense packings of equal disks in a square2000-11-30Paper
The graph of generating sets of an abelian group2000-11-22Paper
On the limit of a recurrence relation1999-11-29Paper
https://portal.mardi4nfdi.de/entity/Q42565821999-07-25Paper
https://portal.mardi4nfdi.de/entity/Q44009981998-08-02Paper
Forced convex \(n\)-gons in the plane1998-06-08Paper
The Steiner ratio for the dual normed plane1998-06-01Paper
Stratified random walks on then-cube1998-04-19Paper
Dense packings of congruent circles in a circle1998-04-01Paper
Patterns and structures in disk packings1998-03-26Paper
https://portal.mardi4nfdi.de/entity/Q43826591998-03-22Paper
Curved hexagonal packings of equal disks in a circle1998-02-17Paper
Random walks on generating sets for finite groups1998-02-15Paper
https://portal.mardi4nfdi.de/entity/Q43770871998-02-09Paper
On Schur properties of random subsets of integers1998-01-14Paper
https://portal.mardi4nfdi.de/entity/Q47181911997-07-20Paper
On sampling with Markov chains1997-04-22Paper
https://portal.mardi4nfdi.de/entity/Q56890081997-03-11Paper
https://portal.mardi4nfdi.de/entity/Q48786601996-11-25Paper
Complete sequences of sets of integer powers1996-09-25Paper
Pebbling a Chessboard1996-08-22Paper
Repeated patterns of dense packings of equal disks in a square1996-07-21Paper
On the cover polynomial of a digraph1996-06-05Paper
https://portal.mardi4nfdi.de/entity/Q48738021996-04-21Paper
https://portal.mardi4nfdi.de/entity/Q46974511995-10-08Paper
A tight lower bound for the Steiner ratio in Minkowski planes1995-08-27Paper
Juggling Drops and Descents1995-06-08Paper
Routing Permutations on Graphs via Matchings1995-05-14Paper
Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond1995-04-06Paper
https://portal.mardi4nfdi.de/entity/Q43247541995-03-02Paper
Recent trends in Euclidean Ramsey theory1995-02-13Paper
https://portal.mardi4nfdi.de/entity/Q43205351995-02-01Paper
A note on the binomial drop polynomial of a poset1994-07-04Paper
On hypergraphs having evenly distributed subhypergraphs1994-04-13Paper
Graceful Configurations in the Plane1993-12-06Paper
The Sperner capacity of linear and nonlinear codes for the cyclic triangle1993-10-13Paper
https://portal.mardi4nfdi.de/entity/Q31364541993-10-03Paper
Lexicographic Ramsey theory1993-06-29Paper
Minimum Steiner trees in normed planes1993-06-16Paper
https://portal.mardi4nfdi.de/entity/Q40407971993-06-05Paper
Universal cycles for combinatorial structures1993-05-16Paper
Cohomological Aspects of Hypergraphs1993-04-01Paper
Binomial coefficient codes over GF(2)1993-01-16Paper
An affine walk on the hypercube1992-10-26Paper
Quasi-random subsets of \(\mathbb{Z}_ n\)1992-10-05Paper
Bounds for arrays of dots with distinct slopes or lengths1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39970751992-09-17Paper
https://portal.mardi4nfdi.de/entity/Q39727601992-06-26Paper
Iterated combinatorial density theorems1992-06-25Paper
Quantitative versions of combinatorial partition theorems.1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39723081992-06-25Paper
Quasi-Random Set Systems1992-06-25Paper
Quasi-random tournaments1991-01-01Paper
Penny-packing and two-dimensional codes1990-01-01Paper
A Whirlwind Tour of Computational Geometry1990-01-01Paper
Asymptotic analysis of a random walk on a hypercube with many dimensions1990-01-01Paper
Quasi-random hypergraphs1990-01-01Paper
A dynamic location problem for graphs1989-01-01Paper
Quasi-random graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32030581989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34746541989-01-01Paper
Steiner Trees on a Checkerboard1989-01-01Paper
Maximal antiramsey graphs and the strong chromatic number1989-01-01Paper
Quasi-random hypergraphs1989-01-01Paper
On induced subgraphs of the cube1988-01-01Paper
Quantitative theorems for regular systems of equations1988-01-01Paper
Quasi-random graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38000881988-01-01Paper
Pursuit—Evasion games on graphs1988-01-01Paper
On the Fractional Covering Number of Hypergraphs1988-01-01Paper
The Radon transform on abelian groups1987-01-01Paper
Induced restricted Ramsey theorems for spaces1987-01-01Paper
On subsets of abelian groups with no 3-term arithmetic progression1987-01-01Paper
Random walks arising in random number generation1987-01-01Paper
A New Result on Comma-Free Codes of Even Word-Length1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37705731987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859651987-01-01Paper
Highly irregular graphs1987-01-01Paper
Large minimal sets which force arithmetic progressions1986-01-01Paper
Some intersection theorems for ordered sets and graphs1986-01-01Paper
Corrigendum to "On Isometric Embeddings of Graphs"1986-01-01Paper
Quantitative forms of a theorem of Hilbert1985-01-01Paper
Intersection theorems for vector spaces1985-01-01Paper
On the addressing problem for directed graphs1985-01-01Paper
The Radon transform on \({\mathbb{Z}}^ k_ 2\)1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36892031985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36897701985-01-01Paper
On Isometric Embeddings of Graphs1985-01-01Paper
On the covering radius of codes1985-01-01Paper
Classes of interval graphs under expanding length restrictions1985-01-01Paper
Anti-Hadamard matrices1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32167001984-01-01Paper
Isometric embeddings of graphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32181661984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36792231984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36809311984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36891951984-01-01Paper
Edge-colored complete graphs with precisely colored subgraphs1983-01-01Paper
A canonical partition theorem for equivalence relations on \(Z^ n\).1983-01-01Paper
The mathematics of perfect shuffles1983-01-01Paper
Finding the convex hull of a simple polygon1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32181561983-01-01Paper
Euclidean Ramsey theorems on the n‐sphere1983-01-01Paper
On Universal Graphs for Spanning Trees1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51849531983-01-01Paper
The Steiner problem in phylogeny is NP-complete1982-01-01Paper
Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time1982-01-01Paper
Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39521411982-01-01Paper
On Graphs Which Contain All Sparse Graphs1982-01-01Paper
Tiling Rectangles with Rectangles1982-01-01Paper
Homogeneous collinear sets in partitions of \(Z^ n\).1981-01-01Paper
On the permanents of complements of the direct sum of identity matrices1981-01-01Paper
On Steiner trees for bounded point sets1981-01-01Paper
The analysis of sequential experiments with feedback to subjects1981-01-01Paper
Minimal decompositions of graphs into mutually isomorphic subgraphs1981-01-01Paper
Universal caterpillars1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36694241981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39076001981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39150221981-01-01Paper
Efficient Realization Techniques for Network Flow Patterns1981-01-01Paper
On irregularities of distribution of real sequences1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39197421981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39553911981-01-01Paper
On partitions of \(\mathbb E^n\)1980-01-01Paper
A note on the intersection properties of subsets of integers1980-01-01Paper
On a Diophantine equation arising in graph theory1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38725281980-01-01Paper
Lower bounds for constant weight codes1980-01-01Paper
On the bases with an exact order1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38985251980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39030021980-01-01Paper
Information Bounds Are Weak in the Shortest Distance Problem1980-01-01Paper
On the Structure oft-Designs1980-01-01Paper
On Additive Bases and Harmonious Graphs1980-01-01Paper
On Unimodality for Linear Extensions of Partial Orders1980-01-01Paper
Old and new problems and results in combinatorial number theory: van der Waerden's theorem and related topics1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39105701979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39344291979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39414511979-01-01Paper
A General Ramsey Product Theorem1979-01-01Paper
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979-01-01Paper
On graphs which contain all small trees1978-01-01Paper
Distance matrix polynomials of trees1978-01-01Paper
On subgraph number independence in trees1978-01-01Paper
The number of Baxter permutations1978-01-01Paper
Maximum antichains in the partition lattice1978-01-01Paper
Performance Guarantees for Scheduling Algorithms1978-01-01Paper
Steiner Trees for Ladders1978-01-01Paper
Complexity Results for Bandwidth Minimization1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41705101978-01-01Paper
Spectra of Numbers1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41776091978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41825291978-01-01Paper
Distance matrix polynomials of trees1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41863411978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42000871978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42000901978-01-01Paper
On permutations containing no long arithmetic progressions1977-01-01Paper
On the distance matrix of a directed graph1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41539361977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41633081977-01-01Paper
The Complexity of Computing Steiner Minimal Trees1977-01-01Paper
On the distance matrix of a tree1976-01-01Paper
Resource constrained scheduling as generalized bin packing1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41001041976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41019701976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41151871976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41219681976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41248891976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41451401976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41558351976-01-01Paper
On multicolor Ramsey numbers for complete bipartite graphs1975-01-01Paper
The largest small hexagon1975-01-01Paper
On cubical graphs1975-01-01Paper
On packing squares with equal squares1975-01-01Paper
On sparse graphs with dense long paths1975-01-01Paper
On the Prime Factors of \binom2nn1975-01-01Paper
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40717511975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40872291975-01-01Paper
Bounds for Multiprocessor Scheduling with Resource Constraints1975-01-01Paper
Performance bounds on the splitting algorithm for binary testing1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40589641974-01-01Paper
Are There n + 2 Points in E n With Odd Integral Distances?1974-01-01Paper
A Short Proof of van der Waerden's Theorem on Arithmetic Progressions1974-01-01Paper
Euclidean Ramsey theorems. I1973-01-01Paper
Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta: n=1,2,\dots \}\)]1973-01-01Paper
Increasing paths in edge ordered graphs1973-01-01Paper
Errata to ``Ramsey's theorem for a class of categories1973-01-01Paper
Complements and transitive closures1972-01-01Paper
Ramsey's Theorem for a Class of Categories1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56440331972-01-01Paper
On a linear diophantine problem of Frobenius1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56639041972-01-01Paper
On highly non-associative groupoids1972-01-01Paper
An efficient algorithm for determining the convex hull of a finite planar set1972-01-01Paper
Ramsey's theorem for a class of categories1972-01-01Paper
On tightest packings in the Minkowski plane1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41331081972-01-01Paper
A Constructive Solution to a Tournament Problem1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56167201971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56183831971-01-01Paper
On the Addressing Problem for Loop Switching1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56384061971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56411471971-01-01Paper
Ramsey's Theorem for n-Parameter Sets1971-01-01Paper
Optimal scheduling for two-processor systems1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40430961971-01-01Paper
Note on a Nonlinear Recurrence Related to <tex-math>$\sqrt{2}$</tex-math>1970-01-01Paper
On Subtrees of Directed Graphs with No Path of Length Exceeding One1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56251731970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56264241970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56264651970-01-01Paper
ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS1970-01-01Paper
Irregularities in the distributions of finite sequences1970-01-01Paper
An Irreducibility Criterion for Polynomials Over the Integers1969-01-01Paper
Some Results on Matching in Bipartite Graphs1969-01-01Paper
Ramsey’s theorem for 𝑛-dimensional arrays1969-01-01Paper
Bounds on Multiprocessing Timing Anomalies1969-01-01Paper
A Packing Inequality for Compact Convex Subsets of the Plane1969-01-01Paper
On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon1968-01-01Paper
On the Distribution of Modulo 11968-01-01Paper
Bounds for Certain Multiprocessing Anomalies1968-01-01Paper
An upper bound on minimum distance for a k-ary code1968-01-01Paper
On finite 0-simple semigroups and graph theory1968-01-01Paper
On η-valued functionally complete truth functions1967-01-01Paper
On Partitions of an Equilateral Triangle1967-01-01Paper
On partitions of a finite set1966-01-01Paper
On the Number of Information Symbols in Difference-Set Cyclic Codes1966-01-01Paper
The Solution of a Certain Recurrence1966-01-01Paper
On the Decomposition of Lattice-Periodic Functions1965-01-01Paper
On Finite Sums of Unit Fractions1964-01-01Paper
On finite sums of reciprocals of distinct \(n\)th powers1964-01-01Paper
Complete sequences of polynomial values1964-01-01Paper
A Fibonacci-Like Sequence of Composite Numbers1964-01-01Paper
On a conjecture of Erdös in additive number theory1964-01-01Paper
On Quadruples of Consecutive kth Power Residues1964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53402241964-01-01Paper
A theorem on partitions1963-01-01Paper
On A Theorem of Uspensky1963-01-01Paper
A Combinatorial Theorem for Partial Sums1963-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ronald L. Graham