| David Harvey |
|
 |
Note: an asterisk indicates a talk given by a coauthor.
| 2026 | |
|
New records for enumerating primes and personal latitude
ANTS XVII, University of Groningen (rump session) (Jul 2026) |
• slides |
|
Deterministic methods for finding elements of large multiplicative order
ANTS XVII, University of Groningen (Jul 2026) |
• slides |
|
Deterministic methods for finding elements of large multiplicative order
Number Theory Seminar, UNSW (May 2026) |
|
| 2025 | |
|
Integer multiplication is at least as hard as matrix transposition
FOCS 2025, Sydney (Dec 2025) |
• slides |
|
Integer multiplication is at least as hard as matrix transposition
Computational Algebra Seminar, University of Sydney (Oct 2025) |
|
|
Integer multiplication is at least as hard as matrix transposition
Sydney Algorithms and Computing Theory (SACT), University of Sydney (Oct 2025) |
|
|
Integer multiplication is at least as hard as matrix transposition
Number Theory Down Under(er) 13, University of Canterbury (Aug 2025) |
|
| 2024 | |
|
Complexity bounds for multiplication
Explicit Methods in Number Theory, Mathematisches Forschungsinstitut Oberwolfach (Sep 2024) |
• video |
|
Integer multiplication and its applications
Arf Lecture, Middle East Technical University, Ankara (May 2024) |
• slides |
|
Integer multiplication and its applications
IMBM (Istanbul Center for Mathematical Sciences), Boğaziçi University, Istanbul (Apr 2024) |
• slides |
| 2023 | |
|
Recent progress on deterministic integer factorisation
Workshop on Algebraic Geometry and Number Theory, Magma Group, University of Sydney (Nov 2023) |
• slides |
|
Recent progress on deterministic integer factorisation
Recent Trends in Computer Algebra, Institut Henri Poincaré (Sep 2023) |
• slides |
| 2022 | |
|
Counting points on smooth plane quartics
ANTS XV, University of Bristol (Aug 2022) |
• slides * • video * |
|
A deterministic algorithm for finding r-power divisors
ANTS XV, University of Bristol (Aug 2022) |
• slides * |
| 2021 | |
|
Fast multiplication: some unsolved problems
AustMS annual meeting, University of Newcastle (hybrid conference) (Dec 2021) |
• slides |
|
Recent progress on deterministic integer factorisation
Number Theory Down Under 9, University of Sydney (online conference) (Sep 2021) |
• slides • video |
|
Recent progress on deterministic integer factorisation
Explicit Methods in Number Theory, Mathematisches Forschungsinstitut Oberwolfach (online conference) (Jul 2021) |
• slides |
|
Number theory and fast arithmetic
Beeger Lecture, Nederlands Mathematisch Congres 2021 (online conference) (Apr 2021) |
• slides |
| 2020 | |
|
Fast Fourier transforms of prime length
CTAC 2020, UNSW Sydney (online conference) (Aug 2020) |
• slides • video (starts at 6:30) |
|
Recent results on fast multiplication
ANTS XIV, University of Auckland (online conference) (Jun 2020) |
• slides • video |
| 2019 | |
|
Multiplication everywhere
AustMS medal talk, AustMS annual meeting, Monash University (Dec 2019) |
• slides |
|
Recent results on fast multiplication
MACAO workshop, University of Wollongong (Nov 2019) |
• slides |
|
Integer multiplication in time O(n log n)
CARMA Colloquium, University of Newcastle (May 2019) |
• slides |
|
Integer multiplication in time O(n log n)
MSI Colloquium, Australian National University (May 2019) |
• slides |
|
Integer multiplication in time O(n log n)
UNSW / University of Sydney Joint Colloquium (May 2019) |
• slides • video |
| 2018 | |
|
Integer multiplication and the truncated product problem
Mathematics Colloquium, Macquarie University (Oct 2018) |
• slides |
|
The truncated product problem
Number Theory Down Under 6, UNSW Canberra (Sep 2018) |
• slides |
|
Integer multiplication and the truncated product problem
Number Theory Seminar, UNSW (Sep 2018) |
• slides |
|
Integer multiplication and the truncated product problem
Arithmetic Geometry, Number Theory, and Computation, MIT (Aug 2018) |
• slides |
|
Faster integer multiplication using short lattice vectors
ANTS XIII, University of Wisconsin, Madison (Jul 2018) |
• slides |
|
Counting points on curves in average polynomial time
Workshop on numerical methods for algebraic curves, Le Centre Henri Lebesgue, Rennes (Feb 2018) |
• slides |
| 2017 | |
|
Computing Bernoulli numbers
Jonathan Borwein Commemorative Conference, Newcastle (Sep 2017) |
• slides |
|
A quick survey of average polynomial time point counting for curves
PIMS Workshop on Computational Arithmetic Geometry, Simon Fraser University (June 2017) |
• slides |
| 2016 | |
|
Point counting on arbitrary varieties
Second NZ Number Theory Workshop, University of Canterbury (Oct 2016) |
|
|
Point counting on arbitrary varieties
Number Theory Seminar, UNSW (Oct 2016) |
|
|
Fast integer multiplication and the distribution of primes
Number Theory Down Under 4, University of Newcastle (Sep 2016) |
• slides |
|
Computing L-series of geometrically hyperelliptic curves of genus three
ANTS XII, University of Kaiserslautern (Aug 2016) |
• slides * |
|
Irregular primes to two billion
ANTS XII, University of Kaiserslautern (rump session) (Aug 2016) |
• slides |
|
Computing L-series of irrationally hyperelliptic curves
Capital Number Theory, Australian National University (Apr 2016) |
|
| 2015 | |
|
Counting points on K3 surfaces: some complexity guesstimates
Explicit Methods for Modularity of K3 Surfaces and Other Higher Weight Motives, ICERM (Oct 2015) |
• slides |
|
Counting points on curves over finite fields
Algebraic Geometry, Arithmetic Geometry, and Commutative Algebra Seminar, University of South Carolina (Oct 2015) |
|
|
Computing L-series of hyperelliptic curves in moderate genus
Modular Forms and Curves of Low Genus: Computational Aspects, ICERM (Oct 2015) |
• slides |
|
Counting points on hypersurfaces
ICERM Research Seminar (Oct 2015) |
|
|
Point counting in average polynomial time: an update
Explicit Methods in Number Theory, Mathematisches Forschungsinstitut Oberwolfach (Jul 2015) |
|
|
Some new point-counting algorithms
Geometry & Topology Seminar, University of Sydney (Jun 2015) |
|
|
Even faster integer multiplication
Optimisation Research Group Seminar, NICTA (UNSW) (May 2015) |
• slides |
|
Some new point-counting algorithms
Algebra/Geometry/Topology Seminar, University of Melbourne (May 2015) |
|
| 2014 | |
|
Faster polynomial multiplication over finite fields
Australia–New Zealand Mathematics Convention, University of Melbourne (Dec 2014) |
• slides |
|
The n-body problem
Australian Mathematical Society Early Career Researcher workshop, Melbourne (Dec 2014) |
|
|
Counting points on smooth plane quartics
Number Theory Down Under 2, University of Newcastle (Oct 2014) |
• slides |
|
Even faster integer multiplication
Algebra and Topology seminar, Australian National University (Sep 2014) |
|
|
Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time
ANTS XI, Gyeongju, South Korea (Aug 2014) |
• slides * |
|
New multiplication algorithms
ANTS XI, Gyeongju, South Korea (rump session) (Aug 2014) |
• slides |
|
Irregular primes to two billion
Pure Mathematics Department Seminar, UNSW (May 2014) |
|
|
Counting points on curves in average polynomial time
Workshop on Frobenius distributions of curves, CIRM, Marseille (Feb 2014) |
• slides * |
| 2013 | |
|
Irregular primes to two billion: progress report
Number Theory Down Under, CARMA, University of Newcastle (Oct 2013) |
• slides |
|
Recent progress on point-counting algorithms
AustMS annual meeting, University of Sydney (Oct 2013) |
• slides |
|
The accumulating remainder tree and applications
Pure Mathematics Department Seminar, UNSW (Mar 2013) |
|
| 2012 | |
|
Counting points on elliptic curves
MSI Colloquium, Australian National University (Dec 2012) |
• slides |
|
Counting points on elliptic curves
Computational Algebra Seminar, University of Sydney (Nov 2012) |
• slides |
|
Counting points on hyperelliptic curves
CARMA, University of Newcastle (Nov 2012) |
• slides |
|
Old and new algorithms for computing Bernoulli numbers
AustMS annual meeting, University of Ballarat (Sep 2012) |
• slides |
|
Progress report on a Wilson prime search
ANTS X, San Diego (rump session) (Jul 2012) |
• slides |
|
Algorithms for Wilson primes
ACAC seminar, Macquarie University (Mar 2012) |
|
|
Algorithms for Wilson primes
CCR, La Jolla, San Diego (Jan 2012) |
|
|
Faster deterministic integer factorization
Joint Mathematics Meetings, Boston (Jan 2012) |
• slides |
| 2011 | |
|
Faster arithmetic for number-theoretic transforms
Sage/FLINT workshop, University of Warwick (Dec 2011) |
• slides |
|
Faster deterministic integer factorisation
Pure Mathematics Department Seminar, UNSW (Oct 2011) |
• slides |
|
Faster arithmetic for number-theoretic transforms
ACAC seminar, Macquarie University (Oct 2011) |
• slides |
| 2010 | |
|
Counting points on projective hypersurfaces
Workshop on Elliptic Curve Computation, Microsoft Research, Redmond (Oct 2010) |
• slides |
|
Computing zeta functions of projective surfaces in large characteristic
Workshop on Counting Points, CRM, Université de Montréal (Apr 2010) |
• slides |
|
Computing zeta functions of projective surfaces in large characteristic
Computational Algebra Seminar, University of Sydney (Apr 2010) |
• slides |
|
Computing zeta functions of certain varieties in larger characteristic
Effective methods in p-adic cohomology, Mathematical Institute, University of Oxford (Mar 2010) |
• slides |
|
Some recent algorithms for arithmetic on power series and integers
Australian National University (Feb 2010) |
|
| 2009 | |
|
An implementation of O(p1/2+ε) point-counting on hyperelliptic curves
AGCT-12, CIRM, Marseille (Apr 2009) |
|
|
Faster polynomial multiplication via multipoint Kronecker substitution
CS Theory Seminar, New York University (Feb 2009) |
• slides |
|
zn_poly: a library for polynomial arithmetic
Joint Mathematics Meetings, Washington DC (Jan 2009) |
• slides |
| 2008 | |
|
Large-scale verification of Vandiver's conjecture
MIT Number Theory Seminar (Dec 2008) |
• slides |
|
Large-scale verification of Vandiver's conjecture
Sage Days 11: Special functions and computational number theory meet scientific computing, University of Texas, Austin (Nov 2008) |
• slides |
|
Large-scale verification of Vandiver's conjecture
CUNY Collaborative Number Theory Seminar (Nov 2008) |
• slides |
|
Polynomial arithmetic and applications in number theory
Courant Instructor Day, New York University (Sep 2008) |
• slides |
|
Linear recurrences and Kedlaya's algorithm
CCR, La Jolla, San Diego (Feb 2008) |
|
| 2007 | |
|
What does Cp look like?
Trivial Notions Seminar, Harvard (Dec 2007) |
|
|
p-adic cohomology and linear recurrences
Seminar on Topics in Arithmetic Geometry, MIT (Dec 2007) |
|
|
Linear recurrences and Kedlaya's algorithm
Five College Number Theory Seminar, Amherst College (Nov 2007) |
|
|
FLINT and fast polynomial arithmetic
Sage Days 4, University of Washington, Seattle (Jun 2007) |
• slides |
| 2006 | |
|
Computational aspects of p-adic heights for elliptic curves
Seminar on Topics in Arithmetic Geometry, MIT (Dec 2006) |
|
|
Computing 2 x 2 for large values of 2
Trivial Notions Seminar, Harvard (Nov 2006) |
|
|
SAGE architecture, design and coding
Sage Days 2, University of Washington, Seattle (Oct 2006) |
• slides |
|
Implementation experience in SAGE: computing p-adic heights and the p-adic sigma function
Sage Days 2, University of Washington, Seattle (Oct 2006) |
• slides |
|
Matrix multiplication and block echelon forms
Graduate Workshop in Computational Number Theory, MSRI, Berkeley (Aug 2006) |
|
| 2005 | |
|
Szemerédi's Theorem
Trivial Notions Seminar, Harvard (Feb 2005) |
|
| 2004 | |
|
Selberg's Symmetry Formula
Trivial Notions Seminar, Harvard (Apr 2004) |
|