| Publication | Date of Publication | Type |
|---|
| An effective algorithm for deciding the solvability of a system of polynomial equations over 𝑝-adic integers | 2022-11-17 | Paper |
| An effective construction of a small number of equations defining an algebraic variety | 2022-06-16 | Paper |
| Subexponential-time computation of isolated primary components of a polynomial ideal | 2021-05-26 | Paper |
| Efficient estimation of roots from the field of fractional power series of a given polynomial in nonzero characteristic | 2021-05-26 | Paper |
| Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III | 2020-09-29 | Paper |
| On the estimation of coefficients of irreducible factors of polynomials over a field of formal power series in nonzero characteristic | 2020-06-24 | Paper |
| Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II | 2020-03-25 | Paper |
| Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I | 2018-08-16 | Paper |
| Extension of the Newton–Puiseux algorithm to the case of a nonzero characteristic ground field. I | 2017-10-17 | Paper |
| Efficient absolute factorization of polynomials with parametric coefficients | 2017-10-04 | Paper |
| Computations with parameters: a theoretical background | 2016-07-19 | Paper |
| A deterministic polynomial-time algorithm for the first Bertini theorem. III | 2015-10-29 | Paper |
| A deterministic polynomial-time algorithm for the first Bertini theorem. II | 2015-02-20 | Paper |
| Effective construction of an algebraic variety nonsingular in codimension one over a ground field of zero characteristic | 2015-02-20 | Paper |
| A deterministic polynomial-time algorithm for the first Bertini theorem. I | 2014-09-25 | Paper |
| An overview of effective normalization of a projective algebraic variety nonsingular in codimension one | 2014-06-06 | Paper |
| Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero) | 2014-01-17 | Paper |
| A bound for the degree of a system of equations determining the variety of reducible polynomials | 2013-09-16 | Paper |
| An effective version of the first Bertini theorem in nonzero characteristic and its applications | 2013-07-30 | Paper |
| An improvement of the complexity bound for solving systems of polynomial equations | 2012-11-27 | Paper |
| Inequalities for Hilbert functions and primary decompositions | 2011-03-02 | Paper |
| Complexity of a standard basis of a $D$-module | 2011-03-02 | Paper |
| Double-exponential lower bound for the degree of any system of generators of a polynomial prime ideal | 2011-03-02 | Paper |
| Effective normalization of a nonsingular in codimension one algebraic variety | 2010-02-05 | Paper |
| Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV. | 2009-11-13 | Paper |
| On the construction of a family of transversal subspaces over finite fields | 2008-06-17 | Paper |
| Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties | 2007-05-02 | Paper |
| Complexity of Janet basis of a D-module | 2007-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5718646 | 2006-01-16 | Paper |
| Monodromy and irreducibility criteria with algorithmic applications in characteristic zero | 2006-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5695533 | 2005-10-13 | Paper |
| Polynomial-Time Computation of the Degree of a Dominant Morphism in Characteristic Zero. I | 2005-10-11 | Paper |
| Vandermonde matrices, NP-completeness and transversal subspaces | 2004-05-27 | Paper |
| Efficient smooth stratification of an algebraic variety in zero characteristic and its applications | 2003-08-15 | Paper |
| Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications. | 2002-04-14 | Paper |
| Strong version of the basic deciding algorithm for the existential theory of real fields | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2764198 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226940 | 1999-05-30 | Paper |
| Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic | 1998-07-23 | Paper |
| Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic | 1998-06-23 | Paper |
| Polynomial complexity algorithms for computational problems in the theory of algebraic curves | 1993-09-15 | Paper |
| Algorithm of polynomial complexity for factoring polynomials over local fields | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4011252 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974849 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4712895 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3362375 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3475342 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3775643 | 1987-01-01 | Paper |
| Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3776501 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3719722 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3728104 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5184990 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5187264 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4747509 | 1982-01-01 | Paper |
| Birational equivalence of tori with a cyclic splitting field | 1981-01-01 | Paper |
| The rationality of a class of tori | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3871070 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3900171 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133741 | 1976-01-01 | Paper |
