The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Felipe Cucker: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Felipe Cucker, Luis Miguel Pardo, Mario Raimondo, Tomás Recio, Marie-Françoise Roy
    On the Computation of the Local and Global Analytic Branches of a Real Algebraic Curve. [Citation Graph (0, 0)][DBLP]
    AAECC, 1987, pp:161-181 [Conf]
  2. Felipe Cucker, Steve Smale
    Complexity Estimates Depending on Condition and Round-Off Error. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:115-126 [Conf]
  3. Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
    The Complexity of Semilinear Problems in Succinct Representation. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:479-490 [Conf]
  4. Felipe Cucker, Klaus Meer
    Logics Which Capture Complexity Classes over the Reals. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:157-167 [Conf]
  5. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
    Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:185-199 [Conf]
  6. Felipe Cucker, Francesc Rosselló
    Recursiveness over the Complex Numbers is Time-Bounded. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:260-267 [Conf]
  7. Felipe Cucker
    Real Computations with Fake Numbers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:55-73 [Conf]
  8. Felipe Cucker, A. Torrecillas
    Two P-Complete Problems in the Theory of the Reals. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:556-565 [Conf]
  9. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
    Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:409-422 [Conf]
  10. Peter Bürgisser, Felipe Cucker
    Counting Complexity Classes over the Reals I: The Additive Case. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:625-634 [Conf]
  11. Felipe Cucker
    Solving polynomial systems: a complexity theory viewpoint. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2000, pp:- [Conf]
  12. Felipe Cucker, Francesc Rosselló
    On the Complexity of Some Problems for the Blum, Shub & Smale Model. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:117-129 [Conf]
  13. Felipe Cucker, Dima Grigoriev
    There Are No Sparse NPW-Hard Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:285-291 [Conf]
  14. Peter Bürgisser, Felipe Cucker
    Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:475-485 [Conf]
  15. Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther
    On real Turing machines that toss coins. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:335-342 [Conf]
  16. Felipe Cucker, Hervé Lanneau, Bud Mishra, Paul Pedersen, Marie-Françoise Roy
    NC Algorithms for Real Algebraic Numbers. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1992, v:3, n:, pp:79-98 [Journal]
  17. Felipe Cucker
    On sparseness, reducibilities, and complexity. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:134, n:1, pp:53-61 [Journal]
  18. Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
    The complexity of semilinear problems in succinct representation. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:3, pp:197-235 [Journal]
  19. Felipe Cucker
    On the Complexity of Quantifier Elimination: the Structural Approach. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1993, v:36, n:5, pp:400-408 [Journal]
  20. Peter Bürgisser, Felipe Cucker
    Counting complexity classes for numeric computations II: algebraic and semialgebraic sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  21. Peter Bürgisser, Felipe Cucker
    Exotic quantifiers, complexity classes, and complete problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:138, pp:- [Journal]
  22. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
    Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:90, n:1, pp:- [Journal]
  23. Felipe Cucker
    On sparseness and Turing reducibility over the reals. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:67, n:, pp:- [Journal]
  24. Lenore Blum, Felipe Cucker, Tomaso Poggio, James Renegar, Michael Shub
    Foreword. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2005, v:5, n:4, pp:349- [Journal]
  25. Felipe Cucker, Steve Smale
    Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2002, v:2, n:4, pp:413-428 [Journal]
  26. Felipe Cucker, Steve Smale, Ding-Xuan Zhou
    Modeling Language Evolution. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2004, v:4, n:3, pp:315-343 [Journal]
  27. Peter Bürgisser, Felipe Cucker, Martin Lotz
    Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2005, v:5, n:4, pp:351-387 [Journal]
  28. Dennis Cheung, Felipe Cucker
    Learning from rounded-off data. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:182, n:1, pp:1-13 [Journal]
  29. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
    Implicit complexity over an arbitrary structure: Quantifier alternations. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:2, pp:210-230 [Journal]
  30. Felipe Cucker, Pascal Koiran, Martín Matamala
    Complexity and Dimension. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:4, pp:209-212 [Journal]
  31. Felipe Cucker, Joaquim Gabarró
    Non Recursive Functions Have Transcendental Generating Series. [Citation Graph (0, 0)][DBLP]
    ITA, 1989, v:23, n:4, pp:445-448 [Journal]
  32. Felipe Cucker, Steve Smale
    Complexity Estimates Depending on Condition and Round-Off Error. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:1, pp:113-184 [Journal]
  33. Dennis Cheung, Felipe Cucker
    A note on level-2 condition numbers. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:3, pp:314-319 [Journal]
  34. Dennis Cheung, Felipe Cucker
    Solving linear programs with finite precision: II. Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2006, v:22, n:3, pp:305-335 [Journal]
  35. Peter Bürgisser, Felipe Cucker
    Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2006, v:22, n:2, pp:147-191 [Journal]
  36. Felipe Cucker
    Real Computations with Fake Numbers. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:104-134 [Journal]
  37. Felipe Cucker
    PR != NCR. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1992, v:8, n:3, pp:230-238 [Journal]
  38. Felipe Cucker
    Approximate Zeros and Condition Numbers. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1999, v:15, n:2, pp:214-226 [Journal]
  39. Felipe Cucker, Dima Grigoriev
    Complexity Lower Bounds for Approximation Algebraic Computation Trees. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1999, v:15, n:4, pp:499-512 [Journal]
  40. Felipe Cucker, Pascal Koiran
    Computing over the Reals with Addition and Order: Higher Complexity Classes. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1995, v:11, n:3, pp:358-376 [Journal]
  41. Felipe Cucker, Thomas Lickteig
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:1, pp:1- [Journal]
  42. Felipe Cucker, Michael Shub
    EDITOR'S FOREWORD. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1996, v:12, n:4, pp:255-256 [Journal]
  43. Felipe Cucker, A. Torrecillas
    Two P-complete problems in the theory of the reals. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1992, v:8, n:4, pp:454-466 [Journal]
  44. Felipe Cucker, Pascal Koiran, Steve Smale
    A Polynomial Time Algorithm for Diophantine Equations in One Variable. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1999, v:27, n:1, pp:21-29 [Journal]
  45. Felipe Cucker, Marie-Françoise Roy
    Kac's Theorem on the Number of Real Roots and its Consequences in Average Complexity. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:5, pp:405-410 [Journal]
  46. Felipe Cucker, Klaus Meer
    Logics Which Capture Complexity Classes Over The Reals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:1, pp:363-390 [Journal]
  47. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
    Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2005, v:15, n:1, pp:41-58 [Journal]
  48. Felipe Cucker
    The Arithmetical Hierarchy over the Reals. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1992, v:2, n:3, pp:375-395 [Journal]
  49. Felipe Cucker
    Machines Over the Reals and Non Uniformity. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1997, v:43, n:, pp:143-157 [Journal]
  50. Dennis Cheung, Felipe Cucker, Javier Peña
    Unifying Condition Numbers for Linear Programming. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2003, v:28, n:4, pp:609-624 [Journal]
  51. Dennis Cheung, Felipe Cucker
    Solving linear programs with finite precision: I. Condition numbers and random programs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2004, v:99, n:1, pp:175-196 [Journal]
  52. Felipe Cucker, Martín Matamala
    On Digital Nondeterminism. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:6, pp:635-647 [Journal]
  53. Felipe Cucker, Dima Grigoriev
    There are No Sparse NPw-Hard Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:193-198 [Journal]
  54. Felipe Cucker, Dima Grigoriev
    On the Power of Real Turing Machines Over Binary Inputs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:243-254 [Journal]
  55. Felipe Cucker, Mike Shub
    Generalized Knapsack Problems and Fixed Degree Separations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:301-306 [Journal]
  56. Felipe Cucker
    On weak and weighted computations over the real closure of Q. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:593-600 [Journal]
  57. Felipe Cucker, Mike Shub, Steve Smale
    Separation of Complexity Classes in Koiran's Weak Model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:3-14 [Journal]
  58. Peter Bürgisser, Felipe Cucker
    Exotic Quantifiers, Complexity Classes, and Complete Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:207-218 [Conf]
  59. Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor
    A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  60. Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. [Citation Graph (, )][DBLP]


  61. Parallel Time and Quantifier Prefixes. [Citation Graph (, )][DBLP]


  62. A Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis [Citation Graph (, )][DBLP]


  63. A Numerical Algorithm for Zero Counting. III: Randomization and Condition [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002