Joris van der Hoeven

Appl. Algebra Eng. Commun. Comput., 2024

2023

Amortized multi-point evaluation of multivariate polynomials.

[BibT_eX]

[DOI]

J. Complex., 2023

Fast interpolation of sparse multivariate polynomials.

[BibT_eX]

[DOI]

CoRR, 2023

Factoring sparse polynomials fast.

[BibT_eX]

[DOI]

Alexander Demin

CoRR, 2023

2022

Polynomial Multiplication over Finite Fields in Time $ O (n \log n) $.

[BibT_eX]

[DOI]

J. ACM, 2022

Optimizing the half-gcd algorithm.

[BibT_eX]

[DOI]

CoRR, 2022

On the Complexity of Symbolic Computation.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021

Fast amortized multi-point evaluation.

[BibT_eX]

[DOI]

J. Complex., 2021

Fast computation of generic bivariate resultants.

[BibT_eX]

[DOI]

J. Complex., 2021

On the Complexity Exponent of Polynomial System Solving.

[BibT_eX]

[DOI]

Found. Comput. Math., 2021

On sparse interpolation of rational functions and gcds.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2021

Constructing reductions for creative telescoping.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2021

A Zero Test for σ-algebraic Power Series.

[BibT_eX]

[DOI]

Gleb Pogudin

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

Amortized Bivariate Multi-point Evaluation.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020

Directed evaluation.

[BibT_eX]

[DOI]

J. Complex., 2020

Fast multivariate multi-point evaluation revisited.

[BibT_eX]

[DOI]

J. Complex., 2020

Computing one billion roots using the tangent Graeffe method.

[BibT_eX]

[DOI]

Michael B. Monagan

ACM Commun. Comput. Algebra, 2020

Ultimate complexity for numerical algorithms.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2020

Implementing the Tangent Graeffe Root Finding Method.

[BibT_eX]

[DOI]

Michael B. Monagan

Proceedings of the Mathematical Software - ICMS 2020, 2020

2019

Faster integer multiplication using plain vanilla FFT primes.

[BibT_eX]

[DOI]

Math. Comput., 2019

Accelerated tower arithmetic.

[BibT_eX]

[DOI]

J. Complex., 2019

Faster polynomial multiplication over finite fields using cyclotomic coefficient rings.

[BibT_eX]

[DOI]

J. Complex., 2019

Effective Power Series Computations.

[BibT_eX]

[DOI]

Found. Comput. Math., 2019

From implicit to recursive equations.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2019

Computing with D-algebraic power series.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2019

LU Factorization with Errors.

[BibT_eX]

[DOI]

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018

On the complexity of integer matrix multiplication.

[BibT_eX]

[DOI]

J. Symb. Comput., 2018

Modular composition via factorization.

[BibT_eX]

[DOI]

J. Complex., 2018

Faster integer multiplication using short lattice vectors.

[BibT_eX]

[DOI]

CoRR, 2018

Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2018

Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017

Faster Polynomial Multiplication over Finite Fields.

[BibT_eX]

[DOI]

J. ACM, 2017

Faster integer and polynomial multiplication using cyclotomic coefficient rings.

[BibT_eX]

[DOI]

CoRR, 2017

Efficient Certification of Numeric Solutions to Eigenproblems.

[BibT_eX]

[DOI]

Bernard Mourrain

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

Implementing Fast Carryless Multiplication.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

Fast Chinese Remaindering in Practice.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

Composition Modulo Powers of Polynomials.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

The Frobenius FFT.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Multiple Precision Floating-Point Arithmetic on SIMD Processors.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE Symposium on Computer Arithmetic, 2017

2016

Modular SIMD arithmetic in Mathemagix.

[BibT_eX]

[DOI]

Guillaume Quintin

ACM Trans. Math. Softw., 2016

Even faster integer multiplication.

[BibT_eX]

[DOI]

J. Complex., 2016

On the complexity of skew arithmetic.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2016

Deterministic root finding over finite fields using Graeffe transforms.

[BibT_eX]

[DOI]

Bruno Grenet

Appl. Algebra Eng. Commun. Comput., 2016

Fast Polynomial Multiplication over F<sub>2</sub><sub>60</sub>.

[BibT_eX]

[DOI]

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Mathematical Font Art.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2016, 2016

Evaluating Straight-Line Programs over Balls.

[BibT_eX]

[DOI]

Proceedings of the 23nd IEEE Symposium on Computer Arithmetic, 2016

2015

Towards semantic mathematical editing.

[BibT_eX]

[DOI]

J. Symb. Comput., 2015

Certifying Trajectories of Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms.

[BibT_eX]

[DOI]

Bruno Grenet

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

Faster FFTs in Medium Precision.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE Symposium on Computer Arithmetic, 2015

2014

Sparse Polynomial Interpolation in Practice.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2014

Faster relaxed multiplication.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

GNU $_{\scriptsize{\rm MACS}}$ towards a Scientific Office Suite.

[BibT_eX]

[DOI]

Massimiliano Gubinelli

François Poulain

Denis Raux

Proceedings of the Mathematical Software - ICMS 2014, 2014

2013

Toward a Model Theory for Transseries.

[BibT_eX]

[DOI]

Matthias Aschenbrenner

Lou van den Dries

Notre Dame J. Formal Log., 2013

On the bit-complexity of sparse polynomial and series multiplication.

[BibT_eX]

[DOI]

J. Symb. Comput., 2013

Guessing singular dependencies.

[BibT_eX]

[DOI]

J. Symb. Comput., 2013

GNU TEXmacs: a scientific editing platform.

[BibT_eX]

[DOI]

Andrey Grozin

Massimiliano Gubinelli

François Poulain

Denis Raux

ACM Commun. Comput. Algebra, 2013

Multi-point evaluation in higher dimensions.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2013

Structured FFT and TFT: symmetric and lattice polynomials.

[BibT_eX]

[DOI]

Romain Lebreton

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Interfacing mathemagix with C++.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

On the complexity of multivariate blockwise polynomial multiplication.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Quasi-optimal Multiplication of Linear Differential Operators.

[BibT_eX]

[DOI]

Alexandre Benoît

Alin Bostan

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Overview of the Mathemagix Type System.

[BibT_eX]

[DOI]

Proceedings of the Computer Mathematics, 2012

2011

Meta-expansion of transseries.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

Homotopy techniques for multiplication modulo triangular sets.

[BibT_eX]

[DOI]

Alin Bostan

Muhammad F. I. Chowdhury

J. Symb. Comput., 2011

Mathemagix: the quest of modularity and efficiency for symbolic and certified numeric computation?

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2011

2010

Newton's method and FFT trading.

[BibT_eX]

[DOI]

J. Symb. Comput., 2010

2009

On asymptotic extrapolation.

[BibT_eX]

[DOI]

J. Symb. Comput., 2009

Characteristic set method for differential-difference polynomial systems.

[BibT_eX]

[DOI]

J. Symb. Comput., 2009

On the bit-complexity of sparse polynomial multiplication

[BibT_eX]

[DOI]

CoRR, 2009

Homotopy methods for multiplication modulo triangular sets

[BibT_eX]

[DOI]

Alin Bostan

Muhammad F. I. Chowdhury

CoRR, 2009

2007

On Effective Analytic Continuation.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2007

New algorithms for relaxed multiplication.

[BibT_eX]

[DOI]

J. Symb. Comput., 2007

Generalized power series solutions to linear partial differential equations.

[BibT_eX]

[DOI]

J. Symb. Comput., 2007

Efficient accelero-summation of holonomic functions.

[BibT_eX]

[DOI]

J. Symb. Comput., 2007

Around the numeric-symbolic computation of differential Galois groups.

[BibT_eX]

[DOI]

J. Symb. Comput., 2007

2006

Computations with effective real numbers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Complexity bounds for zero-test algorithms.

[BibT_eX]

[DOI]

John Shackell

J. Symb. Comput., 2006

Counterexamples to witness conjectures.

[BibT_eX]

[DOI]

J. Symb. Comput., 2006

Effective real numbers in Mmxlib.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2005

Effective analytic functions.

[BibT_eX]

[DOI]

J. Symb. Comput., 2005

2004

GNU TeXmacs.

[BibT_eX]

[DOI]

SIGSAM Bull., 2004

The truncated fourier transform and applications.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2004

2003

Relaxed mltiplication using the middle product.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2003

2002

Relax, but Don't be Too Lazy.

[BibT_eX]

[DOI]

J. Symb. Comput., 2002

FFT-like Multiplication of Linear Differential Operators.

[BibT_eX]

[DOI]

J. Symb. Comput., 2002

A new zero-test for formal power series.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2002

2001

Fast Evaluation of Holonomic Functions Near and in Regular Singularities.

[BibT_eX]

[DOI]

J. Symb. Comput., 2001

2000

Shuffle algebra and polylogarithms.

[BibT_eX]

[DOI]

Vincel Hoang Ngoc Minh

Michel Petitot

Discret. Math., 2000

1999

Fast Evaluation of Holonomic Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

1998

Generic Asymptotic Expansions.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1998

Computation of the Monodromy of Generalized Polylogarithms.

[BibT_eX]

[DOI]

Vincel Hoang Ngoc Minh

Michel Petitot

Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

1997

Lazy Multiplication of Formal Power Series.

[BibT_eX]

[DOI]