David Harvey

Senior Lecturer at the School of Mathematics and Statistics, University of New South Wales.

Contact details

email: d DOT harvey AT unsw DOT edu DOT au (PGP public key)
phone: +61 (2) 9385-7088
office: 6108 Red Centre
postal: School of Mathematics and Statistics, University of New South Wales, Sydney NSW 2052, Australia

Research interests

Computational number theory and arithmetic geometry, polynomial and integer arithmetic


Publications and preprints

(click on the publication title for more details)

  1. On the complexity of integer matrix multiplication (with Joris van der Hoeven)
  2. Faster polynomial multiplication over finite fields (with Joris van der Hoeven and Grégoire Lecerf)
  3. Fast polynomial multiplication over F_(2^60) (with Joris van der Hoeven and Grégoire Lecerf)
    To appear in proceedings of ISSAC 2016.
  4. Computing Hasse–Witt matrices of hyperelliptic curves in average polynomial time, II (with Andrew Sutherland)
    To appear in “Frobenius distributions: Lang–Trotter and Sato–Tate conjectures”, Contemporary Mathematics 663, AMS.
  5. Even faster integer multiplication (with Joris van der Hoeven and Grégoire Lecerf)
    To appear in the Journal of Complexity.
  6. Computing zeta functions of arithmetic schemes
    Proc. Lond. Math. Soc. 111 (2015), no. 6, 1379–1401.
  7. Computing Hasse–Witt matrices of hyperelliptic curves in average polynomial time (with Andrew Sutherland)
    LMS J. Comput. Math. 17 (2014), Special Issue A, 257–273.
  8. Counting points on hyperelliptic curves in average polynomial time
    Ann. of Math. (2) 179 (2014), no. 2, 783–803.
  9. A search for Wilson primes (with Edgar Costa and Robert Gerbicz)
    Math. Comp. 83 (2014), 3071–3091.
  10. A subquadratic algorithm for computing the n-th Bernoulli number
    Math. Comp. 83 (2014), 2471–2477.
  11. Faster arithmetic for number-theoretic transforms
    J. Symb. Comp. 60 (2014) 113–119.
  12. Faster deterministic integer factorization (with Edgar Costa)
    Math. Comp. 83 (2014), 339–345.
  13. Statistics of different reduction types of Fermat curves (with Igor Shparlinski)
    Exper. Math. 22 (2013), no. 3, 243–249.
  14. The Karatsuba integer middle product
    J. Symb. Comp. 47 (2012), 954–967.
  15. Fast computation of Bernoulli, Tangent and Secant numbers (with Richard Brent)
    Springer Proceedings in Mathematics & Statistics, Vol. 50, 2013, 127–142.
  16. Short division of long integers (with Paul Zimmermann)
    Proceedings of ARITH 20, 2011, 7–14.
  17. Characterizing projective spaces on deformations of Hilbert schemes of K3 surfaces (with Brendan Hassett and Yuri Tschinkel)
    Comm. Pure Appl. Math. 65 (2012), no. 2, 264–286.
  18. An in-place truncated Fourier transform and applications to polynomial multiplication (with Daniel Roche)
    Proceedings of ISSAC 2010, 325–329.
  19. Irregular primes to 163 million (with Joe Buhler)
    Math. Comp. 80 (2011), 2435–2444.
  20. Faster exponentials of power series
  21. Faster algorithms for the square root and reciprocal of power series
    Math. Comp. 80 (2011), 387–394.
  22. A multimodular algorithm for computing Bernoulli numbers
    Math. Comp. 79 (2010), 2361–2370.
  23. Faster polynomial multiplication via multipoint Kronecker substitution
    J. Symb. Comp. 44 (2009), 1502–1510.
  24. A cache-friendly truncated FFT
    Theor. Comput. Sci. 410 (2009), 2649–2658.
  25. Algorithms for p-adic cohomology and p-adic heights
    Ph.D. thesis.
  26. Efficient computation of p-adic heights
    LMS J. Comput. Math. 11 (2008), 40–59.
  27. Kedlaya's algorithm in larger characteristic
    Int Math Res Notices 2007 (2007), no. rnm095, rnm095–29.
  28. Selberg's symmetry formula
    Expo. Math. 22 (2004), no. 2, 185–195.




2016 semester 1:

Please contact me if you are interested in doing an Honours project or postgraduate work in number theory, computational number theory, etc.

Current and past Honours students:

Other activities