| Publication | Date of Publication | Type |
|---|
| Real zeros of mixed random fewnomial systems | 2023-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6115395 | 2023-07-12 | Paper |
| Rigid continuation paths II. structured polynomial systems | 2023-06-02 | Paper |
| Nonarchimedean integral geometry | 2022-06-08 | Paper |
| The zonoid algebra, generalized mixed volumes, and random determinants | 2022-05-11 | Paper |
| Computing the homology of semialgebraic sets. II: General formulas | 2021-11-26 | Paper |
| Correction to: ``The complexity of factors of multivariate polynomials | 2021-01-06 | Paper |
| The real tau‐conjecture is true on average | 2020-11-30 | Paper |
| Probabilistic Schubert calculus | 2020-03-02 | Paper |
| Computing the homology of semialgebraic sets. I: Lax formulas | 2020-01-31 | Paper |
| On the Number of Real Zeros of Random Fewnomials | 2020-01-22 | Paper |
| Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time | 2019-02-25 | Paper |
| No occurrence obstructions in geometric complexity theory | 2018-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584049 | 2018-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3176573 | 2018-07-23 | Paper |
| A stable, polynomial-time algorithm for the eigenpair problem | 2018-06-21 | Paper |
| Efficient algorithms for tensor scaling, quantum marginals and moment polytopes | 2018-04-12 | Paper |
| On the condition of the zeros of characteristic polynomials | 2017-09-07 | Paper |
| Membership in Moment Polytopes is in NP and coNP | 2017-06-28 | Paper |
| Condition of Intersecting a Projective Variety with a Varying Linear Subspace | 2017-05-23 | Paper |
| Fundamental invariants of orbit closures | 2017-03-16 | Paper |
| Condition length and complexity for the solution of polynomial systems | 2017-02-01 | Paper |
| Permanent versus determinant: Not via saturations | 2016-12-29 | Paper |
| Permanent versus determinant, obstructions, and Kronecker coefficients | 2016-07-11 | Paper |
| Computing the Chow Variety of Quadratic Space Curves | 2016-05-25 | Paper |
| Distribution of the eigenvalues of a random system of homogeneous polynomials | 2016-03-08 | Paper |
| Probabilistic analysis of the Grassmann condition number | 2015-04-20 | Paper |
| Intrinsic volumes of symmetric cones and applications in convex programming | 2015-02-09 | Paper |
| A stable, polynomial-time algorithm for the eigenpair problem | 2014-10-01 | Paper |
| Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem | 2014-08-13 | Paper |
| Explicit lower bounds via geometric complexity theory | 2014-08-07 | Paper |
| Geometric complexity theory and tensor rank | 2014-06-05 | Paper |
| Deciding Positivity of Littlewood--Richardson Coefficients | 2014-04-10 | Paper |
| Condition | 2013-07-05 | Paper |
| A Coordinate-Free Condition Number for Convex Programming | 2013-01-04 | Paper |
| Intrinsic volumes of symmetric cones | 2012-05-08 | Paper |
| Robust smoothed analysis of a condition number for linear programming | 2012-02-22 | Paper |
| On a problem posed by Steve Smale | 2012-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096710 | 2011-11-11 | Paper |
| An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $\mathbf{VP}\neq\mathbf{VNP}$ | 2011-11-07 | Paper |
| Nonvanishing of Kronecker coefficients for rectangular shapes. | 2011-07-07 | Paper |
| Even partitions in plethysms. | 2011-05-16 | Paper |
| Smoothed Analysis of Moore–Penrose Inversion | 2011-03-02 | Paper |
| On defining integers and proving arithmetic circuit lower bounds | 2011-02-18 | Paper |
| Counting irreducible components of complex algebraic varieties | 2011-02-07 | Paper |
| Lower bounds on the bounded coefficient complexity of bilinear maps | 2010-08-17 | Paper |
| Counting complexity classes for numeric computations II | 2010-08-15 | Paper |
| The probability that a slightly perturbed numerical analysis problem is difficult | 2010-08-03 | Paper |
| Coverage processes on spheres and condition numbers for linear programming | 2010-04-21 | Paper |
| On the Complexity of Numerical Analysis | 2009-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3639865 | 2009-10-26 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| On the complexity of counting components of algebraic varieties | 2009-07-01 | Paper |
| Exotic quantifiers, complexity classes, and complete problems | 2009-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301652 | 2009-01-20 | Paper |
| Average Euler characteristic of random real algebraic varieties | 2007-12-12 | Paper |
| Exotic Quantifiers, Complexity Classes, and Complete Problems | 2007-11-28 | Paper |
| On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds | 2007-09-03 | Paper |
| The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties | 2007-03-12 | Paper |
| Smoothed analysis of complex conic condition numbers | 2007-02-13 | Paper |
| The complexity of semilinear problems in succinct representation | 2007-01-24 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Counting complexity classes for numeric computations. III: Complex projective sets | 2006-09-28 | Paper |
| General formulas for the smoothed analysis of condition numbers | 2006-08-14 | Paper |
| Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets | 2006-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465357 | 2005-08-22 | Paper |
| The complexity of factors of multivariate polynomials | 2005-02-24 | Paper |
| The complexity to compute the Euler characteristic of complex varieties | 2004-11-23 | Paper |
| Counting Complexity Classes for Numeric Computations I: Semilinear Sets | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428715 | 2003-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779131 | 2002-11-25 | Paper |
| The Computational Complexity to Evaluate Representations of General Linear Groups | 2000-10-18 | Paper |
| The Computational Complexity of Immanants | 2000-10-18 | Paper |
| Completeness and reduction in algebraic complexity theory | 2000-06-14 | Paper |
| Cook's versus Valiant's hypothesis | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3836529 | 1999-12-09 | Paper |
| On the parallel complexity of the polynomial ideal membership problem | 1998-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381389 | 1998-08-30 | Paper |
| Algebraic complexity theory. I: An introduction | 1998-03-12 | Paper |
| Algebraic complexity theory. II: Tast matrix multiplication and combinatorics. | 1998-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331740 | 1997-02-05 | Paper |
| Some computational problems in linear algebra as hard as matrix multiplication | 1993-10-10 | Paper |
| On randomized semi-algebraic test complexity | 1993-08-24 | Paper |
| Verification complexity of linear prime ideals | 1993-04-01 | Paper |
| Test complexity of generic polynomials | 1993-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3997432 | 1992-09-17 | Paper |
