default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Harvey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Robert G. Maunder, Lam Wui Kin, David Harvey:
Demonstration of 5G non-terrestrial network regenerative L1 processing. MILCOM 2024: 645-646- [i20]David Harvey:
A deep-learning algorithm to disentangle self-interacting dark matter and AGN feedback models. CoRR abs/2405.17566 (2024) - 2023
- [j26]David Harvey:
Faster truncated integer multiplication. Math. Comput. 93(347): 1265-1296 (2023) - [i19]Lachlan Holden, Feras Dayoub, David Harvey, Tat-Jun Chin:
Federated Neural Radiance Fields. CoRR abs/2305.01163 (2023) - 2022
- [j25]David Harvey, Joris van der Hoeven
:
Polynomial Multiplication over Finite Fields in Time \( O (n \log n) \). J. ACM 69(2): 12:1-12:40 (2022) - [j24]David Harvey, Markus Hittmeir:
A log-log speedup for exponent one-fifth deterministic integer factorisation. Math. Comput. 91(335): 1367-1379 (2022) - [c9]Elliott Hogg, David Harvey, Sabine Hauert, Arthur Richards:
Social Exploration in Robot Swarms. DARS 2022: 69-82 - 2021
- [j23]David Harvey:
An exponent one-fifth algorithm for deterministic integer factorisation. Math. Comput. 90(332): 2937-2950 (2021) - [c8]Elliott Hogg, David Harvey, Sabine Hauert, Arthur Richards:
Evolving Robust Supervisors for Robot Swarms in Uncertain Complex Environments. DARS 2021: 120-133 - 2020
- [j22]Elliott Hogg, Sabine Hauert, David Harvey, Arthur Richards:
Evolving behaviour trees for supervisory control of robot swarms. Artif. Life Robotics 25(4): 569-577 (2020) - [i18]Jonathan Lawry, Michael Crosscombe, David Harvey:
Distributed Possibilistic Learning in Multi-Agent Systems. CoRR abs/2001.07145 (2020) - [i17]David Harvey:
An exponent one-fifth algorithm for deterministic integer factorisation. CoRR abs/2010.05450 (2020)
2010 – 2019
- 2019
- [j21]David Harvey, Joris van der Hoeven:
Faster polynomial multiplication over finite fields using cyclotomic coefficient rings. J. Complex. 54 (2019) - [j20]David Harvey, Joris van der Hoeven:
Faster integer multiplication using plain vanilla FFT primes. Math. Comput. 88(315): 501-514 (2019) - [c7]Jonathan Lawry, Michael Crosscombe, David Harvey:
Epistemic Sets Applied to Best-of-n Problems. ECSQARU 2019: 301-312 - 2018
- [j19]David Harvey, Joris van der Hoeven:
On the complexity of integer matrix multiplication. J. Symb. Comput. 89: 1-8 (2018) - [i16]David Harvey, Joris van der Hoeven:
Faster integer multiplication using short lattice vectors. CoRR abs/1802.07932 (2018) - 2017
- [j18]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Faster Polynomial Multiplication over Finite Fields. J. ACM 63(6): 52:1-52:23 (2017) - [j17]William Hart, David Harvey, Wilson Ong:
Irregular primes to two billion. Math. Comput. 86(308): 3031-3049 (2017) - [i15]David Harvey:
Faster truncated integer multiplication. CoRR abs/1703.00640 (2017) - [i14]David Harvey, Joris van der Hoeven:
Faster integer and polynomial multiplication using cyclotomic coefficient rings. CoRR abs/1712.03693 (2017) - 2016
- [j16]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Even faster integer multiplication. J. Complex. 36: 1-30 (2016) - [j15]David Harvey, Maike Massierer, Andrew V. Sutherland:
Computing -series of geometrically hyperelliptic curves of genus three. LMS J. Comput. Math. 19(A): 220-234 (2016) - [c6]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Fast Polynomial Multiplication over F260. ISSAC 2016: 255-262 - [i13]David Harvey, Joris van der Hoeven:
Faster integer multiplication using plain vanilla FFT primes. CoRR abs/1611.07144 (2016) - 2014
- [j14]David Harvey:
Faster arithmetic for number-theoretic transforms. J. Symb. Comput. 60: 113-119 (2014) - [j13]David Harvey, Andrew V. Sutherland:
Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time. LMS J. Comput. Math. 17(Theory): 257-273 (2014) - [j12]Edgar Costa, David Harvey:
Faster deterministic integer factorization. Math. Comput. 83(285): 339-345 (2014) - [j11]David Harvey:
A subquadratic algorithm for computing the n-th Bernoulli number. Math. Comput. 83(289): 2471-2477 (2014) - [j10]Edgar Costa, Robert Gerbicz, David Harvey:
A search for Wilson primes. Math. Comput. 83(290): 3071-3091 (2014) - [i12]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Even faster integer multiplication. CoRR abs/1407.3360 (2014) - [i11]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Faster polynomial multiplication over finite fields. CoRR abs/1407.3361 (2014) - 2013
- [j9]David Harvey, Igor E. Shparlinski:
Statistics of Different Reduction Types of Fermat Curves. Exp. Math. 22(3): 243-249 (2013) - 2012
- [j8]David Harvey:
The Karatsuba integer middle product. J. Symb. Comput. 47(8): 954-967 (2012) - [i10]Edgar Costa, David Harvey:
Faster deterministic integer factorization. CoRR abs/1201.2116 (2012) - [i9]David Harvey:
Faster arithmetic for number-theoretic transforms. CoRR abs/1205.2926 (2012) - [i8]David Harvey:
A subquadratic algorithm for computing Bernoulli numbers. CoRR abs/1209.0533 (2012) - [i7]Edgar Costa, Robert Gerbicz, David Harvey:
A search for Wilson primes. CoRR abs/1209.3436 (2012) - 2011
- [j7]David Harvey:
Faster algorithms for the square root and reciprocal of power series. Math. Comput. 80(273): 387-394 (2011) - [j6]J. P. Buhler, David Harvey:
Irregular primes to 163 million. Math. Comput. 80(276): 2435-2444 (2011) - [c5]David Harvey, Paul Zimmermann:
Short Division of Long Integers. IEEE Symposium on Computer Arithmetic 2011: 7-14 - [i6]Richard P. Brent, David Harvey:
Fast computation of Bernoulli, Tangent and Secant numbers. CoRR abs/1108.0286 (2011) - 2010
- [j5]David Harvey:
A multimodular algorithm for computing Bernoulli numbers. Math. Comput. 79(272): 2361-2370 (2010) - [c4]David Harvey, Daniel S. Roche:
An in-place truncated fourier transform and applications to polynomial multiplication. ISSAC 2010: 325-329 - [i5]David Harvey, Daniel S. Roche:
An in-place truncated Fourier transform and applications to polynomial multiplication. CoRR abs/1001.5272 (2010)
2000 – 2009
- 2009
- [j4]David Harvey:
Faster polynomial multiplication via multipoint Kronecker substitution. J. Symb. Comput. 44(10): 1502-1510 (2009) - [j3]David Harvey:
A cache-friendly truncated FFT. Theor. Comput. Sci. 410(27-29): 2649-2658 (2009) - [i4]David Harvey:
Faster algorithms for the square root and reciprocal of power series. CoRR abs/0910.1926 (2009) - [i3]David Harvey:
Faster exponentials of power series. CoRR abs/0911.3110 (2009) - 2008
- [j2]David Harvey:
Efficient Computation of p-Adic Heights. LMS J. Comput. Math. 11: 40-59 (2008) - [i2]David Harvey:
A cache-friendly truncated FFT. CoRR abs/0810.3203 (2008) - 2007
- [i1]David Harvey:
Faster polynomial multiplication via multipoint Kronecker substitution. CoRR abs/0712.4046 (2007) - 2004
- [c3]Khalil ur Rehman, Ali Iqbal, David Harvey:
DICOM Configuration Management. CBMS 2004: 180-184
1990 – 1999
- 1998
- [c2]Christian Hicks, Sally A. Hines, David Harvey, Fraser J. McLeay, Karl Christensen:
An Agent Based Model of Supply Chains. ESM 1998: 609-613 - 1996
- [c1]Charles L. Matson, Marsha Fox, E. Keith Hege, Jack Drummond, David Harvey:
Optimal speckle imaging of extended space objects-results from field data. ICIP (3) 1996: 105-108 - 1995
- [b1]Clive Evans, David Lacey, David Harvey, David Gibbons, Andy Krasun:
Client/server - a handbook of modern computer system design. BCS practitioner series, Prentice Hall 1995, ISBN 978-0-13-377201-2, pp. I-XVI, 1-138
1980 – 1989
- 1987
- [j1]David Harvey:
Putting Business First: the Strategy Challenge. J. Inf. Technol. 2(1): 18-27 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-22 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
