Felipe Cucker

ORCID

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 23

Top Venues

CoRR

Found. Comput. Math.

J. Complex.

Discret. Comput. Geom.

Publications

Alexander Bastounis, Felipe Cucker, Anders C. Hansen
When can you trust feature selection? - I: A condition-based analysis of LASSO and generalised hardness of approximation. CoRR (2023)
Felipe Cucker, Alperen Ali Ergür, Josué Tonelli-Cueto
On the Complexity of the Plantinga-Vegter Algorithm. Discret. Comput. Geom. 68 (3) (2022)
Felipe Cucker, Alperen Ali Ergür, Josué Tonelli-Cueto
Functional norms, condition numbers and numerical algorithms in algebraic geometry. CoRR (2021)
Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto
Computing the Homology of Semialgebraic Sets. II: General Formulas. Found. Comput. Math. 21 (5) (2021)
Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto
Computing the Homology of Semialgebraic Sets. I: Lax Formulas. Found. Comput. Math. 20 (1) (2020)
Peter Bürgisser, Felipe Cucker, Pierre Lairez
Rigid continuation paths II. Structured polynomial systems. CoRR (2020)
Felipe Cucker, Teresa Krick
On local analysis. J. Complex. 57 (2020)
Felipe Cucker, Alperen Ali Ergür, Josué Tonelli-Cueto
On the Complexity of the Plantinga-Vegter Algorithm. CoRR (2020)
Felipe Cucker
Recent Advances in the Computation of the Homology of Semialgebraic Sets. CiE (2019)
Peter Bürgisser, Felipe Cucker, Pierre Lairez
Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time. J. ACM 66 (1) (2019)
Felipe Cucker, Jiu-Gang Dong
On Flocks Under Switching Directed Interaction Topologies. SIAM J. Appl. Math. 79 (1) (2019)
Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto
Computing the Homology of Semialgebraic Sets. II: General formulas. CoRR (2019)
Felipe Cucker, Alperen Ali Ergür, Josué Tonelli-Cueto
Plantinga-Vegter algorithm takes average polynomial time. CoRR (2019)
Felipe Cucker, Alperen Ali Ergür, Josué Tonelli-Cueto
Plantinga-Vegter Algorithm takes Average Polynomial Time. ISSAC (2019)
Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto
Computing the Homology of Semialgebraic Sets I: Lax Formulas. CoRR (2018)
Felipe Cucker, Teresa Krick, Michael Shub
Computing the Homology of Real Projective Sets. Found. Comput. Math. 18 (4) (2018)
Felipe Cucker, Peter Bürgisser, Pierre Lairez
Computing the homology of basic semialgebraic sets in weak exponential time. CoRR (2017)
Peter Bürgisser, Felipe Cucker, Elisa Rocha Cardozo
On the condition of the zeros of characteristic polynomials. J. Complex. 42 (2017)
Felipe Cucker
Probabilistic analyses of condition numbers. Acta Numer. 25 (2016)
Diego Armentano, Carlos Beltrán, Peter Bürgisser, Felipe Cucker, Michael Shub
Condition Length and Complexity for the Solution of Polynomial Systems. Found. Comput. Math. 16 (6) (2016)
Felipe Cucker, Javier Peña, Vera Roshchina
Solving second-order conic systems with variable precision. Math. Program. 150 (2) (2015)
Diego Armentano, Felipe Cucker
A Randomized Homotopy for the Hermitian Eigenpair Problem. Found. Comput. Math. 15 (1) (2015)
Peter Bürgisser, Felipe Cucker, Marek Karpinski, Nicolai N. Vorobjov Jr.
Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242). Dagstuhl Reports 5 (6) (2015)
Felipe Cucker
A Theory of Complexity, Condition and Roundoff. CoRR (2014)
Irénée Briquel, Felipe Cucker, Javier Peña, Vera Roshchina
Fast computation of zeros of polynomial systems with bounded degree under finite-precision. Math. Comput. 83 (287) (2014)
Dennis Cheung, Felipe Cucker
On the Average Condition of Random Linear Programs. SIAM J. Optim. 23 (2) (2013)
Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor
A numerical algorithm for zero counting. III: Randomization and condition. Adv. Appl. Math. 48 (1) (2012)
Felipe Cucker
The Legacy of Turing in Numerical Analysis. SOFSEM (2012)
Felipe Cucker, Jiu-Gang Dong
A General Collision-Avoiding Flocking Framework. IEEE Trans. Autom. Control. 56 (5) (2011)
Peter Bürgisser, Felipe Cucker
Smoothed Analysis of Moore-Penrose Inversion. SIAM J. Matrix Anal. Appl. 31 (5) (2010)
Peter Bürgisser, Felipe Cucker
Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. STOC (2010)
Felipe Cucker, Jiu-Gang Dong
Avoiding Collisions in Flocks. IEEE Trans. Autom. Control. 55 (5) (2010)
Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor
A Numerical Algorithm for Zero Counting. III: Randomization and Condition CoRR (2010)
Dennis Cheung, Felipe Cucker, Javier Peña
On strata of degenerate polyhedral cones, II: Relations between condition measures. J. Complex. 26 (2) (2010)
Felipe Cucker, Raphael A. Hauser, Martin Lotz
Adversarial smoothed analysis. J. Complex. 26 (3) (2010)
Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor
A Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis CoRR (2009)
Dennis Cheung, Felipe Cucker, Javier Peña
On strata of degenerate polyhedral cones I: Condition and distance to strata. Eur. J. Oper. Res. 198 (1) (2009)
Felipe Cucker, Paulin Jacobé de Naurois
Parallel Time and Quantifier Prefixes. Comput. Complex. 18 (4) (2009)
Dennis Cheung, Felipe Cucker
Componentwise Condition Numbers of Random Sparse Matrices. SIAM J. Matrix Anal. Appl. 31 (2) (2009)
Peter Bürgisser, Felipe Cucker
Exotic Quantifiers, Complexity Classes, and Complete Problems. Found. Comput. Math. 9 (2) (2009)
Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor
A numerical algorithm for zero counting, I: Complexity and accuracy. J. Complex. 24 (5-6) (2008)
Dennis Cheung, Felipe Cucker, Javier Peña
A Condition Number for Multifold Conic Systems. SIAM J. Optim. 19 (1) (2008)
Peter Bürgisser, Felipe Cucker, Martin Lotz
The probability that a slightly perturbed numerical analysis problem is difficult. Math. Comput. 77 (263) (2008)
Felipe Cucker, Huaian Diao, Yimin Wei
On mixed and componentwise condition numbers for Moore-Penrose inverse and linear least squares problems. Math. Comput. 76 (258) (2007)
Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor
A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy CoRR (2007)
Felipe Cucker, Steve Smale
Emergent Behavior in Flocks. IEEE Trans. Autom. Control. 52 (5) (2007)
Felipe Cucker, Irénée Briquel
A note on parallel and alternating time. J. Complex. 23 (4-6) (2007)
Peter Bürgisser, Felipe Cucker
Exotic Quantifiers, Complexity Classes, and Complete Problems. ICALP (2007)
Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
The complexity of semilinear problems in succinct representation. Comput. Complex. 15 (3) (2006)
Felipe Cucker, Huaian Diao, Yimin Wei
Smoothed analysis of some condition numbers. Numer. Linear Algebra Appl. 13 (1) (2006)
Dennis Cheung, Felipe Cucker
Solving linear programs with finite precision: II. Algorithms. J. Complex. 22 (3) (2006)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Implicit complexity over an arbitrary structure: Quantifier alternations. Inf. Comput. 204 (2) (2006)
Peter Bürgisser, Felipe Cucker
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. J. Complex. 22 (2) (2006)
Dennis Cheung, Felipe Cucker
A note on level-2 condition numbers. J. Complex. 21 (3) (2005)
Peter Bürgisser, Felipe Cucker
Exotic quantifiers, complexity classes, and complete problems Electron. Colloquium Comput. Complex. (138) (2005)
Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
The Complexity of Semilinear Problems in Succinct Representation. FCT (2005)
Lenore Blum, Felipe Cucker, Tomaso A. Poggio, James Renegar, Michael Shub
Foreword. Found. Comput. Math. 5 (4) (2005)
Dennis Cheung, Felipe Cucker, Raphael A. Hauser
Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems. SIAM J. Optim. 15 (4) (2005)
Felipe Cucker
On sparseness, reducibilities, and complexity. Ann. Pure Appl. Log. 134 (1) (2005)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. J. Log. Comput. 15 (1) (2005)
Peter Bürgisser, Felipe Cucker, Martin Lotz
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. Found. Comput. Math. 5 (4) (2005)
Peter Bürgisser, Felipe Cucker
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. STOC (2004)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. IFIP TCS (2004)
Felipe Cucker, Steve Smale, Ding-Xuan Zhou
Modeling Language Evolution. Found. Comput. Math. 4 (3) (2004)
Dennis Cheung, Felipe Cucker
Solving linear programs with finite precision: I. Condition numbers and random programs. Math. Program. 99 (1) (2004)
Dennis Cheung, Felipe Cucker, Javier Peña
Unifying Condition Numbers for Linear Programming. Math. Oper. Res. 28 (4) (2003)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. Electron. Notes Theor. Comput. Sci. 90 (2003)
Felipe Cucker, Mario Wschebor
On the Expected Condition Number of Linear Programming Problems. Numerische Mathematik 94 (3) (2003)
Dennis Cheung, Felipe Cucker
Learning from rounded-off data. Inf. Comput. 182 (1) (2003)
Peter Bürgisser, Felipe Cucker
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets CoRR (2003)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. FoSSaCS (2003)
Peter Bürgisser, Felipe Cucker
Counting Complexity Classes for Numeric Computations I: Semilinear Sets. SIAM J. Comput. 33 (1) (2003)
Peter Bürgisser, Felipe Cucker
Counting Complexity Classes over the Reals I: The Additive Case. ISAAC (2003)
Felipe Cucker, Steve Smale
Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem. Found. Comput. Math. 2 (4) (2002)
Felipe Cucker
On sparseness and Turing reducibility over the reals. Electron. Notes Theor. Comput. Sci. 67 (2002)
Felipe Cucker, Javier Peña
A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine. SIAM J. Optim. 12 (2) (2002)
Felipe Cucker
Real Computations with Fake Numbers. J. Complex. 18 (1) (2002)
Felipe Cucker, Dima Grigoriev
-Hard Sets. SIAM J. Comput. 31 (1) (2001)
Felipe Cucker, Dima Grigoriev
-Hard Sets. MFCS (2001)
Dennis Cheung, Felipe Cucker
A new condition number for linear programming. Math. Program. 91 (1) (2001)
Felipe Cucker
On weak and weighted computations over the real closure of Q. Theor. Comput. Sci. 255 (1-2) (2001)
Felipe Cucker
Solving polynomial systems: a complexity theory viewpoint. ISSAC (2000)
Felipe Cucker, Thomas Lickteig
Preface. J. Complex. 16 (1) (2000)
Felipe Cucker, Steve Smale
Complexity Estimates Depending on Condition and Round-Off Error. J. ACM 46 (1) (1999)
Felipe Cucker
Approximate Zeros and Condition Numbers. J. Complex. 15 (2) (1999)
Felipe Cucker, Dima Grigoriev
Complexity Lower Bounds for Approximation Algebraic Computation Trees. J. Complex. 15 (4) (1999)
Felipe Cucker, Pascal Koiran, Steve Smale
A Polynomial Time Algorithm for Diophantine Equations in One Variable. J. Symb. Comput. 27 (1) (1999)
Felipe Cucker, Klaus Meer
Logics Which Capture Complexity Classes Over The Reals. J. Symb. Log. 64 (1) (1999)
Felipe Cucker
Real Computations with Fake Numbers. ICALP (1999)
Felipe Cucker, Steve Smale
Complexity Estimates Depending on Condition and Round-Off Error. ESA (1998)
Felipe Cucker, Dima Grigoriev
On the Power of Real Turing Machines Over Binary Inputs. SIAM J. Comput. 26 (1) (1997)
Felipe Cucker, Klaus Meer
Logics Which Capture Complexity Classes over the Reals. FCT (1997)
Felipe Cucker
Machines Over the Reals and Non Uniformity. Math. Log. Q. 43 (1997)
Felipe Cucker, Pascal Koiran, Martín Matamala
Complexity and Dimension. Inf. Process. Lett. 62 (4) (1997)
Felipe Cucker, Mike Shub
Generalized Knapsack Problems and Fixed Degree Separations. Theor. Comput. Sci. 161 (1&2) (1996)
Felipe Cucker, Martín Matamala
On Digital Nondeterminism. Math. Syst. Theory 29 (6) (1996)
Felipe Cucker, Michael Shub
EDITOR'S FOREWORD. J. Complex. 12 (4) (1996)
Felipe Cucker, Pascal Koiran
Computing over the Reals with Addition and Order: Higher Complexity Classes. J. Complex. 11 (3) (1995)
Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther
On real Turing machines that toss coins. STOC (1995)
Felipe Cucker, Mike Shub, Steve Smale
Separation of Complexity Classes in Koiran's Weak Model. Theor. Comput. Sci. 133 (1) (1994)

Felipe Cucker.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Felipe Cucker