DBLP: Felipe Cucker

	2012
c18		Felipe Cucker: The Legacy of Turing in Numerical Analysis. SOFSEM 2012: 1-13
	2011
j57		Felipe Cucker, Jiu-Gang Dong: A General Collision-Avoiding Flocking Framework. IEEE Trans. Automat. Contr. 56(5): 1124-1129 (2011)
	2010
j56		Dennis Cheung, Felipe Cucker, Javier Peña: On strata of degenerate polyhedral cones, II: Relations between condition measures. J. Complexity 26(2): 209-226 (2010)
j55		Felipe Cucker, Raphael Hauser, Martin Lotz: Adversarial smoothed analysis. J. Complexity 26(3): 255-262 (2010)
j54		Peter Bürgisser, Felipe Cucker: Smoothed Analysis of Moore-Penrose Inversion. SIAM J. Matrix Analysis Applications 31(5): 2769-2783 (2010)
j53		Felipe Cucker, Jiu-Gang Dong: Avoiding Collisions in Flocks. IEEE Trans. Automat. Contr. 55(5): 1238-1243 (2010)
c17		Peter Bürgisser, Felipe Cucker: Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. STOC 2010: 503-512
i5		Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor: A Numerical Algorithm for Zero Counting. III: Randomization and Condition. CoRR abs/1007.1597 (2010)
	2009
j52		Felipe Cucker, Paulin Jacobé de Naurois: Parallel Time and Quantifier Prefixes. Computational Complexity 18(4): 527-550 (2009)
j51		Dennis Cheung, Felipe Cucker, Javier Peña: On strata of degenerate polyhedral cones I: Condition and distance to strata. European Journal of Operational Research 198(1): 23-28 (2009)
j50		Peter Bürgisser, Felipe Cucker: Exotic Quantifiers, Complexity Classes, and Complete Problems. Foundations of Computational Mathematics 9(2): 135-170 (2009)
j49		Dennis Cheung, Felipe Cucker: Componentwise Condition Numbers of Random Sparse Matrices. SIAM J. Matrix Analysis Applications 31(2): 721-731 (2009)
i4		Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor: A Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis. CoRR abs/0909.4101 (2009)
	2008
j48		Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor: A numerical algorithm for zero counting, I: Complexity and accuracy. J. Complexity 24(5-6): 582-605 (2008)
j47		Peter Bürgisser, Felipe Cucker, Martin Lotz: The probability that a slightly perturbed numerical analysis problem is difficult. Math. Comput. 77(263): 1559-1583 (2008)
j46		Dennis Cheung, Felipe Cucker, Javier Peña: A Condition Number for Multifold Conic Systems. SIAM Journal on Optimization 19(1): 261-280 (2008)
	2007
j45		Felipe Cucker, Irénée Briquel: A note on parallel and alternating time. J. Complexity 23(4-6): 594-602 (2007)
j44		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): 947-963 (2007)
j43		Felipe Cucker, Steve Smale: Emergent Behavior in Flocks. IEEE Trans. Automat. Contr. 52(5): 852-862 (2007)
c16		Peter Bürgisser, Felipe Cucker: Exotic Quantifiers, Complexity Classes, and Complete Problems. ICALP 2007: 207-218
i3		Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor: A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy. CoRR abs/0710.4508 (2007)
	2006
j42		Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois: The complexity of semilinear problems in succinct representation. Computational Complexity 15(3): 197-235 (2006)
j41		Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Implicit complexity over an arbitrary structure: Quantifier alternations. Inf. Comput. 204(2): 210-230 (2006)
j40		Peter Bürgisser, Felipe Cucker: Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. J. Complexity 22(2): 147-191 (2006)
j39		Dennis Cheung, Felipe Cucker: Solving linear programs with finite precision: II. Algorithms. J. Complexity 22(3): 305-335 (2006)
	2005
j38		Felipe Cucker: On sparseness, reducibilities, and complexity. Ann. Pure Appl. Logic 134(1): 53-61 (2005)
j37		Lenore Blum, Felipe Cucker, Tomaso Poggio, James Renegar, Michael Shub: Foreword. Foundations of Computational Mathematics 5(4): 349 (2005)
j36		Peter Bürgisser, Felipe Cucker, Martin Lotz: Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. Foundations of Computational Mathematics 5(4): 351-387 (2005)
j35		Dennis Cheung, Felipe Cucker: A note on level-2 condition numbers. J. Complexity 21(3): 314-319 (2005)
j34		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): 41-58 (2005)
j33		Dennis Cheung, Felipe Cucker, Raphael Hauser: Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems. SIAM Journal on Optimization 15(4): 1237-1261 (2005)
c15		Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois: The Complexity of Semilinear Problems in Succinct Representation. FCT 2005: 479-490
i2		Peter Bürgisser, Felipe Cucker: Exotic quantifiers, complexity classes, and complete problems. Electronic Colloquium on Computational Complexity (ECCC)(138) (2005)
	2004
j32		Felipe Cucker, Steve Smale, Ding-Xuan Zhou: Modeling Language Evolution. Foundations of Computational Mathematics 4(3): 315-343 (2004)
j31		Dennis Cheung, Felipe Cucker: Solving linear programs with finite precision: I. Condition numbers and random programs. Math. Program. 99(1): 175-196 (2004)
c14		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: 409-422
c13		Peter Bürgisser, Felipe Cucker: Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. STOC 2004: 475-485
	2003
j30		Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. Electr. Notes Theor. Comput. Sci. 90: 3-14 (2003)
j29		Dennis Cheung, Felipe Cucker: Learning from rounded-off data. Inf. Comput. 182(1): 1-13 (2003)
j28		Dennis Cheung, Felipe Cucker, Javier Peña: Unifying Condition Numbers for Linear Programming. Math. Oper. Res. 28(4): 609-624 (2003)
c12		Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. FoSSaCS 2003: 185-199
c11		Peter Bürgisser, Felipe Cucker: Counting Complexity Classes over the Reals I: The Additive Case. ISAAC 2003: 625-634
i1		Peter Bürgisser, Felipe Cucker: Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. CoRR cs.CC/0312007 (2003)
	2002
j27		Felipe Cucker: On sparseness and Turing reducibility over the reals. Electr. Notes Theor. Comput. Sci. 67: 7-14 (2002)
j26		Felipe Cucker, Steve Smale: Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem. Foundations of Computational Mathematics 2(4): 413-428 (2002)
j25		Felipe Cucker: Real Computations with Fake Numbers. J. Complexity 18(1): 104-134 (2002)
j24		Felipe Cucker, Javier Peña: A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine. SIAM Journal on Optimization 12(2): 522-554 (2002)
	2001
j23		Felipe Cucker, Dima Grigoriev: There are No Sparse NP_w-Hard Sets. SIAM J. Comput. 31(1): 193-198 (2001)
j22		Felipe Cucker: On weak and weighted computations over the real closure of Q. Theor. Comput. Sci. 255(1-2): 593-600 (2001)
c10		Felipe Cucker, Dima Grigoriev: There Are No Sparse NP_W-Hard Sets. MFCS 2001: 285-291
	2000
j21		Felipe Cucker, Thomas Lickteig: Preface. J. Complexity 16(1): 1 (2000)
c9		Felipe Cucker: Solving polynomial systems: a complexity theory viewpoint. ISSAC 2000
	1999
j20		Felipe Cucker, Steve Smale: Complexity Estimates Depending on Condition and Round-Off Error. J. ACM 46(1): 113-184 (1999)
j19		Felipe Cucker: Approximate Zeros and Condition Numbers. J. Complexity 15(2): 214-226 (1999)
j18		Felipe Cucker, Dima Grigoriev: Complexity Lower Bounds for Approximation Algebraic Computation Trees. J. Complexity 15(4): 499-512 (1999)
j17		Felipe Cucker, Pascal Koiran, Steve Smale: A Polynomial Time Algorithm for Diophantine Equations in One Variable. J. Symb. Comput. 27(1): 21-29 (1999)
j16		Felipe Cucker, Klaus Meer: Logics Which Capture Complexity Classes Over The Reals. J. Symb. Log. 64(1): 363-390 (1999)
c8		Felipe Cucker: Real Computations with Fake Numbers. ICALP 1999: 55-73
	1998
c7		Felipe Cucker, Steve Smale: Complexity Estimates Depending on Condition and Round-Off Error. ESA 1998: 115-126
	1997
j15		Felipe Cucker, Pascal Koiran, Martín Matamala: Complexity and Dimension. Inf. Process. Lett. 62(4): 209-212 (1997)
j14		Felipe Cucker: Machines Over the Reals and Non Uniformity. Math. Log. Q. 43: 143-157 (1997)
j13		Felipe Cucker, Dima Grigoriev: On the Power of Real Turing Machines Over Binary Inputs. SIAM J. Comput. 26(1): 243-254 (1997)
c6		Felipe Cucker, Klaus Meer: Logics Which Capture Complexity Classes over the Reals. FCT 1997: 157-167
	1996
j12		Felipe Cucker, Michael Shub: EDITOR'S FOREWORD. J. Complexity 12(4): 255-256 (1996)
j11		Felipe Cucker, Martín Matamala: On Digital Nondeterminism. Mathematical Systems Theory 29(6): 635-647 (1996)
j10		Felipe Cucker, Mike Shub: Generalized Knapsack Problems and Fixed Degree Separations. Theor. Comput. Sci. 161(1&2): 301-306 (1996)
	1995
j9		Felipe Cucker, Pascal Koiran: Computing over the Reals with Addition and Order: Higher Complexity Classes. J. Complexity 11(3): 358-376 (1995)
c5		Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther: On real Turing machines that toss coins. STOC 1995: 335-342
	1994
j8		Felipe Cucker, Mike Shub, Steve Smale: Separation of Complexity Classes in Koiran's Weak Model. Theor. Comput. Sci. 133(1): 3-14 (1994)
	1993
j7		Felipe Cucker: On the Complexity of Quantifier Elimination: the Structural Approach. Comput. J. 36(5): 400-408 (1993)
c4		Felipe Cucker, Francesc Rosselló: Recursiveness over the Complex Numbers is Time-Bounded. FSTTCS 1993: 260-267
	1992
j6		Felipe Cucker, Hervé Lanneau, Bud Mishra, Paul Pedersen, Marie-Françoise Roy: NC Algorithms for Real Algebraic Numbers. Appl. Algebra Eng. Commun. Comput. 3: 79-98 (1992)
j5		Felipe Cucker: P_R != NC_R. J. Complexity 8(3): 230-238 (1992)
j4		Felipe Cucker, A. Torrecillas: Two P-complete problems in the theory of the reals. J. Complexity 8(4): 454-466 (1992)
j3		Felipe Cucker: The Arithmetical Hierarchy over the Reals. J. Log. Comput. 2(3): 375-395 (1992)
c3		Felipe Cucker, Francesc Rosselló: On the Complexity of Some Problems for the Blum, Shub & Smale Model. LATIN 1992: 117-129
	1991
c2		Felipe Cucker, A. Torrecillas: Two P-Complete Problems in the Theory of the Reals. ICALP 1991: 556-565
	1990
j2		Felipe Cucker, Marie-Françoise Roy: Kac's Theorem on the Number of Real Roots and its Consequences in Average Complexity. J. Symb. Comput. 10(5): 405-410 (1990)
	1989
j1		Felipe Cucker, Joaquim Gabarró: Non Recursive Functions Have Transcendental Generating Series. ITA 23(4): 445-448 (1989)
	1987
c1		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. AAECC 1987: 161-181

2012

c18

Felipe Cucker: The Legacy of Turing in Numerical Analysis. SOFSEM 2012: 1-13

2011

j57

Felipe Cucker, Jiu-Gang Dong: A General Collision-Avoiding Flocking Framework. IEEE Trans. Automat. Contr. 56(5): 1124-1129 (2011)

2010

j56

Dennis Cheung, Felipe Cucker, Javier Peña: On strata of degenerate polyhedral cones, II: Relations between condition measures. J. Complexity 26(2): 209-226 (2010)

j55

Felipe Cucker, Raphael Hauser, Martin Lotz: Adversarial smoothed analysis. J. Complexity 26(3): 255-262 (2010)

j54

Peter Bürgisser, Felipe Cucker: Smoothed Analysis of Moore-Penrose Inversion. SIAM J. Matrix Analysis Applications 31(5): 2769-2783 (2010)

j53

Felipe Cucker, Jiu-Gang Dong: Avoiding Collisions in Flocks. IEEE Trans. Automat. Contr. 55(5): 1238-1243 (2010)

c17

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

Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor: A Numerical Algorithm for Zero Counting. III: Randomization and Condition. CoRR abs/1007.1597 (2010)

2009

j52

Felipe Cucker, Paulin Jacobé de Naurois: Parallel Time and Quantifier Prefixes. Computational Complexity 18(4): 527-550 (2009)

j51

Dennis Cheung, Felipe Cucker, Javier Peña: On strata of degenerate polyhedral cones I: Condition and distance to strata. European Journal of Operational Research 198(1): 23-28 (2009)

j50

Peter Bürgisser, Felipe Cucker: Exotic Quantifiers, Complexity Classes, and Complete Problems. Foundations of Computational Mathematics 9(2): 135-170 (2009)

j49

Dennis Cheung, Felipe Cucker: Componentwise Condition Numbers of Random Sparse Matrices. SIAM J. Matrix Analysis Applications 31(2): 721-731 (2009)

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

2008

j48

Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor: A numerical algorithm for zero counting, I: Complexity and accuracy. J. Complexity 24(5-6): 582-605 (2008)

j47

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

j46

Dennis Cheung, Felipe Cucker, Javier Peña: A Condition Number for Multifold Conic Systems. SIAM Journal on Optimization 19(1): 261-280 (2008)

2007

j45

Felipe Cucker, Irénée Briquel: A note on parallel and alternating time. J. Complexity 23(4-6): 594-602 (2007)

j44

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): 947-963 (2007)

j43

Felipe Cucker, Steve Smale: Emergent Behavior in Flocks. IEEE Trans. Automat. Contr. 52(5): 852-862 (2007)

c16

Peter Bürgisser, Felipe Cucker: Exotic Quantifiers, Complexity Classes, and Complete Problems. ICALP 2007: 207-218

Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor: A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy. CoRR abs/0710.4508 (2007)

2006

j42

Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois: The complexity of semilinear problems in succinct representation. Computational Complexity 15(3): 197-235 (2006)

j41

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

j40

Peter Bürgisser, Felipe Cucker: Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. J. Complexity 22(2): 147-191 (2006)

j39

Dennis Cheung, Felipe Cucker: Solving linear programs with finite precision: II. Algorithms. J. Complexity 22(3): 305-335 (2006)

2005

j38

Felipe Cucker: On sparseness, reducibilities, and complexity. Ann. Pure Appl. Logic 134(1): 53-61 (2005)

j37

Lenore Blum, Felipe Cucker, Tomaso Poggio, James Renegar, Michael Shub: Foreword. Foundations of Computational Mathematics 5(4): 349 (2005)

j36

Peter Bürgisser, Felipe Cucker, Martin Lotz: Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. Foundations of Computational Mathematics 5(4): 351-387 (2005)

j35

Dennis Cheung, Felipe Cucker: A note on level-2 condition numbers. J. Complexity 21(3): 314-319 (2005)

j34

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): 41-58 (2005)

j33

Dennis Cheung, Felipe Cucker, Raphael Hauser: Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems. SIAM Journal on Optimization 15(4): 1237-1261 (2005)

c15

Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois: The Complexity of Semilinear Problems in Succinct Representation. FCT 2005: 479-490

Peter Bürgisser, Felipe Cucker: Exotic quantifiers, complexity classes, and complete problems. Electronic Colloquium on Computational Complexity (ECCC)(138) (2005)

2004

j32

Felipe Cucker, Steve Smale, Ding-Xuan Zhou: Modeling Language Evolution. Foundations of Computational Mathematics 4(3): 315-343 (2004)

j31

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

c14

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: 409-422

c13

Peter Bürgisser, Felipe Cucker: Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. STOC 2004: 475-485

2003

j30

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. Electr. Notes Theor. Comput. Sci. 90: 3-14 (2003)

j29

Dennis Cheung, Felipe Cucker: Learning from rounded-off data. Inf. Comput. 182(1): 1-13 (2003)

j28

Dennis Cheung, Felipe Cucker, Javier Peña: Unifying Condition Numbers for Linear Programming. Math. Oper. Res. 28(4): 609-624 (2003)

c12

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

c11

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

Peter Bürgisser, Felipe Cucker: Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. CoRR cs.CC/0312007 (2003)

2002

j27

Felipe Cucker: On sparseness and Turing reducibility over the reals. Electr. Notes Theor. Comput. Sci. 67: 7-14 (2002)

j26

Felipe Cucker, Steve Smale: Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem. Foundations of Computational Mathematics 2(4): 413-428 (2002)

j25

Felipe Cucker: Real Computations with Fake Numbers. J. Complexity 18(1): 104-134 (2002)

j24

Felipe Cucker, Javier Peña: A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine. SIAM Journal on Optimization 12(2): 522-554 (2002)

2001

j23

Felipe Cucker, Dima Grigoriev: There are No Sparse NP_w-Hard Sets. SIAM J. Comput. 31(1): 193-198 (2001)

j22

Felipe Cucker: On weak and weighted computations over the real closure of Q. Theor. Comput. Sci. 255(1-2): 593-600 (2001)

c10

Felipe Cucker, Dima Grigoriev: There Are No Sparse NP_W-Hard Sets. MFCS 2001: 285-291

2000

j21

Felipe Cucker, Thomas Lickteig: Preface. J. Complexity 16(1): 1 (2000)

Felipe Cucker: Solving polynomial systems: a complexity theory viewpoint. ISSAC 2000

1999

j20

Felipe Cucker, Steve Smale: Complexity Estimates Depending on Condition and Round-Off Error. J. ACM 46(1): 113-184 (1999)

j19

Felipe Cucker: Approximate Zeros and Condition Numbers. J. Complexity 15(2): 214-226 (1999)

j18

Felipe Cucker, Dima Grigoriev: Complexity Lower Bounds for Approximation Algebraic Computation Trees. J. Complexity 15(4): 499-512 (1999)

j17

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

j16

Felipe Cucker, Klaus Meer: Logics Which Capture Complexity Classes Over The Reals. J. Symb. Log. 64(1): 363-390 (1999)

Felipe Cucker: Real Computations with Fake Numbers. ICALP 1999: 55-73

1998

Felipe Cucker, Steve Smale: Complexity Estimates Depending on Condition and Round-Off Error. ESA 1998: 115-126

1997

j15

Felipe Cucker, Pascal Koiran, Martín Matamala: Complexity and Dimension. Inf. Process. Lett. 62(4): 209-212 (1997)

j14

Felipe Cucker: Machines Over the Reals and Non Uniformity. Math. Log. Q. 43: 143-157 (1997)

j13

Felipe Cucker, Dima Grigoriev: On the Power of Real Turing Machines Over Binary Inputs. SIAM J. Comput. 26(1): 243-254 (1997)

Felipe Cucker, Klaus Meer: Logics Which Capture Complexity Classes over the Reals. FCT 1997: 157-167

1996

j12

Felipe Cucker, Michael Shub: EDITOR'S FOREWORD. J. Complexity 12(4): 255-256 (1996)

j11

Felipe Cucker, Martín Matamala: On Digital Nondeterminism. Mathematical Systems Theory 29(6): 635-647 (1996)

j10

Felipe Cucker, Mike Shub: Generalized Knapsack Problems and Fixed Degree Separations. Theor. Comput. Sci. 161(1&2): 301-306 (1996)

1995

Felipe Cucker, Pascal Koiran: Computing over the Reals with Addition and Order: Higher Complexity Classes. J. Complexity 11(3): 358-376 (1995)

Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther: On real Turing machines that toss coins. STOC 1995: 335-342

1994

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

1993

Felipe Cucker: On the Complexity of Quantifier Elimination: the Structural Approach. Comput. J. 36(5): 400-408 (1993)

Felipe Cucker, Francesc Rosselló: Recursiveness over the Complex Numbers is Time-Bounded. FSTTCS 1993: 260-267

1992

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

Felipe Cucker: P_R != NC_R. J. Complexity 8(3): 230-238 (1992)

Felipe Cucker, A. Torrecillas: Two P-complete problems in the theory of the reals. J. Complexity 8(4): 454-466 (1992)

Felipe Cucker: The Arithmetical Hierarchy over the Reals. J. Log. Comput. 2(3): 375-395 (1992)

Felipe Cucker, Francesc Rosselló: On the Complexity of Some Problems for the Blum, Shub & Smale Model. LATIN 1992: 117-129

1991

Felipe Cucker, A. Torrecillas: Two P-Complete Problems in the Theory of the Reals. ICALP 1991: 556-565

1990

Felipe Cucker, Marie-Françoise Roy: Kac's Theorem on the Number of Real Roots and its Consequences in Average Complexity. J. Symb. Comput. 10(5): 405-410 (1990)

1989

Felipe Cucker, Joaquim Gabarró: Non Recursive Functions Have Transcendental Generating Series. ITA 23(4): 445-448 (1989)

1987

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. AAECC 1987: 161-181

1	Lenore Blum	[j37]
2	Olivier Bournez	[j41] [j34] [c14] [j30] [c12]
3	Irénée Briquel	[j45]
4	Peter Bürgisser (Peter Buergisser)	[j54] [c17] [j50] [j47] [c16] [j42] [j40] [j36] [c15] [i2] [c13] [c11] [i1]
5	Dennis Cheung	[j56] [j51] [j49] [j46] [j39] [j35] [j33] [j31] [j29] [j28]
6	Huaian Diao	[j44]
7	Jiu-Gang Dong	[j57] [j53]
8	Joaquim Gabarró (Joaquim Gabarró Vallés)	[j1]
9	Dima Grigoriev	[j23] [c10] [j18] [j13]
10	Raphael Hauser	[j55] [j33]
11	Marek Karpinski	[c5]
12	Pascal Koiran	[j17] [j15] [j9] [c5]
13	Teresa Krick	[i5] [i4] [j48] [i3]
14	Hervé Lanneau	[j6]
15	Thomas Lickteig	[j21] [c5]
16	Martin Lotz	[j55] [j47] [j36]
17	Gregorio Malajovich	[i5] [i4] [j48] [i3]
18	Jean-Yves Marion	[j41] [j34] [c14] [j30] [c12]
19	Martín Matamala	[j15] [j11]
20	Klaus Meer	[j16] [c6]
21	Bud Mishra (Bhubaneswar Mishra)	[j6]
22	Paulin Jacobé de Naurois	[j52] [j42] [j41] [j34] [c15] [c14] [j30] [c12]
23	Luis M. Pardo (Luis Miguel Pardo)	[c1]
24	Paul Pedersen	[j6]
25	Javier Peña	[j56] [j51] [j46] [j28] [j24]
26	Tomaso Poggio	[j37]
27	Mario Raimondo	[c1]
28	Tomás Recio	[c1]
29	James Renegar	[j37]
30	Francesc Rosselló (Francesc Rosselló Llompart)	[c4] [c3]
31	Marie-Françoise Roy	[j6] [j2] [c1]
32	Mike Shub (Michael Shub)	[j37] [j12] [j10] [j8]
33	Steve Smale	[j43] [j32] [j26] [j20] [j17] [c7] [j8]
34	A. Torrecillas	[j4] [c2]
35	Yimin Wei	[j44]
36	Kai Werther	[c5]
37	Mario Wschebor	[i5] [i4] [j48] [i3]
38	Ding-Xuan Zhou	[j32]

Felipe Cucker

Coauthor Index