default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoris van der Hoeven
Person information
- affiliation: École Polytechnique, Laboratoire d'informatique, Palaiseau, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j56]Joris van der Hoeven
, Grégoire Lecerf:
Univariate polynomial factorization over finite fields with large extension degree. Appl. Algebra Eng. Commun. Comput. 35(2): 121-149 (2024)- [c33]Joris van der Hoeven, Fredrik Johansson:
Fast multiple precision exp(x) with precomputations. ARITH 2024: 80-87 - 2023
- [j55]Joris van der Hoeven, Grégoire Lecerf:
Amortized multi-point evaluation of multivariate polynomials. J. Complex. 74: 101693 (2023) - [i14]Alexander Demin, Joris van der Hoeven:
Factoring sparse polynomials fast. CoRR abs/2312.17380 (2023) - [i13]Joris van der Hoeven, Grégoire Lecerf:
Fast interpolation of sparse multivariate polynomials. CoRR abs/2312.17664 (2023) - 2022
- [j54]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) - [c32]Joris van der Hoeven:
On the Complexity of Symbolic Computation. ISSAC 2022: 3-12 - [i12]Joris van der Hoeven:
Optimizing the half-gcd algorithm. CoRR abs/2212.12389 (2022) - 2021
- [j53]Joris van der Hoeven:
Constructing reductions for creative telescoping. Appl. Algebra Eng. Commun. Comput. 32(5): 575-602 (2021) - [j52]Joris van der Hoeven, Grégoire Lecerf:
On sparse interpolation of rational functions and gcds. ACM Commun. Comput. Algebra 55(1): 1-12 (2021) - [j51]Joris van der Hoeven, Grégoire Lecerf:
On the Complexity Exponent of Polynomial System Solving. Found. Comput. Math. 21(1): 1-57 (2021) - [j50]Joris van der Hoeven, Grégoire Lecerf:
Fast computation of generic bivariate resultants. J. Complex. 62: 101499 (2021) - [j49]Joris van der Hoeven, Grégoire Lecerf:
Fast amortized multi-point evaluation. J. Complex. 67: 101574 (2021) - [c31]Joris van der Hoeven, Grégoire Lecerf:
Amortized Bivariate Multi-point Evaluation. ISSAC 2021: 179-185 - [c30]Joris van der Hoeven, Gleb Pogudin:
A Zero Test for σ-algebraic Power Series. ISSAC 2021: 187-192 - 2020
- [j48]Joris van der Hoeven, Grégoire Lecerf:
Ultimate complexity for numerical algorithms. ACM Commun. Comput. Algebra 54(1): 1-13 (2020) - [j47]Joris van der Hoeven, Michael B. Monagan:
Computing one billion roots using the tangent Graeffe method. ACM Commun. Comput. Algebra 54(3): 65-85 (2020) - [j46]Joris van der Hoeven, Grégoire Lecerf:
Fast multivariate multi-point evaluation revisited. J. Complex. 56 (2020) - [j45]Joris van der Hoeven, Grégoire Lecerf:
Directed evaluation. J. Complex. 60: 101498 (2020) - [c29]Joris van der Hoeven, Michael B. Monagan:
Implementing the Tangent Graeffe Root Finding Method. ICMS 2020: 482-492
2010 – 2019
- 2019
- [j44]Joris van der Hoeven:
Computing with D-algebraic power series. Appl. Algebra Eng. Commun. Comput. 30(1): 17-49 (2019) - [j43]Joris van der Hoeven:
From implicit to recursive equations. Appl. Algebra Eng. Commun. Comput. 30(3): 243-262 (2019) - [j42]Joris van der Hoeven, Robin Larrieu:
Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals. Appl. Algebra Eng. Commun. Comput. 30(6): 509-539 (2019) - [j41]Joris van der Hoeven:
Effective Power Series Computations. Found. Comput. Math. 19(3): 623-651 (2019) - [j40]David Harvey, Joris van der Hoeven:
Faster polynomial multiplication over finite fields using cyclotomic coefficient rings. J. Complex. 54 (2019) - [j39]Joris van der Hoeven, Grégoire Lecerf:
Accelerated tower arithmetic. J. Complex. 55 (2019) - [j38]David Harvey, Joris van der Hoeven:
Faster integer multiplication using plain vanilla FFT primes. Math. Comput. 88(315): 501-514 (2019) - [c28]Jean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet, Daniel S. Roche:
LU Factorization with Errors. ISSAC 2019: 131-138 - [i11]Jean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet, Daniel S. Roche:
LU factorization with errors. CoRR abs/1901.10730 (2019) - 2018
- [j37]Joris van der Hoeven, Robin Larrieu:
Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals. ACM Commun. Comput. Algebra 52(3): 55-58 (2018) - [j36]Joris van der Hoeven, Grégoire Lecerf:
Modular composition via factorization. J. Complex. 48: 36-68 (2018) - [j35]David Harvey, Joris van der Hoeven:
On the complexity of integer matrix multiplication. J. Symb. Comput. 89: 1-8 (2018) - [c27]Joris van der Hoeven, Robin Larrieu:
Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases. ISSAC 2018: 199-206 - [i10]David Harvey, Joris van der Hoeven:
Faster integer multiplication using short lattice vectors. CoRR abs/1802.07932 (2018) - 2017
- [j34]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Faster Polynomial Multiplication over Finite Fields. J. ACM 63(6): 52:1-52:23 (2017) - [c26]Joris van der Hoeven:
Multiple Precision Floating-Point Arithmetic on SIMD Processors. ARITH 2017: 2-9 - [c25]Joris van der Hoeven, Robin Larrieu:
The Frobenius FFT. ISSAC 2017: 437-444 - [c24]Joris van der Hoeven, Grégoire Lecerf:
Composition Modulo Powers of Polynomials. ISSAC 2017: 445-452 - [c23]Joris van der Hoeven, Bernard Mourrain:
Efficient Certification of Numeric Solutions to Eigenproblems. MACIS 2017: 81-94 - [c22]Joris van der Hoeven:
Fast Chinese Remaindering in Practice. MACIS 2017: 95-106 - [c21]Joris van der Hoeven, Robin Larrieu, Grégoire Lecerf:
Implementing Fast Carryless Multiplication. MACIS 2017: 121-136 - [i9]David Harvey, Joris van der Hoeven:
Faster integer and polynomial multiplication using cyclotomic coefficient rings. CoRR abs/1712.03693 (2017) - 2016
- [j33]Joris van der Hoeven:
On the complexity of skew arithmetic. Appl. Algebra Eng. Commun. Comput. 27(2): 105-122 (2016) - [j32]Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf:
Deterministic root finding over finite fields using Graeffe transforms. Appl. Algebra Eng. Commun. Comput. 27(3): 237-257 (2016) - [j31]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Even faster integer multiplication. J. Complex. 36: 1-30 (2016) - [j30]Joris van der Hoeven, Grégoire Lecerf, Guillaume Quintin:
Modular SIMD arithmetic in Mathemagix. ACM Trans. Math. Softw. 43(1): 5:1-5:37 (2016) - [c20]Joris van der Hoeven, Grégoire Lecerf:
Evaluating Straight-Line Programs over Balls. ARITH 2016: 142-149 - [c19]Joris van der Hoeven:
Mathematical Font Art. ICMS 2016: 522-529 - [c18]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Fast Polynomial Multiplication over F260. ISSAC 2016: 255-262 - [i8]David Harvey, Joris van der Hoeven:
Faster integer multiplication using plain vanilla FFT primes. CoRR abs/1611.07144 (2016) - 2015
- [j29]Joris van der Hoeven:
Towards semantic mathematical editing. J. Symb. Comput. 71: 1-46 (2015) - [c17]Joris van der Hoeven, Grégoire Lecerf:
Faster FFTs in Medium Precision. ARITH 2015: 75-82 - [c16]Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf:
Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms. ISSAC 2015: 197-204 - [c15]Joris van der Hoeven:
Certifying Trajectories of Dynamical Systems. MACIS 2015: 520-532 - 2014
- [j28]Joris van der Hoeven, Grégoire Lecerf:
Sparse Polynomial Interpolation in Practice. ACM Commun. Comput. Algebra 48(3/4): 187-191 (2014) - [c14]Massimiliano Gubinelli, Joris van der Hoeven, François Poulain, Denis Raux:
GNU $_{\scriptsize{\rm MACS}}$ towards a Scientific Office Suite. ICMS 2014: 562-569 - [c13]Joris van der Hoeven:
Faster relaxed multiplication. ISSAC 2014: 405-412 - [i7]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Even faster integer multiplication. CoRR abs/1407.3360 (2014) - [i6]David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Faster polynomial multiplication over finite fields. CoRR abs/1407.3361 (2014) - [i5]Joris van der Hoeven, Grégoire Lecerf, Guillaume Quintin:
Modular SIMD arithmetic in Mathemagix. CoRR abs/1407.3383 (2014) - 2013
- [j27]Joris van der Hoeven, Éric Schost:
Multi-point evaluation in higher dimensions. Appl. Algebra Eng. Commun. Comput. 24(1): 37-52 (2013) - [j26]Joris van der Hoeven, Andrey Grozin, Massimiliano Gubinelli, Grégoire Lecerf, François Poulain, Denis Raux:
GNU TEXmacs: a scientific editing platform. ACM Commun. Comput. Algebra 47(1/2): 59-61 (2013) - [j25]Joris van der Hoeven, Grégoire Lecerf:
On the bit-complexity of sparse polynomial and series multiplication. J. Symb. Comput. 50: 227-254 (2013) - [j24]Joris van der Hoeven:
Guessing singular dependencies. J. Symb. Comput. 59: 54-80 (2013) - [j23]Matthias Aschenbrenner, Lou van den Dries, Joris van der Hoeven:
Toward a Model Theory for Transseries. Notre Dame J. Formal Log. 54(3-4): 279-310 (2013) - [c12]Joris van der Hoeven, Romain Lebreton, Éric Schost:
Structured FFT and TFT: symmetric and lattice polynomials. ISSAC 2013: 355-362 - [c11]Joris van der Hoeven, Grégoire Lecerf:
Interfacing mathemagix with C++. ISSAC 2013: 363-370 - 2012
- [c10]Joris van der Hoeven:
Overview of the Mathemagix Type System. ASCM 2012: 397-425 - [c9]Alexandre Benoît, Alin Bostan, Joris van der Hoeven:
Quasi-optimal Multiplication of Linear Differential Operators. FOCS 2012: 524-530 - [c8]Joris van der Hoeven, Grégoire Lecerf:
On the complexity of multivariate blockwise polynomial multiplication. ISSAC 2012: 211-218 - [e2]Joris van der Hoeven, Mark van Hoeij:
International Symposium on Symbolic and Algebraic Computation, ISSAC'12, Grenoble, France - July 22 - 25, 2012. ACM 2012, ISBN 978-1-4503-1269-1 [contents] - [i4]Alexandre Benoît, Alin Bostan, Joris van der Hoeven:
Quasi-optimal multiplication of linear differential operators. CoRR abs/1208.3639 (2012) - 2011
- [j22]Joris van der Hoeven, Grégoire Lecerf, Bernard Mourrain, Philippe Trébuchet, Jérémy Berthomieu, Daouda Niang Diatta, Angelos Mantzaflaris:
Mathemagix: the quest of modularity and efficiency for symbolic and certified numeric computation? ACM Commun. Comput. Algebra 45(3/4): 186-188 (2011) - [j21]Joris van der Hoeven:
Meta-expansion of transseries. J. Symb. Comput. 46(4): 339-359 (2011) - [j20]Alin Bostan, Muhammad F. I. Chowdhury, Joris van der Hoeven, Éric Schost:
Homotopy techniques for multiplication modulo triangular sets. J. Symb. Comput. 46(12): 1378-1402 (2011) - 2010
- [j19]Joris van der Hoeven:
Newton's method and FFT trading. J. Symb. Comput. 45(8): 857-878 (2010) - [e1]Komei Fukuda, Joris van der Hoeven, Michael Joswig, Nobuki Takayama:
Mathematical Software - ICMS 2010, Third International Congress on Mathematical Software, Kobe, Japan, September 13-17, 2010. Proceedings. Lecture Notes in Computer Science 6327, Springer 2010, ISBN 978-3-642-15581-9 [contents]
2000 – 2009
- 2009
- [j18]Joris van der Hoeven:
On asymptotic extrapolation. J. Symb. Comput. 44(8): 1000-1016 (2009) - [j17]Xiao-Shan Gao, Joris van der Hoeven, Chun-Ming Yuan, Gui-Lin Zhang:
Characteristic set method for differential-difference polynomial systems. J. Symb. Comput. 44(9): 1137-1163 (2009) - [i3]Alin Bostan, Muhammad F. I. Chowdhury, Joris van der Hoeven, Éric Schost:
Homotopy methods for multiplication modulo triangular sets. CoRR abs/0901.3657 (2009) - [i2]Joris van der Hoeven, Grégoire Lecerf:
On the bit-complexity of sparse polynomial multiplication. CoRR abs/0901.4323 (2009) - 2007
- [j16]Joris van der Hoeven:
Around the numeric-symbolic computation of differential Galois groups. J. Symb. Comput. 42(1-2): 236-264 (2007) - [j15]Joris van der Hoeven:
Efficient accelero-summation of holonomic functions. J. Symb. Comput. 42(4): 389-428 (2007) - [j14]Joris van der Hoeven:
Generalized power series solutions to linear partial differential equations. J. Symb. Comput. 42(8): 771-791 (2007) - [j13]Joris van der Hoeven:
New algorithms for relaxed multiplication. J. Symb. Comput. 42(8): 792-802 (2007) - [j12]Joris van der Hoeven:
On Effective Analytic Continuation. Math. Comput. Sci. 1(1): 111-175 (2007) - 2006
- [j11]Joris van der Hoeven:
Counterexamples to witness conjectures. J. Symb. Comput. 41(9): 959-963 (2006) - [j10]Joris van der Hoeven, John Shackell:
Complexity bounds for zero-test algorithms. J. Symb. Comput. 41(9): 1004-1020 (2006) - [j9]Joris van der Hoeven:
Computations with effective real numbers. Theor. Comput. Sci. 351(1): 52-60 (2006) - [c7]Joris van der Hoeven:
Effective real numbers in Mmxlib. ISSAC 2006: 138-145 - [i1]Joris van der Hoeven:
GNU TeXmacs. Challenges in Symbolic Computation Software 2006 - 2005
- [j8]Joris van der Hoeven:
Effective analytic functions. J. Symb. Comput. 39(3-4): 433-449 (2005) - 2004
- [j7]Joris van der Hoeven:
GNU TeXmacs. SIGSAM Bull. 38(1): 24-25 (2004) - [c6]Joris van der Hoeven:
The truncated fourier transform and applications. ISSAC 2004: 290-296 - 2003
- [c5]Joris van der Hoeven:
Relaxed mltiplication using the middle product. ISSAC 2003: 143-147 - 2002
- [j6]Joris van der Hoeven:
FFT-like Multiplication of Linear Differential Operators. J. Symb. Comput. 33(1): 123-127 (2002) - [j5]Joris van der Hoeven:
Relax, but Don't be Too Lazy. J. Symb. Comput. 34(6): 479-542 (2002) - [c4]Joris van der Hoeven:
A new zero-test for formal power series. ISSAC 2002: 117-122 - 2001
- [j4]Joris van der Hoeven:
Fast Evaluation of Holonomic Functions Near and in Regular Singularities. J. Symb. Comput. 31(6): 717-743 (2001) - 2000
- [j3]Vincel Hoang Ngoc Minh, Michel Petitot, Joris van der Hoeven:
Shuffle algebra and polylogarithms. Discret. Math. 225(1-3): 217-230 (2000)
1990 – 1999
- 1999
- [j2]Joris van der Hoeven:
Fast Evaluation of Holonomic Functions. Theor. Comput. Sci. 210(1): 199-215 (1999) - 1998
- [j1]Joris van der Hoeven:
Generic Asymptotic Expansions. Appl. Algebra Eng. Commun. Comput. 9(1): 25-44 (1998) - [c3]Vincel Hoang Ngoc Minh, Michel Petitot, Joris van der Hoeven:
Computation of the Monodromy of Generalized Polylogarithms. ISSAC 1998: 276-283 - 1997
- [c2]Joris van der Hoeven:
Lazy Multiplication of Formal Power Series. ISSAC 1997: 17-20 - 1996
- [c1]Daniel Richardson, Bruno Salvy, John Shackell, Joris van der Hoeven:
Asymptotic Expansions of exp-log Functions. ISSAC 1996: 309-313
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 2024-07-18 21:02 CEST 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:
