| 2019 | CiE | Recent Advances in the Computation of the Homology of Semialgebraic Sets. | Felipe Cucker |
| 2019 | ISSAC | Plantinga-Vegter Algorithm takes Average Polynomial Time. | Felipe Cucker, Alperen Ali Ergr, Josu Tonelli-Cueto |
| 2012 | SOFSEM | The Legacy of Turing in Numerical Analysis. | Felipe Cucker |
| 2010 | STOC | Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. | Peter Brgisser, Felipe Cucker |
| 2007 | ICALP | Exotic Quantifiers, Complexity Classes, and Complete Problems. | Peter Brgisser, Felipe Cucker |
| 2005 | FCT | The Complexity of Semilinear Problems in Succinct Representation. | Peter Brgisser, Felipe Cucker, Paulin Jacob de Naurois |
| 2004 | STOC | Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. | Peter Brgisser, Felipe Cucker |
| 2003 | FOSSACS | Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. | Olivier Bournez, Felipe Cucker, Paulin Jacob de Naurois, Jean-Yves Marion |
| 2003 | ISAAC | Counting Complexity Classes over the Reals I: The Additive Case. | Peter Brgisser, Felipe Cucker |
| 2001 | MFCS | There Are No Sparse NP | Felipe Cucker, Dima Grigoriev |
| 2000 | ISSAC | Solving polynomial systems: a complexity theory viewpoint. | Felipe Cucker |
| 1999 | ICALP | Real Computations with Fake Numbers. | Felipe Cucker |
| 1998 | ESA | Complexity Estimates Depending on Condition and Round-Off Error. | Felipe Cucker, Steve Smale |
| 1997 | FCT | Logics Which Capture Complexity Classes over the Reals. | Felipe Cucker, Klaus Meer |
| 1995 | STOC | On real Turing machines that toss coins. | Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther |
| 1992 | LATIN | On the Complexity of Some Problems for the Blum, Shub & Smale Model. | Felipe Cucker, Francesc Rossell |
| 1991 | ICALP | Two P-Complete Problems in the Theory of the Reals. | Felipe Cucker, A. Torrecillas |