List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Yet another differential shape lemma Journal of Algebra | 2026-02-26 | Paper |
| Relative differential closure in Hardy fields Monatshefte für Mathematik | 2026-01-02 | Paper |
| Sparse polynomial interpolation: faster strategies over finite fields Applicable Algebra in Engineering, Communication and Computing | 2025-11-17 | Paper |
| Quasi-optimal multiplication of linear differential operators | 2025-05-05 | Paper |
| Fuchsian holonomic sequences Applicable Algebra in Engineering, Communication and Computing | 2025-04-15 | Paper |
| Factoring sparse polynomials fast Journal of Complexity | 2025-03-31 | Paper |
| Plane curve germs and contact factorization Applicable Algebra in Engineering, Communication and Computing | 2025-01-31 | Paper |
| Amortized bivariate multi-point evaluation | 2025-01-20 | Paper |
| A zero test for \(\sigma \)-algebraic power Series | 2025-01-20 | Paper |
| On the complexity of symbolic computation | 2025-01-17 | Paper |
| Fast interpolation of multivariate polynomials with sparse exponents Journal of Complexity | 2025-01-17 | Paper |
| Filling gaps in Hardy fields Journal für die Reine und Angewandte Mathematik | 2024-10-30 | Paper |
| Surreal substructures Fundamenta Mathematicae | 2024-10-07 | Paper |
| Univariate polynomial factorization over finite fields with large extension degree Applicable Algebra in Engineering, Communication and Computing | 2024-03-01 | Paper |
| The hyperserial field of surreal numbers | 2023-10-23 | Paper |
| Surreal numbers as hyperseries | 2023-10-23 | Paper |
| Filling gaps in Hardy fields | 2023-08-04 | Paper |
| Faster integer multiplication using short lattice vectors Open Book Series | 2023-08-02 | Paper |
| Surreal substructures | 2023-05-03 | Paper |
| Maximal Hardy Fields | 2023-04-21 | Paper |
| Ultimate complexity for numerical algorithms ACM Communications in Computer Algebra | 2023-01-10 | Paper |
| On a differential intermediate value property Revista de la Unión Matemática Argentina | 2022-11-29 | Paper |
| Amortized multi-point evaluation of multivariate polynomials Journal of Complexity | 2022-11-23 | Paper |
| Implementing the tangent Graeffe root finding method Lecture Notes in Computer Science | 2022-10-13 | Paper |
| On sparse interpolation of rational functions and gcds ACM Communications in Computer Algebra | 2022-09-06 | Paper |
| Computing one billion roots using the tangent Graeffe method ACM Communications in Computer Algebra | 2022-09-06 | Paper |
| Revisiting closed asymptotic couples Proceedings of the Edinburgh Mathematical Society | 2022-07-13 | Paper |
| Polynomial multiplication over finite fields in time \(O(n\log n)\) Journal of the ACM | 2022-03-31 | Paper |
| Constructing reductions for creative telescoping. The general differentially finite case Applicable Algebra in Engineering, Communication and Computing | 2021-11-23 | Paper |
| Fast amortized multi-point evaluation Journal of Complexity | 2021-11-02 | Paper |
| scientific article; zbMATH DE number 7370154 (Why is no real title available?) | 2021-07-08 | Paper |
| On a Differential Intermediate Value Property (available as arXiv preprint) | 2021-05-26 | Paper |
| Integer multiplication in time \(O(n\log n)\) Annals of Mathematics. Second Series | 2021-04-08 | Paper |
| On the complexity exponent of polynomial system solving Foundations of Computational Mathematics | 2021-03-23 | Paper |
| Fast computation of generic bivariate resultants Journal of Complexity | 2021-02-26 | Paper |
| On numbers, germs, and transseries Proceedings of the International Congress of Mathematicians (ICM 2018) | 2020-09-22 | Paper |
| LU factorization with errors Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
| The Frobenius FFT Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
| Composition modulo powers of polynomials Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
| Fast reduction of bivariate polynomials with respect to sufficiently regular Gröbner bases Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
| Directed evaluation Journal of Complexity | 2020-08-17 | Paper |
| Effective asymptotics analysis for finance International Journal of Theoretical and Applied Finance | 2020-06-25 | Paper |
| Fast multivariate multi-point evaluation revisited Journal of Complexity | 2019-12-30 | Paper |
| Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals Applicable Algebra in Engineering, Communication and Computing | 2019-12-18 | Paper |
| Accelerated tower arithmetic Journal of Complexity | 2019-11-21 | Paper |
| Logarithmic hyperseries Transactions of the American Mathematical Society | 2019-09-26 | Paper |
| Faster polynomial multiplication over finite fields using cyclotomic coefficient rings Journal of Complexity | 2019-09-19 | Paper |
| From implicit to recursive equations Applicable Algebra in Engineering, Communication and Computing | 2019-07-11 | Paper |
| Effective power series computations Foundations of Computational Mathematics | 2019-06-06 | Paper |
| The surreal numbers as a universal \(H\)-field Journal of the European Mathematical Society (JEMS) | 2019-04-24 | Paper |
| Hardy fields, the intermediate value property, and $\omega$-freeness | 2019-04-01 | Paper |
| Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals ACM Communications in Computer Algebra | 2019-03-29 | Paper |
| Computing with D-algebraic power series Applicable Algebra in Engineering, Communication and Computing | 2019-03-15 | Paper |
| Implementing fast carryless multiplication Mathematical Aspects of Computer and Information Sciences | 2019-03-14 | Paper |
| Efficient certification of numeric solutions to eigenproblems Mathematical Aspects of Computer and Information Sciences | 2019-03-14 | Paper |
| Fast Chinese remaindering in practice Mathematical Aspects of Computer and Information Sciences | 2019-03-14 | Paper |
| Faster integer multiplication using plain vanilla FFT primes Mathematics of Computation | 2018-09-20 | Paper |
| Maximal immediate extensions of valued differential fields Proceedings of the London Mathematical Society | 2018-08-30 | Paper |
| Faster polynomial multiplication over finite fields Journal of the ACM | 2018-08-02 | Paper |
| Modular composition via factorization Journal of Complexity | 2018-07-27 | Paper |
| Modular SIMD arithmetic in \textsc{Mathemagix} ACM Transactions on Mathematical Software | 2018-07-20 | Paper |
| On the complexity of integer matrix multiplication Journal of Symbolic Computation | 2018-06-06 | Paper |
| Dimension in the realm of transseries Ordered Algebraic Structures and Related Topics | 2018-04-16 | Paper |
| On the complexity of multivariate polynomial division Applications of Computer Algebra | 2018-04-05 | Paper |
| Preserving syntactic correctness while editing mathematical formulas Applications of Computer Algebra | 2018-04-05 | Paper |
| Faster integer and polynomial multiplication using cyclotomic coefficient rings | 2017-12-11 | Paper |
| Fast polynomial multiplication over \(\mathbb{F}_{2^{60}}\) Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
| Asymptotic differential algebra and model theory of transseries (available as arXiv preprint) | 2017-02-14 | Paper |
| Structured FFT and TFT: symmetric and lattice polynomials Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
| Effective real numbers in Mmxlib Proceedings of the 2006 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
| Randomized root finding over finite FFT-fields using tangent Graeffe transforms Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
| Mathematical font art Mathematical Software – ICMS 2016 | 2016-09-28 | Paper |
| Even faster integer multiplication Journal of Complexity | 2016-09-01 | Paper |
| Deterministic root finding over finite fields using Graeffe transforms Applicable Algebra in Engineering, Communication and Computing | 2016-06-29 | Paper |
| Certifying trajectories of dynamical systems Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
| Overview of the Mathemagix type system Computer Mathematics | 2016-04-12 | Paper |
| On the complexity of skew arithmetic Applicable Algebra in Engineering, Communication and Computing | 2016-03-18 | Paper |
| Faster relaxed multiplication Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
| Towards semantic mathematical editing Journal of Symbolic Computation | 2015-06-11 | Paper |
| On the complexity of multivariate blockwise polynomial multiplication Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation | 2015-03-27 | Paper |
| Mathemagix: the quest of modularity and efficiency for symbolic and certified numeric computation? ACM Communications in Computer Algebra | 2015-02-20 | Paper |
| GNU TeX\(_{\mathrm{MACS}}\) towards a scientific office suite Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
| Automatic asymptotics for coefficients of smooth, bivariate rational functions | 2014-07-30 | Paper |
| Automatic asymptotics for coefficients of smooth, bivariate rational functions (available as arXiv preprint) | 2014-07-30 | Paper |
| Guessing singular dependencies Journal of Symbolic Computation | 2014-03-03 | Paper |
| Toward a model theory for transseries Notre Dame Journal of Formal Logic | 2013-10-09 | Paper |
| Toward a model theory for transseries Notre Dame Journal of Formal Logic | 2013-10-09 | Paper |
| Multi-point evaluation in higher dimensions Applicable Algebra in Engineering, Communication and Computing | 2013-02-21 | Paper |
| On the bit-complexity of sparse polynomial and series multiplication Journal of Symbolic Computation | 2013-01-10 | Paper |
| Relaxed algorithms for \(p\)-adic numbers Journal de Théorie des Nombres de Bordeaux | 2012-08-31 | Paper |
| Homotopy techniques for multiplication modulo triangular sets Journal of Symbolic Computation | 2011-12-19 | Paper |
| Meta-expansion of transseries Journal of Symbolic Computation | 2011-03-09 | Paper |
| Newton's method and FFT trading Journal of Symbolic Computation | 2010-06-25 | Paper |
| Transserial Hardy fields | 2010-06-08 | Paper |
| On asymptotic extrapolation Journal of Symbolic Computation | 2009-06-11 | Paper |
| New algorithms for relaxed multiplication Journal of Symbolic Computation | 2008-02-04 | Paper |
| Generalized power series solutions to linear partial differential equations Journal of Symbolic Computation | 2008-02-04 | Paper |
| On effective analytic continuation Mathematics in Computer Science | 2008-01-04 | Paper |
| Efficient accelero-summation of holonomic functions Journal of Symbolic Computation | 2007-10-23 | Paper |
| Complexity bounds for zero-test algorithms Journal of Symbolic Computation | 2007-10-23 | Paper |
| Counterexamples to witness conjectures Journal of Symbolic Computation | 2007-10-23 | Paper |
| Around the numeric-symbolic computation of differential Galois groups Journal of Symbolic Computation | 2007-10-23 | Paper |
| Effective analytic functions Journal of Symbolic Computation | 2007-10-19 | Paper |
| Transseries and real differential algebra Lecture Notes in Mathematics | 2006-10-23 | Paper |
| Computations with effective real numbers Theoretical Computer Science | 2006-03-20 | Paper |
| Differentially algebraic gaps Selecta Mathematica. New Series | 2006-02-08 | Paper |
| scientific article; zbMATH DE number 2151193 (Why is no real title available?) | 2005-04-04 | Paper |
| scientific article; zbMATH DE number 2151225 (Why is no real title available?) | 2005-04-04 | Paper |
| The truncated fourier transform and applications Proceedings of the 2004 international symposium on Symbolic and algebraic computation | 2005-03-14 | Paper |
| scientific article; zbMATH DE number 1971810 (Why is no real title available?) | 2004-03-10 | Paper |
| Relax, but don't be too lazy Journal of Symbolic Computation | 2003-04-02 | Paper |
| FFT-like multiplication of linear differential operators Journal of Symbolic Computation | 2002-06-11 | Paper |
| Operators on generalized power series Illinois Journal of Mathematics | 2002-04-28 | Paper |
| Fast evaluation of holonomic functions near and in regular singularities Journal of Symbolic Computation | 2002-04-11 | Paper |
| Shuffle algebra and polylogarithms Discrete Mathematics | 2001-07-29 | Paper |
| scientific article; zbMATH DE number 1540613 (Why is no real title available?) | 2000-12-04 | Paper |
| scientific article; zbMATH DE number 1262459 (Why is no real title available?) | 1999-09-23 | Paper |
| scientific article; zbMATH DE number 1254307 (Why is no real title available?) | 1999-06-07 | Paper |
| Generic asymptotic expansions Applicable Algebra in Engineering, Communication and Computing | 1999-05-05 | Paper |
| scientific article; zbMATH DE number 1253958 (Why is no real title available?) | 1999-02-23 | Paper |
| Fast evaluation of holonomic functions Theoretical Computer Science | 1999-01-12 | Paper |
| On the computation of limsups Journal of Pure and Applied Algebra | 1997-07-27 | Paper |
| scientific article; zbMATH DE number 1024661 (Why is no real title available?) | 1997-06-22 | Paper |
| Factoring sparse polynomials fast (available as arXiv preprint) | N/A | Paper |
| Fast interpolation of sparse multivariate polynomials (available as arXiv preprint) | N/A | Paper |
| A Normalization Theorem in Asymptotic Differential Algebra (available as arXiv preprint) | N/A | Paper |
| Constructing $\omega$-free Hardy fields (available as arXiv preprint) | N/A | Paper |
Research outcomes over time
This page was built for person: Joris van der Hoeven
