528 citations
- New York UniversityUS58 papers
- Johns Hopkins UniversityUS9 papers
- Princeton UniversityUS9 papers
- Microsoft (United States)US4 papers
- University of RochesterUS4 papers
- California Institute of TechnologyUS3 papers
- Columbia UniversityUS3 papers
- Cornell UniversityUS3 papers
- Eindhoven University of TechnologyNL3 papers
- ETH ZurichCH3 papers
- Google (United States)US3 papers
- Massachusetts Institute of TechnologyUS3 papers
Showing cs.SCShow all
3 papers · 1 filter
cs.SC2009★ 2 cited
Faster algorithms for the square root and reciprocal of power series
David Harvey
We give new algorithms for the computation of square roots and reciprocals of power series in C[[x]]. If M(n) denotes the cost of multiplying polynomials of degree n, the square ro…
cs.SC2008
A cache-friendly truncated FFT
David Harvey
We describe a cache-friendly version of van der Hoeven's truncated FFT and inverse truncated FFT, focusing on the case of `large' coefficients, such as those arising in the Schonha…
cs.SC2007★ 2 cited
Faster polynomial multiplication via multipoint Kronecker substitution
David Harvey
We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderately sized input polynomials, the new algorithms improve on…