3 citations · 8 across the 5 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2008★ 1 cited
A multimodular algorithm for computing Bernoulli numbers
David Harvey
We describe an algorithm for computing Bernoulli numbers. Using a parallel implementation, we have computed B(k) for k = 10^8, a new record. Our method is to compute B(k) modulo p…
math.NT2007★ 3 cited
Efficient computation of p-adic heights
David Harvey
We analyse and drastically improve the running time of the algorithm of Mazur, Stein and Tate for computing the canonical cyclotomic p-adic height of a point on an elliptic curve E…
math.NT2006★ 11 cited
Kedlaya's algorithm in larger characteristic
David Harvey
We show that the linear dependence on of the running time of Kedlaya's point-counting algorithm in characteristic may be reduced to .