| Publication | Date of Publication | Type |
|---|
| Interpolation by decomposable univariate polynomials | 2024-10-07 | Paper |
| Smooth symmetric systems over a finite field and applications | 2023-12-14 | Paper |
| The distribution of defective multivariate polynomial systems over a finite field | 2023-11-29 | Paper |
| Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field | 2023-03-31 | Paper |
| On the computation of rational solutions of underdetermined systems over a finite field | 2023-02-17 | Paper |
| On the computation of rational solutions of underdetermined systems over a finite field | 2022-06-24 | Paper |
| Shifted varieties and discrete neighborhoods around varieties | 2021-09-29 | Paper |
| Interpolation by decomposable univariate polynomials | 2021-03-29 | Paper |
| Factorization patterns on nonlinear families of univariate polynomials over a finite field | 2020-03-06 | Paper |
| Improved bounds for the inverses of diagonally dominant tridiagonal matrices | 2019-07-12 | Paper |
| Explicit estimates for polynomial systems defining irreducible smooth complete intersections | 2019-05-13 | Paper |
| On the bit complexity of polynomial system solving | 2019-03-27 | Paper |
| The distribution of factorization patterns on linear families of polynomials over a finite field | 2019-02-01 | Paper |
| Density of real and complex decomposable univariate polynomials | 2018-11-20 | Paper |
| On the computation of rational points of a hypersurface over a finite field | 2017-07-04 | Paper |
| On the value set of small families of polynomials over a finite field. III. | 2016-11-08 | Paper |
| Quiz games as a model for information hiding | 2016-04-20 | Paper |
| Number of rational points of symmetric complete intersections over a finite field and applications | 2015-10-13 | Paper |
| Newton's method and a mesh-independence principle for certain semilinear boundary-value problems | 2015-09-09 | Paper |
| Explicit estimates for the number of rational points of singular complete intersections over a finite field | 2015-09-09 | Paper |
| Degeneracy loci and polynomial equation solving | 2015-04-20 | Paper |
| Polar varieties, Bertini's theorems and number of points of singular complete intersections over a finite field | 2014-11-21 | Paper |
| On the value set of small families of polynomials over a finite field, II | 2014-09-16 | Paper |
| On the value set of small families of polynomials over a finite field. I | 2014-03-14 | Paper |
| On the value set of small families of polynomials over a finite field, II | 2013-10-11 | Paper |
| The number of reducible space curves over a finite field | 2013-02-21 | Paper |
| Singularities of symmetric hypersurfaces and Reed-Solomon codes | 2012-05-11 | Paper |
| Lower complexity bounds for interpolation algorithms | 2011-04-13 | Paper |
| Robust algorithms for generalized Pham systems | 2011-02-18 | Paper |
| On the solution of the polynomial systems arising in the discretization of certain ODEs | 2009-09-09 | Paper |
| Deformation techniques for sparse systems | 2009-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5447283 | 2008-03-06 | Paper |
| An effective Bertini theorem and the number of rational points of a normal complete intersection over a finite field | 2007-10-23 | Paper |
| Fast computation of a rational point of a variety over a finite field | 2007-02-01 | Paper |
| Improved explicit estimates on the number of solutions of equations over a finite field | 2006-04-28 | Paper |
| Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study | 2005-09-02 | Paper |
| Uniform bounds on the number of rational points of a family of curves of genus 2 | 2005-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660702 | 2005-04-04 | Paper |
| Fast computation of discrete invariants associated to a differential rational mapping | 2004-08-20 | Paper |
| Polynomial equation solving by lifting procedures for ramified fibers | 2004-08-06 | Paper |
| A new method to obtain lower bounds for polynomial evaluation | 2001-08-20 | Paper |
| On the time-space complexity of geometric elimination procedures | 2001-07-22 | Paper |
| Probabilistic algorithms for geometric elimination | 2000-04-03 | Paper |
| Time-space tradeoffs in algebraic complexity theory | 2000-01-01 | Paper |
| Le rapport entre le temps et l'espace pour l'évaluation des polynômes | 1999-06-20 | Paper |
| The intrinsic complexity of parametric elimination methods | 1999-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218097 | 1999-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352809 | 1997-09-04 | Paper |
| The Space Complexity of Elimination Theory: Upper Bounds | 1997-05-12 | Paper |
