| Publication | Date of Publication | Type |
|---|
| When can you trust feature selection? -- II: On the effects of random data on condition in statistics and optimisation | 2023-12-18 | Paper |
| Rigid continuation paths II. structured polynomial systems | 2023-06-02 | Paper |
| Logics which capture complexity classes over the reals | 2022-12-09 | Paper |
| Functional norms, condition numbers and numerical algorithms in algebraic geometry | 2022-12-08 | Paper |
| On the complexity of the Plantinga-Vegter algorithm | 2022-09-16 | Paper |
| Computing the homology of semialgebraic sets. II: General formulas | 2021-11-26 | Paper |
| Smale 17th Problem: Advances and Open Directions | 2021-09-28 | Paper |
| Plantinga-Vegter Algorithm takes Average Polynomial Time | 2020-09-10 | Paper |
| Recent advances in the computation of the homology of semialgebraic sets | 2020-05-12 | Paper |
| On local analysis | 2020-03-03 | Paper |
| Computing the homology of semialgebraic sets. I: Lax formulas | 2020-01-31 | Paper |
| On local analysis | 2019-05-20 | Paper |
| Computing the homology of real projective sets | 2019-03-01 | Paper |
| Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time | 2019-02-25 | Paper |
| On Flocks Under Switching Directed Interaction Topologies | 2019-01-23 | Paper |
| A stable, polynomial-time algorithm for the eigenpair problem | 2018-06-21 | Paper |
| Grid methods in computational real algebraic (and semialgebraic) geometry | 2018-05-31 | Paper |
| On the condition of the zeros of characteristic polynomials | 2017-09-07 | Paper |
| Avoiding Collisions in Flocks | 2017-08-25 | Paper |
| A General Collision-Avoiding Flocking Framework | 2017-08-25 | Paper |
| Emergent Behavior in Flocks | 2017-07-27 | Paper |
| On flocks influenced by closest neighbors | 2017-02-02 | Paper |
| Condition length and complexity for the solution of polynomial systems | 2017-02-01 | Paper |
| Probabilistic analyses of condition numbers | 2016-07-08 | Paper |
| Complexity and dimension | 2016-05-26 | Paper |
| A randomized homotopy for the Hermitian eigenpair problem | 2015-04-20 | Paper |
| Solving second-order conic systems with variable precision | 2015-04-16 | Paper |
| A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF | 2015-03-11 | Paper |
| Smoothed analysis of componentwise condition numbers for sparse matrices | 2015-02-17 | 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 |
| Fast computation of zeros of polynomial systems with bounded degree under finite-precision | 2014-03-12 | Paper |
| A conditional, collision-avoiding, model for swarming | 2013-11-11 | Paper |
| On the Average Condition of Random Linear Programs | 2013-09-25 | Paper |
| Condition | 2013-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4925797 | 2013-06-12 | Paper |
| On sparseness and Turing reducibility over the reals | 2013-04-19 | Paper |
| Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH | 2013-04-19 | Paper |
| Manifold Mirrors | 2013-04-08 | Paper |
| Round-off estimates for second-order conic feasibility problems | 2012-08-30 | Paper |
| The Legacy of Turing in Numerical Analysis | 2012-06-15 | Paper |
| On a problem posed by Steve Smale | 2012-02-11 | Paper |
| A numerical algorithm for zero counting. III: Randomization and condition | 2011-12-08 | Paper |
| Solving Linear Problems with Finite Precision III: Sharp Expectation Bounds | 2011-05-11 | Paper |
| A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis | 2011-04-13 | Paper |
| Smoothed Analysis of Moore–Penrose Inversion | 2011-03-02 | Paper |
| Parallel time and quantifier prefixes | 2011-02-18 | Paper |
| Counting complexity classes for numeric computations II | 2010-08-15 | Paper |
| Adversarial smoothed analysis | 2010-08-03 | Paper |
| The probability that a slightly perturbed numerical analysis problem is difficult | 2010-08-03 | Paper |
| Componentwise Condition Numbers of Random Sparse Matrices | 2010-05-25 | Paper |
| Coverage processes on spheres and condition numbers for linear programming | 2010-04-21 | Paper |
| On strata of degenerate polyhedral cones. II: Relations between condition measures | 2010-04-21 | Paper |
| ON THE CRITICAL EXPONENT FOR FLOCKS UNDER HIERARCHICAL LEADERSHIP | 2009-10-28 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| On strata of degenerate polyhedral cones. I: Condition and distance to strata | 2009-06-30 | Paper |
| Exotic quantifiers, complexity classes, and complete problems | 2009-06-22 | Paper |
| Flocking with informed agents | 2009-05-29 | Paper |
| A Condition Number for Multifold Conic Systems | 2009-03-06 | Paper |
| On the mathematics of emergence | 2009-02-06 | Paper |
| A numerical algorithm for zero counting II: Randomization and Condition | 2008-12-17 | Paper |
| A numerical algorithm for zero counting. I: Complexity and accuracy | 2008-12-03 | Paper |
| Flocking in noisy environments | 2008-04-10 | Paper |
| A note on parallel and alternating time | 2008-01-09 | Paper |
| Exotic Quantifiers, Complexity Classes, and Complete Problems | 2007-11-28 | Paper |
| Mixed and componentwise condition numbers for rectangular structured matrices | 2007-11-26 | Paper |
| Learning Theory | 2007-03-13 | Paper |
| On mixed and componentwise condition numbers for Moore–Penrose inverse and linear least squares problems | 2007-03-07 | Paper |
| Smoothed analysis of complex conic condition numbers | 2007-02-13 | Paper |
| The complexity of semilinear problems in succinct representation | 2007-01-24 | Paper |
| Smoothed analysis of some condition numbers | 2006-12-06 | 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 |
| Solving linear programs with finite precision. II: Algorithms | 2006-07-12 | Paper |
| Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets | 2006-05-16 | Paper |
| Implicit complexity over an arbitrary structure: Quantifier alternations | 2006-04-28 | Paper |
| Unifying Condition Numbers for Linear Programming | 2005-11-11 | Paper |
| Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems | 2005-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465357 | 2005-08-22 | Paper |
| A note on level-2 condition numbers | 2005-06-30 | Paper |
| On sparseness, reducibilities, and complexity | 2005-06-01 | Paper |
| Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673422 | 2005-04-29 | Paper |
| Modeling language evolution | 2005-03-11 | Paper |
| Complexity estimates depending on condition and round-off error | 2005-01-25 | Paper |
| The complexity to compute the Euler characteristic of complex varieties | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4822033 | 2004-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460831 | 2004-03-29 | Paper |
| Solving linear programs with finite precision. I: Condition numbers and random programs | 2004-03-11 | Paper |
| Counting Complexity Classes for Numeric Computations I: Semilinear Sets | 2004-01-08 | Paper |
| On the expected condition number of linear programming problems | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417859 | 2003-07-30 | Paper |
| Learning from rounded-off data. | 2003-05-27 | Paper |
| Real computations with fake numbers | 2003-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779151 | 2002-11-25 | Paper |
| Probabilistic analysis of condition numbers for linear programming | 2002-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776268 | 2002-06-30 | Paper |
| A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine | 2002-04-23 | Paper |
| There are No Sparse NPw-Hard Sets | 2002-04-23 | Paper |
| Decision problems and round-off machines | 2002-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789190 | 2002-01-01 | Paper |
| Best choices for regularization parameters in learning theory: on the bias-variance problem. | 2002-01-01 | Paper |
| On the mathematical foundations of learning | 2001-12-17 | Paper |
| On weak and weighted computations over the real closure of \(\mathbb{Q}\) | 2001-08-23 | Paper |
| A new condition number for linear programming | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938618 | 2000-09-20 | Paper |
| Complexity lower bounds for approximation algebraic computation trees | 2000-09-03 | Paper |
| Approximate zeros and condition numbers | 2000-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252028 | 2000-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268461 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234080 | 1999-06-29 | Paper |
| Logics which capture complexity classes over the reals | 1999-06-29 | Paper |
| A polynomial time algorithm for diophantine equations in one variable | 1999-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228729 | 1999-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4372496 | 1997-12-14 | Paper |
| On the Power of Real Turing Machines over Binary Inputs | 1997-11-10 | Paper |
| On digital nondeterminism | 1997-08-17 | Paper |
| COMPLEXITY AND REAL COMPUTATION: A MANIFESTO | 1997-07-17 | Paper |
| Machines Over the Reals and Non-Uniformity | 1997-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4717936 | 1997-03-31 | Paper |
| Generalized Knapsack problems and fixed degree separations | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4717931 | 1997-02-03 | Paper |
| Computing over the reals with addition and order: Higher complexity classes | 1996-05-05 | Paper |
| Separation of complexity classes in Koiran's weak model | 1994-11-27 | Paper |
| On the Complexity of Quantifier Elimination: the Structural Approach | 1993-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036593 | 1993-05-18 | Paper |
| TIME BOUNDED COMPUTATIONS OVER THE REALS | 1993-03-28 | Paper |
| Two \(P\)-complete problems in the theory of the reals | 1993-02-22 | Paper |
| \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) | 1993-01-17 | Paper |
| The Arithmetical Hierarchy Over the Reals | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4424619 | 1993-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973331 | 1992-06-26 | Paper |
| A theorem on random polynomials and some consequences in average complexity | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3209245 | 1990-01-01 | Paper |
| Non recursive functions have transcendental generating series | 1989-01-01 | Paper |
| Nash functions over real spectra | 1989-01-01 | Paper |
| Nash functions and the structure sheaf | 1989-01-01 | Paper |
| An Alternate Proof of the Continuity of the Roots of a Polynomial | 1989-01-01 | Paper |
| Sur les anneaux de sections globales du faisceau structural sur le spectre reel | 1988-01-01 | Paper |
| Functions de Nash sur les variétés affines. (Nash functions on affine varieties) | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4726379 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3743407 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818424 | 1986-01-01 | Paper |
