Andrew Granville

Orcid: 0000-0001-8088-1247

According to our database1, Andrew Granville authored at least 20 papers between 1989 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Effective Results on the Size and Structure of Sumsets.
Comb., December, 2023

Primes in Short Intervals: Heuristics and Calculations.
Exp. Math., April, 2023

Proof in the time of machines.
CoRR, 2023

2018
Using Dynamical Systems to Construct Infinitely Many Primes.
Am. Math. Mon., 2018

2017
Squares in Arithmetic Progressions and Infinitely Many Primes.
Am. Math. Mon., 2017

2008
Prime Number Patterns.
Am. Math. Mon., 2008

The number of possibilities for random dating.
J. Comb. Theory A, 2008

Running Time Predictions for Factoring Algorithms.
Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

2006
Prime Number Races.
Am. Math. Mon., 2006

Aurifeuillian factorization.
Math. Comput., 2006

Cycle Lengths in a Permutation are Typically Poisson.
Electron. J. Comb., 2006

2002
Two contradictory conjectures concerning Carmichael numbers.
Math. Comput., 2002

2001
Product of Integers in an Interval, Modulo Squares.
Electron. J. Comb., 2001

1999
Borwein and Bradley's Apérv-Like Formulae for ζ(4n + 3).
Exp. Math., 1999

1995
On a Problem of Hering Concerning Orthogonal Covers of K<sub>n</sub>.
J. Comb. Theory A, 1995

1994
on Sparse Languages L such that LL = Sigma.
Discret. Appl. Math., 1994

On the difficulty of finding reliable witnesses.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1991
Subdesigns in Steiner quadruple systems.
J. Comb. Theory A, 1991

On a paper of Agur, Fraenkel and Klein.
Discret. Math., 1991

1989
On complementary decompositions of the complete graph.
Graphs Comb., 1989


  Loading...