Andrew Granville's
2008 publications

with Mike Filaseta and Andrzej Schinzel
  • Article
  • Irreducibility and Greatest Common Divisor Algorithms for Sparse Polynomials
    Number Theory and Polynomials, London Math. Soc lecture notes,
    vol 352 (2008) pages 155--176
  • Article
  • Prime number patterns
    American Mathematical Monthly
    vol 115 (2008) pages 279--296.
    with Ernest S. Croot III, Robin Pemantle and Prasad Tetali
  • Article
  • Running time predictions for factoring algorithms
    Algorithmic Number Theory, ANTS VIII, Banff,
    Springer LNCS vol 5011 (2008) pages 1--36
    with Par Kurlberg
  • Article
  • Poisson statistics via the Chinese Remainder Theorem
    Advances in Mathematics vol 218 (2008) pages 2013-2042
    with K. Soundararajan
  • Article
  • Pretentious multiplicative functions and an inequality for the zeta-function
    Anatomy of Integers, CRM Proceedings, 46 (2008) pages 191--198
    with Aaron Abrams and Rod Canfield
  • Article
  • The number of possibilities for random dating
    Journal of Combinatorial Theory, Series A vol 115 (2008) pages 1265--1271
  • Article
  • Analytic Number Theory,
    Princeton Companion to Mathematics (eds. T. Gowers et al),
    PU press (2008), 322-348
  • Article
  • Smooth numbers: Computational number theory and beyond
    Algorithmic number theory, MSRI Proceedings 44 (2008) pages 267--323
  • Article, and in Italian
  • The Fundamental Theorem of Arithmetic
    in La matematica, Problemi e teoremi, vol II, Einaudi, (2008) pages 131-166