Asymptotic Expansions of exp-log Functions. - Daniel Richardson; Bruno Salvy; John Shackell; Joris van der Hoeven (ISSAC, 1996)

Lazy Multiplication of Formal Power Series. - Joris van der Hoeven (ISSAC, 1997)

Computation of the Monodromy of Generalized Polylogarithms. - Vincel Hoang Ngoc Minh; Michel Petitot; Joris van der Hoeven (ISSAC, 1998)

Generic Asymptotic Expansions. - Joris van der Hoeven (Appl. Algebra Eng. Commun. Comput., 1998)

Fast Evaluation of Holonomic Functions. - Joris van der Hoeven (Theor. Comput. Sci., 1999)

Shuffle algebra and polylogarithms. - Vincel Hoang Ngoc Minh; Michel Petitot; Joris van der Hoeven (Discret. Math., 2000)

Fast Evaluation of Holonomic Functions Near and in Regular Singularities. - Joris van der Hoeven (J. Symb. Comput., 2001)

A new zero-test for formal power series. - Joris van der Hoeven (ISSAC, 2002)

FFT-like Multiplication of Linear Differential Operators. - Joris van der Hoeven (J. Symb. Comput., 2002)

Relax, but Don't be Too Lazy. - Joris van der Hoeven (J. Symb. Comput., 2002)

Relaxed mltiplication using the middle product. - Joris van der Hoeven (ISSAC, 2003)

The truncated fourier transform and applications. - Joris van der Hoeven (ISSAC, 2004)

GNU TeXmacs. - Joris van der Hoeven (SIGSAM Bull., 2004)

Effective analytic functions. - Joris van der Hoeven (J. Symb. Comput., 2005)

Effective real numbers in Mmxlib. - Joris van der Hoeven (ISSAC, 2006)

Counterexamples to witness conjectures. - Joris van der Hoeven (J. Symb. Comput., 2006)

Complexity bounds for zero-test algorithms. - Joris van der Hoeven; John Shackell (J. Symb. Comput., 2006)

Computations with effective real numbers. - Joris van der Hoeven (Theor. Comput. Sci., 2006)

Around the numeric-symbolic computation of differential Galois groups. - Joris van der Hoeven (J. Symb. Comput., 2007)

Efficient accelero-summation of holonomic functions. - Joris van der Hoeven (J. Symb. Comput., 2007)

Generalized power series solutions to linear partial differential equations. - Joris van der Hoeven (J. Symb. Comput., 2007)

New algorithms for relaxed multiplication. - Joris van der Hoeven (J. Symb. Comput., 2007)

On Effective Analytic Continuation. - Joris van der Hoeven (Math. Comput. Sci., 2007)

Homotopy methods for multiplication modulo triangular sets - Alin Bostan; Muhammad F. I. Chowdhury; Joris van der Hoeven; Éric Schost (CoRR, 2009)

On the bit-complexity of sparse polynomial multiplication - Joris van der Hoeven; Grégoire Lecerf (CoRR, 2009)

Characteristic set method for differential-difference polynomial systems. - Xiao-Shan Gao; Joris van der Hoeven; Chun-Ming Yuan; Gui-Lin Zhang (J. Symb. Comput., 2009)

On asymptotic extrapolation. - Joris van der Hoeven (J. Symb. Comput., 2009)

Newton's method and FFT trading. - Joris van der Hoeven (J. Symb. Comput., 2010)

Mathemagix: the quest of modularity and efficiency for symbolic and certified numeric computation? - Joris van der Hoeven; Grégoire Lecerf; Bernard Mourrain; Philippe Trébuchet; Jérémy Berthomieu; Daouda Niang Diatta; Angelos Mantzaflaris (ACM Commun. Comput. Algebra, 2011)

Homotopy techniques for multiplication modulo triangular sets. - Alin Bostan; Muhammad F. I. Chowdhury; Joris van der Hoeven; Éric Schost (J. Symb. Comput., 2011)

Meta-expansion of transseries. - Joris van der Hoeven (J. Symb. Comput., 2011)

Overview of the Mathemagix Type System. - Joris van der Hoeven (ASCM, 2012)

Quasi-optimal Multiplication of Linear Differential Operators. - Alexandre Benoît; Alin Bostan; Joris van der Hoeven (FOCS, 2012)

On the complexity of multivariate blockwise polynomial multiplication. - Joris van der Hoeven; Grégoire Lecerf (ISSAC, 2012)

Interfacing mathemagix with C++. - Joris van der Hoeven; Grégoire Lecerf (ISSAC, 2013)

Structured FFT and TFT: symmetric and lattice polynomials. - Joris van der Hoeven; Romain Lebreton; Éric Schost (ISSAC, 2013)

Multi-point evaluation in higher dimensions. - Joris van der Hoeven; Éric Schost (Appl. Algebra Eng. Commun. Comput., 2013)

GNU TEXmacs: a scientific editing platform. - Joris van der Hoeven; Andrey Grozin; Massimiliano Gubinelli; Grégoire Lecerf; François Poulain; Denis Raux (ACM Commun. Comput. Algebra, 2013)

Guessing singular dependencies. - Joris van der Hoeven (J. Symb. Comput., 2013)

On the bit-complexity of sparse polynomial and series multiplication. - Joris van der Hoeven; Grégoire Lecerf (J. Symb. Comput., 2013)

Toward a Model Theory for Transseries. - Matthias Aschenbrenner; Lou van den Dries; Joris van der Hoeven (Notre Dame J. Formal Log., 2013)

GNU $_{ scriptsize{ rm MACS}}$ towards a Scientific Office Suite. - Massimiliano Gubinelli; Joris van der Hoeven; François Poulain; Denis Raux (ICMS, 2014)

Faster relaxed multiplication. - Joris van der Hoeven (ISSAC, 2014)

Sparse Polynomial Interpolation in Practice. - Joris van der Hoeven; Grégoire Lecerf (ACM Commun. Comput. Algebra, 2014)

Faster FFTs in Medium Precision. - Joris van der Hoeven; Grégoire Lecerf (ARITH, 2015)

Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms. - Bruno Grenet; Joris van der Hoeven; Grégoire Lecerf (ISSAC, 2015)

Certifying Trajectories of Dynamical Systems. - Joris van der Hoeven (MACIS, 2015)

Towards semantic mathematical editing. - Joris van der Hoeven (J. Symb. Comput., 2015)

Evaluating Straight-Line Programs over Balls. - Joris van der Hoeven; Grégoire Lecerf (ARITH, 2016)

Mathematical Font Art. - Joris van der Hoeven (ICMS, 2016)

Fast Polynomial Multiplication over F260. - David Harvey; Joris van der Hoeven; Grégoire Lecerf (ISSAC, 2016)

Deterministic root finding over finite fields using Graeffe transforms. - Bruno Grenet; Joris van der Hoeven; Grégoire Lecerf (Appl. Algebra Eng. Commun. Comput., 2016)

On the complexity of skew arithmetic. - Joris van der Hoeven (Appl. Algebra Eng. Commun. Comput., 2016)

Even faster integer multiplication. - David Harvey; Joris van der Hoeven; Grégoire Lecerf (J. Complex., 2016)

Modular SIMD arithmetic in Mathemagix. - Joris van der Hoeven; Grégoire Lecerf; Guillaume Quintin (ACM Trans. Math. Softw., 2016)

Multiple Precision Floating-Point Arithmetic on SIMD Processors. - Joris van der Hoeven (ARITH, 2017)

The Frobenius FFT. - Joris van der Hoeven; Robin Larrieu (ISSAC, 2017)

Composition Modulo Powers of Polynomials. - Joris van der Hoeven; Grégoire Lecerf (ISSAC, 2017)

Fast Chinese Remaindering in Practice. - Joris van der Hoeven (MACIS, 2017)

Implementing Fast Carryless Multiplication. - Joris van der Hoeven; Robin Larrieu; Grégoire Lecerf (MACIS, 2017)

Efficient Certification of Numeric Solutions to Eigenproblems. - Joris van der Hoeven; Bernard Mourrain (MACIS, 2017)

Faster integer and polynomial multiplication using cyclotomic coefficient rings. - David Harvey; Joris van der Hoeven (CoRR, 2017)

Faster Polynomial Multiplication over Finite Fields. - David Harvey; Joris van der Hoeven; Grégoire Lecerf (J. ACM, 2017)

Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases. - Joris van der Hoeven; Robin Larrieu (ISSAC, 2018)

Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals. - Joris van der Hoeven; Robin Larrieu (ACM Commun. Comput. Algebra, 2018)

Faster integer multiplication using short lattice vectors. - David Harvey; Joris van der Hoeven (CoRR, 2018)

Modular composition via factorization. - Joris van der Hoeven; Grégoire Lecerf (J. Complex., 2018)

On the complexity of integer matrix multiplication. - David Harvey; Joris van der Hoeven (J. Symb. Comput., 2018)

LU Factorization with Errors. - Jean-Guillaume Dumas; Joris van der Hoeven; Clément Pernet; Daniel S. Roche (ISSAC, 2019)

Computing with D-algebraic power series. - Joris van der Hoeven (Appl. Algebra Eng. Commun. Comput., 2019)

From implicit to recursive equations. - Joris van der Hoeven (Appl. Algebra Eng. Commun. Comput., 2019)

Effective Power Series Computations. - Joris van der Hoeven (Found. Comput. Math., 2019)

Faster polynomial multiplication over finite fields using cyclotomic coefficient rings. - David Harvey; Joris van der Hoeven (J. Complex., 2019)

Accelerated tower arithmetic. - Joris van der Hoeven; Grégoire Lecerf (J. Complex., 2019)

Faster integer multiplication using plain vanilla FFT primes. - David Harvey; Joris van der Hoeven (Math. Comput., 2019)

Implementing the Tangent Graeffe Root Finding Method. - Joris van der Hoeven; Michael B. Monagan (ICMS, 2020)

Ultimate complexity for numerical algorithms. - Joris van der Hoeven; Grégoire Lecerf (ACM Commun. Comput. Algebra, 2020)

Computing one billion roots using the tangent Graeffe method. - Joris van der Hoeven; Michael B. Monagan (ACM Commun. Comput. Algebra, 2020)

Fast multivariate multi-point evaluation revisited. - Joris van der Hoeven; Grégoire Lecerf (J. Complex., 2020)

Directed evaluation. - Joris van der Hoeven; Grégoire Lecerf (J. Complex., 2020)

Amortized Bivariate Multi-point Evaluation. - Joris van der Hoeven; Grégoire Lecerf (ISSAC, 2021)

A Zero Test for σ-algebraic Power Series. - Joris van der Hoeven; Gleb Pogudin (ISSAC, 2021)

Constructing reductions for creative telescoping. - Joris van der Hoeven (Appl. Algebra Eng. Commun. Comput., 2021)

On sparse interpolation of rational functions and gcds. - Joris van der Hoeven; Grégoire Lecerf (ACM Commun. Comput. Algebra, 2021)

On the Complexity Exponent of Polynomial System Solving. - Joris van der Hoeven; Grégoire Lecerf (Found. Comput. Math., 2021)

Fast computation of generic bivariate resultants. - Joris van der Hoeven; Grégoire Lecerf (J. Complex., 2021)

Fast amortized multi-point evaluation. - Joris van der Hoeven; Grégoire Lecerf (J. Complex., 2021)

On the Complexity of Symbolic Computation. - Joris van der Hoeven (ISSAC, 2022)

Optimizing the half-gcd algorithm. - Joris van der Hoeven (CoRR, 2022)

Polynomial Multiplication over Finite Fields in Time ( O (n log n) ). - David Harvey; Joris van der Hoeven (J. ACM, 2022)

Fast interpolation of sparse multivariate polynomials. - Joris van der Hoeven; Grégoire Lecerf (CoRR, 2023)

Amortized multi-point evaluation of multivariate polynomials. - Joris van der Hoeven; Grégoire Lecerf (J. Complex., 2023)

Fast multiple precision exp(x) with precomputations. - Joris van der Hoeven; Fredrik Johansson 001 (ARITH, 2024)

Univariate polynomial factorization over finite fields with large extension degree. - Joris van der Hoeven; Grégoire Lecerf (Appl. Algebra Eng. Commun. Comput., 2024)

Factoring sparse polynomials fast. - Alexander Demin; Joris van der Hoeven (J. Complex., 2025)

Fast interpolation of multivariate polynomials with sparse exponents. - Joris van der Hoeven; Grégoire Lecerf (J. Complex., 2025)

Plane curve germs and contact factorization. - Joris van der Hoeven; Grégoire Lecerf (Appl. Algebra Eng. Commun. Comput., 2025)

Integer multiplication is at least as hard as matrix transposition. - David Harvey; Joris van der Hoeven (CoRR, 2025)

Fuchsian holonomic sequences. - Joris van der Hoeven (Appl. Algebra Eng. Commun. Comput., 2025)