The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Felipe Cucker" ( http://dblp.L3S.de/Authors/Felipe_Cucker )

  Author page on DBLP  Author page in RDF  Community of Felipe Cucker in ASPL-2

Publication years (Num. hits)
1987-1996 (17) 1997-2001 (16) 2002-2005 (22) 2006-2009 (16) 2010-2012 (7)
Publication types (Num. hits)
article(60) inproceedings(18)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 18 occurrences of 17 keywords

Results
Found 78 publication records. Showing 78 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Felipe Cucker The Legacy of Turing in Numerical Analysis. Search on Bibsonomy SOFSEM The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Jiu-Gang Dong A General Collision-Avoiding Flocking Framework. Search on Bibsonomy IEEE Trans. Automat. Contr. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Raphael Hauser, Martin Lotz Adversarial smoothed analysis. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Dennis Cheung, Felipe Cucker, Javier Peña On strata of degenerate polyhedral cones, II: Relations between condition measures. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor A Numerical Algorithm for Zero Counting. III: Randomization and Condition Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker Smoothed Analysis of Moore-Penrose Inversion. Search on Bibsonomy SIAM J. Matrix Analysis Applications The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF approximate zero, polynomial equation solving, complexity, polynomial time, smoothed analysis, homotopy methods
1Peter Bürgisser, Felipe Cucker Exotic Quantifiers, Complexity Classes, and Complete Problems. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 68Q15, 68Q17
1Dennis Cheung, Felipe Cucker, Javier Peña On strata of degenerate polyhedral cones I: Condition and distance to strata. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Paulin Jacobé de Naurois Parallel Time and Quantifier Prefixes. Search on Bibsonomy Computational Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor A Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Dennis Cheung, Felipe Cucker Componentwise Condition Numbers of Random Sparse Matrices. Search on Bibsonomy SIAM J. Matrix Analysis Applications The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dennis Cheung, Felipe Cucker, Javier Peña A Condition Number for Multifold Conic Systems. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor A numerical algorithm for zero counting, I: Complexity and accuracy. Search on Bibsonomy J. Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker, Martin Lotz The probability that a slightly perturbed numerical analysis problem is difficult. Search on Bibsonomy Math. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Irénée Briquel A note on parallel and alternating time. Search on Bibsonomy J. Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Felipe Cucker, Huaian Diao, Yimin Wei On mixed and componentwise condition numbers for Moore-Penrose inverse and linear least squares problems. Search on Bibsonomy Math. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker Exotic Quantifiers, Complexity Classes, and Complete Problems. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Dennis Cheung, Felipe Cucker Solving linear programs with finite precision: II. Algorithms. Search on Bibsonomy J. Complexity The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. Search on Bibsonomy J. Complexity The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion Implicit complexity over an arbitrary structure: Quantifier alternations. Search on Bibsonomy Inf. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois The complexity of semilinear problems in succinct representation. Search on Bibsonomy Computational Complexity The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Subject classification, 68Q15
1Lenore Blum, Felipe Cucker, Tomaso Poggio, James Renegar, Michael Shub Foreword. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker, Martin Lotz Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Complexity classes, Counting problems, Euler characteristic
1Dennis Cheung, Felipe Cucker, Raphael Hauser Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker Exotic quantifiers, complexity classes, and complete problems Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Dennis Cheung, Felipe Cucker A note on level-2 condition numbers. Search on Bibsonomy J. Complexity The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. Search on Bibsonomy J. Log. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Felipe Cucker On sparseness, reducibilities, and complexity. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois The Complexity of Semilinear Problems in Succinct Representation. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Steve Smale, Ding-Xuan Zhou Modeling Language Evolution. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Learning theory, Language evolution
1Dennis Cheung, Felipe Cucker Solving linear programs with finite precision: I. Condition numbers and random programs. Search on Bibsonomy Math. Program. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. Search on Bibsonomy IFIP TCS The full citation details ... 2004 DBLP  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF counting complexity classes, geometric degree, semialgebraic sets, completeness, Betti numbers, Euler characteristic
1Dennis Cheung, Felipe Cucker Learning from rounded-off data. Search on Bibsonomy Inf. Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Dennis Cheung, Felipe Cucker, Javier Peña Unifying Condition Numbers for Linear Programming. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker Counting complexity classes for numeric computations II: algebraic and semialgebraic sets Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker Counting Complexity Classes over the Reals I: The Additive Case. Search on Bibsonomy ISAAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. Search on Bibsonomy FoSSaCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Steve Smale Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Javier Peña A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Felipe Cucker Real Computations with Fake Numbers. Search on Bibsonomy J. Complexity The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Felipe Cucker On sparseness and Turing reducibility over the reals. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Felipe Cucker On weak and weighted computations over the real closure of Q. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Dima Grigoriev There are No Sparse NPw-Hard Sets. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Dima Grigoriev There Are No Sparse NPW-Hard Sets. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Thomas Lickteig Preface. Search on Bibsonomy J. Complexity The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Felipe Cucker Solving polynomial systems: a complexity theory viewpoint. Search on Bibsonomy ISSAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Pascal Koiran, Steve Smale A Polynomial Time Algorithm for Diophantine Equations in One Variable. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Felipe Cucker Approximate Zeros and Condition Numbers. Search on Bibsonomy J. Complexity The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Dima Grigoriev Complexity Lower Bounds for Approximation Algebraic Computation Trees. Search on Bibsonomy J. Complexity The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Klaus Meer Logics Which Capture Complexity Classes Over The Reals. Search on Bibsonomy J. Symb. Log. The full citation details ... 1999 DBLP  BibTeX  RDF
1Felipe Cucker, Steve Smale Complexity Estimates Depending on Condition and Round-Off Error. Search on Bibsonomy J. ACM The full citation details ... 1999 DBLP  DOI  BibTeX  RDF feasibility of polynomial systems, iterative methods, error analysis, conditioning
1Felipe Cucker Real Computations with Fake Numbers. Search on Bibsonomy ICALP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Steve Smale Complexity Estimates Depending on Condition and Round-Off Error. Search on Bibsonomy ESA The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Felipe Cucker Machines Over the Reals and Non Uniformity. Search on Bibsonomy Math. Log. Q. The full citation details ... 1997 DBLP  BibTeX  RDF
1Felipe Cucker, Pascal Koiran, Martín Matamala Complexity and Dimension. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Dima Grigoriev On the Power of Real Turing Machines Over Binary Inputs. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Klaus Meer Logics Which Capture Complexity Classes over the Reals. Search on Bibsonomy FCT The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Mike Shub Generalized Knapsack Problems and Fixed Degree Separations. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Michael Shub EDITOR'S FOREWORD. Search on Bibsonomy J. Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Martín Matamala On Digital Nondeterminism. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1996 DBLP  BibTeX  RDF
1Felipe Cucker, Pascal Koiran Computing over the Reals with Addition and Order: Higher Complexity Classes. Search on Bibsonomy J. Complexity The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther On real Turing machines that toss coins. Search on Bibsonomy STOC The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Mike Shub, Steve Smale Separation of Complexity Classes in Koiran's Weak Model. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Felipe Cucker On the Complexity of Quantifier Elimination: the Structural Approach. Search on Bibsonomy Comput. J. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Francesc Rosselló Recursiveness over the Complex Numbers is Time-Bounded. Search on Bibsonomy FSTTCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Felipe Cucker PR != NCR. Search on Bibsonomy J. Complexity The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, A. Torrecillas Two P-complete problems in the theory of the reals. Search on Bibsonomy J. Complexity The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Felipe Cucker The Arithmetical Hierarchy over the Reals. Search on Bibsonomy J. Log. Comput. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Hervé Lanneau, Bud Mishra, Paul Pedersen, Marie-Françoise Roy NC Algorithms for Real Algebraic Numbers. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Francesc Rosselló On the Complexity of Some Problems for the Blum, Shub & Smale Model. Search on Bibsonomy LATIN The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, A. Torrecillas Two P-Complete Problems in the Theory of the Reals. Search on Bibsonomy ICALP The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Marie-Françoise Roy Kac's Theorem on the Number of Real Roots and its Consequences in Average Complexity. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1990 DBLP  BibTeX  RDF
1Felipe Cucker, Joaquim Gabarró Non Recursive Functions Have Transcendental Generating Series. Search on Bibsonomy ITA The full citation details ... 1989 DBLP  BibTeX  RDF
1Felipe 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. Search on Bibsonomy AAECC The full citation details ... 1987 DBLP  BibTeX  RDF
Displaying result #1 - #78 of 78 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.