| Publication | Date of Publication | Type |
|---|
Towards a library for straight-line programs
Applicable Algebra in Engineering, Communication and Computing | 2026-04-20 | Paper |
Sparse polynomial interpolation: faster strategies over finite fields
Applicable Algebra in Engineering, Communication and Computing | 2025-11-17 | Paper |
A proof of the Brill-Noether method from scratch
ACM Communications in Computer Algebra | 2025-02-28 | 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 |
Fast interpolation of multivariate polynomials with sparse exponents
Journal of Complexity | 2025-01-17 | Paper |
Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
Applicable Algebra in Engineering, Communication and Computing | 2024-11-01 | Paper |
Univariate polynomial factorization over finite fields with large extension degree
Applicable Algebra in Engineering, Communication and Computing | 2024-03-01 | Paper |
Ultimate complexity for numerical algorithms
ACM Communications in Computer Algebra | 2023-01-10 | Paper |
Amortized multi-point evaluation of multivariate polynomials
Journal of Complexity | 2022-11-23 | Paper |
Computing Riemann-Roch spaces via Puiseux expansions
Journal of Complexity | 2022-09-12 | Paper |
On sparse interpolation of rational functions and gcds
ACM Communications in Computer Algebra | 2022-09-06 | Paper |
| A proof of the Brill-Noether method from scratch | 2022-08-26 | Paper |
Fast amortized multi-point evaluation
Journal of Complexity | 2021-11-02 | 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 |
Sub-quadratic time for riemann-roch spaces
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
Composition modulo powers of polynomials
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Directed evaluation
Journal of Complexity | 2020-08-17 | Paper |
Fast multivariate multi-point evaluation revisited
Journal of Complexity | 2019-12-30 | Paper |
Accelerated tower arithmetic
Journal of Complexity | 2019-11-21 | Paper |
Implementing fast carryless multiplication
Mathematical Aspects of Computer and Information Sciences | 2019-03-14 | Paper |
On the complexity of the Lickteig-Roy subresultant algorithm
Journal of Symbolic Computation | 2018-12-28 | 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 |
Preserving syntactic correctness while editing mathematical formulas
Applications of Computer Algebra | 2018-04-05 | Paper |
A short survey on Kantorovich-like theorems for Newton's method
ACM Communications in Computer Algebra | 2017-06-22 | 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 |
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 |
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 |
Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
Proceedings of the 2000 international symposium on Symbolic and algebraic computation | 2015-11-26 | Paper |
Degeneracy loci and polynomial equation solving
Foundations of Computational Mathematics | 2015-04-20 | 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 |
Polynomial root finding over local rings and application to error correcting codes
Applicable Algebra in Engineering, Communication and Computing | 2014-03-24 | 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 |
Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
Mathematics of Computation | 2012-06-29 | Paper |
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
Journal of Complexity | 2011-12-14 | Paper |
| Fast multivariate power series multiplication in characteristic zero | 2011-01-27 | Paper |
Mathemagix: Towards Large Scale Programming for Symbolic and Certified Numeric Computations
Mathematical Software – ICMS 2010 | 2010-09-14 | Paper |
New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
Applicable Algebra in Engineering, Communication and Computing | 2010-04-20 | Paper |
| Differential equations for algebraic functions | 2009-01-20 | Paper |
Fast separable factorization and applications
Applicable Algebra in Engineering, Communication and Computing | 2008-05-14 | Paper |
A concise proof of the Kronecker polynomial system solver from scratch
Expositiones Mathematicae | 2008-05-08 | Paper |
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation | 2007-10-23 | Paper |
Lifting and recombination techniques for absolute factorization
Journal of Complexity | 2007-07-04 | Paper |
On location and approximation of clusters of zeros: Case of embedding dimension one
Foundations of Computational Mathematics | 2007-03-12 | Paper |
On location and approximation of clusters of zeros of analytic functions
Foundations of Computational Mathematics | 2006-09-28 | Paper |
Sharp precision in Hensel lifting for bivariate polynomial factorization
Mathematics of Computation | 2006-03-27 | Paper |
| scientific article; zbMATH DE number 2151179 (Why is no real title available?) | 2005-04-04 | Paper |
Complexity issues in bivariate polynomial factorization
Proceedings of the 2004 international symposium on Symbolic and algebraic computation | 2005-03-14 | Paper |
Quadratic Newton iteration for systems with multiplicity
Foundations of Computational Mathematics | 2003-07-13 | Paper |
A Gröbner free alternative for polynomial system solving
Journal of Complexity | 2003-01-27 | Paper |
The Projective Noether Maple Package: Computing the dimension of a projective variety
Journal of Symbolic Computation | 2001-03-06 | Paper |
Fast interpolation of sparse multivariate polynomials
(available as arXiv preprint) | N/A | Paper |
