On the Computation of the Local and Global Analytic Branches of a Real Algebraic Curve. - Felipe Cucker; Luis Miguel Pardo; Mario Raimondo; Tomás Recio; Marie-Françoise Roy (AAECC, 1987)

Non Recursive Functions Have Transcendental Generating Series. - Felipe Cucker; Joaquim Gabarró (RAIRO Theor. Informatics Appl., 1989)

Nondeterministic Ω-Computations and the Analytical Hierarchy. - Jorge Castro; Felipe Cucker (Math. Log. Q., 1989)

A Theorem on Random Polynomials and Some Consequences in Average Complexity. - Felipe Cucker; Marie-Françoise Roy (J. Symb. Comput., 1990)

Two P-Complete Problems in the Theory of the Reals. - Felipe Cucker; A. Torrecillas (ICALP, 1991)

On the Complexity of Some Problems for the Blum, Shub & Smale Model. - Felipe Cucker; Francesc Rosselló (LATIN, 1992)

NC Algorithms for Real Algebraic Numbers. - Felipe Cucker; Hervé Lanneau; Bud Mishra; Paul Pedersen; Marie-Françoise Roy (Appl. Algebra Eng. Commun. Comput., 1992)

Time Bounded Computations over the Reals. - Felipe Cucker; José L. Montaña; Luis M. Pardo (Int. J. Algebra Comput., 1992)

PR != NCR. - Felipe Cucker (J. Complex., 1992)

Two P-complete problems in the theory of the reals. - Felipe Cucker; A. Torrecillas (J. Complex., 1992)

The Arithmetical Hierarchy over the Reals. - Felipe Cucker (J. Log. Comput., 1992)

Recursiveness over the Complex Numbers is Time-Bounded. - Felipe Cucker; Francesc Rosselló (FSTTCS, 1993)

On the Complexity of Quantifier Elimination: the Structural Approach. - Felipe Cucker (Comput. J., 1993)

Separation of Complexity Classes in Koiran's Weak Model. - Felipe Cucker; Mike Shub; Steve Smale (Theor. Comput. Sci., 1994)

On real Turing machines that toss coins. - Felipe Cucker; Marek Karpinski; Pascal Koiran; Thomas Lickteig; Kai Werther (STOC, 1995)

Computing over the Reals with Addition and Order: Higher Complexity Classes. - Felipe Cucker; Pascal Koiran (J. Complex., 1995)

EDITOR'S FOREWORD. - Felipe Cucker; Michael Shub (J. Complex., 1996)

On Digital Nondeterminism. - Felipe Cucker; Martín Matamala (Math. Syst. Theory, 1996)

Generalized Knapsack Problems and Fixed Degree Separations. - Felipe Cucker; Mike Shub (Theor. Comput. Sci., 1996)

Complexity and Dimension. - Felipe Cucker; Pascal Koiran; Martín Matamala (Inf. Process. Lett., 1997)

Machines Over the Reals and Non Uniformity. - Felipe Cucker (Math. Log. Q., 1997)

On the Power of Real Turing Machines Over Binary Inputs. - Felipe Cucker; Dima Grigoriev (SIAM J. Comput., 1997)

Complexity Estimates Depending on Condition and Round-Off Error. - Felipe Cucker; Steve Smale (J. ACM, 1999)

Approximate Zeros and Condition Numbers. - Felipe Cucker (J. Complex., 1999)

Complexity Lower Bounds for Approximation Algebraic Computation Trees. - Felipe Cucker; Dima Grigoriev (J. Complex., 1999)

A Polynomial Time Algorithm for Diophantine Equations in One Variable. - Felipe Cucker; Pascal Koiran; Steve Smale (J. Symb. Comput., 1999)

Logics Which Capture Complexity Classes Over The Reals. - Felipe Cucker; Klaus Meer (J. Symb. Log., 1999)

Solving polynomial systems: a complexity theory viewpoint. - Felipe Cucker (ISSAC, 2000)

Preface. - Felipe Cucker; Thomas Lickteig (J. Complex., 2000)

A new condition number for linear programming. - Dennis Cheung; Felipe Cucker (Math. Program., 2001)

There are No Sparse NPw-Hard Sets. - Felipe Cucker; Dima Grigoriev (SIAM J. Comput., 2001)

On weak and weighted computations over the real closure of Q. - Felipe Cucker (Theor. Comput. Sci., 2001)

On sparseness and Turing reducibility over the reals. - Felipe Cucker (WoLLIC, 2002)

Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem. - Felipe Cucker; Steve Smale (Found. Comput. Math., 2002)

Real Computations with Fake Numbers. - Felipe Cucker (J. Complex., 2002)

A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine. - Felipe Cucker; Javier Peña 001 (SIAM J. Optim., 2002)

Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. - Olivier Bournez; Felipe Cucker; Paulin Jacobé de Naurois; Jean-Yves Marion (FoSSaCS, 2003)

Counting Complexity Classes over the Reals I: The Additive Case. - Peter Bürgisser; Felipe Cucker (ISAAC, 2003)

Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. - Olivier Bournez; Felipe Cucker; Paulin Jacobé de Naurois; Jean-Yves Marion (ICC@LICS, 2003)

Learning from rounded-off data. - Dennis Cheung; Felipe Cucker (Inf. Comput., 2003)

Unifying Condition Numbers for Linear Programming. - Dennis Cheung; Felipe Cucker; Javier Peña 001 (Math. Oper. Res., 2003)

On the Expected Condition Number of Linear Programming Problems. - Felipe Cucker; Mario Wschebor (Numerische Mathematik, 2003)

Counting Complexity Classes for Numeric Computations I: Semilinear Sets. - Peter Bürgisser; Felipe Cucker (SIAM J. Comput., 2003)

Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. - Olivier Bournez; Felipe Cucker; Paulin Jacobé de Naurois; Jean-Yves Marion (IFIP TCS, 2004)

Modeling Language Evolution. - Felipe Cucker; Steve Smale; Ding-Xuan Zhou (Found. Comput. Math., 2004)

Solving linear programs with finite precision: I. Condition numbers and random programs. - Dennis Cheung; Felipe Cucker (Math. Program., 2004)

On sparseness, reducibilities, and complexity. - Felipe Cucker (Ann. Pure Appl. Log., 2005)

Foreword. - Lenore Blum; Felipe Cucker; Tomaso A. Poggio; James Renegar; Michael Shub (Found. Comput. Math., 2005)

Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. - Peter Bürgisser; Felipe Cucker; Martin Lotz (Found. Comput. Math., 2005)

A note on level-2 condition numbers. - Dennis Cheung; Felipe Cucker (J. Complex., 2005)

Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. - Olivier Bournez; Felipe Cucker; Paulin Jacobé de Naurois; Jean-Yves Marion (J. Log. Comput., 2005)

Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems. - Dennis Cheung; Felipe Cucker; Raphael A. Hauser (SIAM J. Optim., 2005)

The complexity of semilinear problems in succinct representation. - Peter Bürgisser; Felipe Cucker; Paulin Jacobé de Naurois (Comput. Complex., 2006)

Implicit complexity over an arbitrary structure: Quantifier alternations. - Olivier Bournez; Felipe Cucker; Paulin Jacobé de Naurois; Jean-Yves Marion (Inf. Comput., 2006)

Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. - Peter Bürgisser; Felipe Cucker (J. Complex., 2006)

Solving linear programs with finite precision: II. Algorithms. - Dennis Cheung; Felipe Cucker (J. Complex., 2006)

Smoothed analysis of some condition numbers. - Felipe Cucker; Huaian Diao; Yimin Wei 001 (Numer. Linear Algebra Appl., 2006)

A note on parallel and alternating time. - Felipe Cucker; Irénée Briquel (J. Complex., 2007)

On mixed and componentwise condition numbers for Moore-Penrose inverse and linear least squares problems. - Felipe Cucker; Huaian Diao; Yimin Wei 001 (Math. Comput., 2007)

Emergent Behavior in Flocks. - Felipe Cucker; Steve Smale (IEEE Trans. Autom. Control., 2007)

A numerical algorithm for zero counting, I: Complexity and accuracy. - Felipe Cucker; Teresa Krick; Gregorio Malajovich; Mario Wschebor (J. Complex., 2008)

The probability that a slightly perturbed numerical analysis problem is difficult. - Peter Bürgisser; Felipe Cucker; Martin Lotz (Math. Comput., 2008)

A Condition Number for Multifold Conic Systems. - Dennis Cheung; Felipe Cucker; Javier Peña 001 (SIAM J. Optim., 2008)

Parallel Time and Quantifier Prefixes. - Felipe Cucker; Paulin Jacobé de Naurois (Comput. Complex., 2009)

A Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis - Felipe Cucker; Teresa Krick; Gregorio Malajovich; Mario Wschebor (CoRR, 2009)

On strata of degenerate polyhedral cones I: Condition and distance to strata. - Dennis Cheung; Felipe Cucker; Javier Peña 001 (Eur. J. Oper. Res., 2009)

Exotic Quantifiers, Complexity Classes, and Complete Problems. - Peter Bürgisser; Felipe Cucker (Found. Comput. Math., 2009)

Componentwise Condition Numbers of Random Sparse Matrices. - Dennis Cheung; Felipe Cucker (SIAM J. Matrix Anal. Appl., 2009)

Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. - Peter Bürgisser; Felipe Cucker (STOC, 2010)

On strata of degenerate polyhedral cones, II: Relations between condition measures. - Dennis Cheung; Felipe Cucker; Javier Peña 001 (J. Complex., 2010)

Adversarial smoothed analysis. - Felipe Cucker; Raphael A. Hauser; Martin Lotz (J. Complex., 2010)

Smoothed Analysis of Moore-Penrose Inversion. - Peter Bürgisser; Felipe Cucker (SIAM J. Matrix Anal. Appl., 2010)

Avoiding Collisions in Flocks. - Felipe Cucker; Jiu-Gang Dong (IEEE Trans. Autom. Control., 2010)

A General Collision-Avoiding Flocking Framework. - Felipe Cucker; Jiu-Gang Dong (IEEE Trans. Autom. Control., 2011)

The Legacy of Turing in Numerical Analysis. - Felipe Cucker (SOFSEM, 2012)

A numerical algorithm for zero counting. III: Randomization and condition. - Felipe Cucker; Teresa Krick; Gregorio Malajovich; Mario Wschebor (Adv. Appl. Math., 2012)

Condition - The Geometry of Numerical Algorithms. - Peter Bürgisser; Felipe Cucker (Springer, 2013)

On the Average Condition of Random Linear Programs. - Dennis Cheung; Felipe Cucker (SIAM J. Optim., 2013)

A Theory of Complexity, Condition and Roundoff. - Felipe Cucker (CoRR, 2014)

Fast computation of zeros of polynomial systems with bounded degree under finite-precision. - Irénée Briquel; Felipe Cucker; Javier Peña 001; Vera Roshchina (Math. Comput., 2014)

Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242). - Peter Bürgisser; Felipe Cucker; Marek Karpinski; Nicolai N. Vorobjov Jr. (Dagstuhl Reports, 2015)

A Randomized Homotopy for the Hermitian Eigenpair Problem. - Diego Armentano; Felipe Cucker (Found. Comput. Math., 2015)

Solving second-order conic systems with variable precision. - Felipe Cucker; Javier Peña 001; Vera Roshchina (Math. Program., 2015)

Probabilistic analyses of condition numbers. - Felipe Cucker (Acta Numer., 2016)

Condition Length and Complexity for the Solution of Polynomial Systems. - Diego Armentano; Carlos Beltrán 001; Peter Bürgisser; Felipe Cucker; Michael Shub (Found. Comput. Math., 2016)

On the condition of the zeros of characteristic polynomials. - Peter Bürgisser; Felipe Cucker; Elisa Rocha Cardozo (J. Complex., 2017)

Computing the Homology of Real Projective Sets. - Felipe Cucker; Teresa Krick; Michael Shub (Found. Comput. Math., 2018)

Recent Advances in the Computation of the Homology of Semialgebraic Sets. - Felipe Cucker (CiE, 2019)

Plantinga-Vegter Algorithm takes Average Polynomial Time. - Felipe Cucker; Alperen Ali Ergür; Josué Tonelli-Cueto (ISSAC, 2019)

Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time. - Peter Bürgisser; Felipe Cucker; Pierre Lairez (J. ACM, 2019)

On Flocks Under Switching Directed Interaction Topologies. - Felipe Cucker; Jiu-Gang Dong (SIAM J. Appl. Math., 2019)

Rigid continuation paths II. Structured polynomial systems. - Peter Bürgisser; Felipe Cucker; Pierre Lairez (CoRR, 2020)

Computing the Homology of Semialgebraic Sets. I: Lax Formulas. - Peter Bürgisser; Felipe Cucker; Josué Tonelli-Cueto (Found. Comput. Math., 2020)

On local analysis. - Felipe Cucker; Teresa Krick (J. Complex., 2020)

Functional norms, condition numbers and numerical algorithms in algebraic geometry. - Felipe Cucker; Alperen Ali Ergür; Josué Tonelli-Cueto (CoRR, 2021)

Computing the Homology of Semialgebraic Sets. II: General Formulas. - Peter Bürgisser; Felipe Cucker; Josué Tonelli-Cueto (Found. Comput. Math., 2021)

On the Complexity of the Plantinga-Vegter Algorithm. - Felipe Cucker; Alperen Ali Ergür; Josué Tonelli-Cueto (Discret. Comput. Geom., 2022)

When can you trust feature selection? - I: A condition-based analysis of LASSO and generalised hardness of approximation. - Alexander Bastounis; Felipe Cucker; Anders C. Hansen (CoRR, 2023)