Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Mike Shub
Michael Shub
2010 – today
- 2012
[j33]Carlos Beltrán, Michael Shub: On the Geometry and Topology of the Solution Variety for Polynomial System Solving. Foundations of Computational Mathematics 12(6): 719-763 (2012)- [j32]Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub: Convexity Properties of the Condition Number II. SIAM J. Matrix Analysis Applications 33(3): 905-939 (2012)
- 2011
- [i1]Jean-Pierre Dedieu, Gregorio Malajovich, Michael Shub: Adaptative Step Size Selection for Homotopy Methods to Solve Polynomial Equations. CoRR abs/1104.2084 (2011)
- 2010
- [j31]Carlos Beltrán, Michael Shub: A Note on the Finite Variance of the Averaging Function for Polynomial System Solving. Foundations of Computational Mathematics 10(1): 115-125 (2010)
2000 – 2009
- 2009
- [j30]Michael Shub: Complexity of Bezout's Theorem VI: Geodesics in the Condition (Number) Metric. Foundations of Computational Mathematics 9(2): 171-178 (2009)
- [j29]Carlos Beltrán, Michael Shub: Complexity of Bezout's Theorem VII: Distance Estimates in the Condition Metric. Foundations of Computational Mathematics 9(2): 179-195 (2009)
- [j28]Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub: Convexity Properties of the Condition Number. SIAM J. Matrix Analysis Applications 31(3): 1491-1506 (2009)
- 2007
- [j27]
- [j26]
- 2005
- [j25]Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub: On the Curvature of the Central Path of Linear Programming Theory. Foundations of Computational Mathematics 5(2): 145-171 (2005)
- [j24]Lenore Blum, Felipe Cucker, Tomaso Poggio, James Renegar, Michael Shub: Foreword. Foundations of Computational Mathematics 5(4): 349 (2005)
- [j23]Jean-Pierre Dedieu, Mike Shub: Newton Flow and interior Point Methods in Linear Programming. I. J. Bifurcation and Chaos 15(3): 827-839 (2005)
- 2003
- [j22]Françoise Tisseur, Jean-Pierre Dedieu, Myong-Hi Kim, Michael Shub: Implicit Gamma Theorems (I): Pseudoroots and Pseudospectra. Foundations of Computational Mathematics 3(1): 1-31 (2003)
- [j21]
- 2001
- [j20]
- [j19]Jean-Pierre Dedieu, Mike Shub: On simple double zeros and badly conditioned zeros of analytic functions of n variables. Math. Comput. 70(233): 319-327 (2001)
- 2000
- [j18]Jean-Pierre Dedieu, Mike Shub: Multihomogeneous Newton methods. Math. Comput. 69(231): 1071-1098 (2000)
- [j17]Jean-Pierre Dedieu, Mike Shub: Newton's method for overdetermined systems of equations. Math. Comput. 69(231): 1099-1115 (2000)
1990 – 1999
- 1997
- [j16]
- [j15]Charles Pugh, Michael Shub: Stably Ergodic Dynamical Systems and Partial Hyperbolicity. J. Complexity 13(1): 125-179 (1997)
- 1996
- [j14]
- [j13]Felipe Cucker, Mike Shub: Generalized Knapsack Problems and Fixed Degree Separations. Theor. Comput. Sci. 161(1&2): 301-306 (1996)
- 1994
- [j12]Michael Shub: The implicit function theorem revisited. IBM Journal of Research and Development 38(3): 259-264 (1994)
- [j11]Felipe Cucker, Mike Shub, Steve Smale: Separation of Complexity Classes in Koiran's Weak Model. Theor. Comput. Sci. 133(1): 3-14 (1994)
- [j10]Mike Shub, Steve Smale: Complexity of Bezout's Theorem V: Polynomial Time. Theor. Comput. Sci. 133(1): 141-164 (1994)
- 1993
- [j9]Michael Shub, Steve Smale: Complexity of Bezout's Theorem: III. Condition Number and Packing. J. Complexity 9(1): 4-14 (1993)
- 1992
- [j8]Peter Bürgisser, Thomas Lickteig, Michael Shub: Test complexity of generic polynomials. J. Complexity 8(3): 203-215 (1992)
- [j7]James Renegar, Michael Shub: Unified complexity analysis for Newton LP methods. Math. Program. 53: 1-16 (1992)
1980 – 1989
- 1989
- [j6]Michael Shub: On the distance to the zero set of a homogeneous polynomial. J. Complexity 5(3): 303-305 (1989)
- 1988
- [c3]Lenore Blum, Mike Shub, Steve Smale: On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract). FOCS 1988: 387-397
- 1987
- [j5]Michael Shub: On the asymptotic behavior of the projective rescaling algorithm for linear programming. J. Complexity 3(3): 258-269 (1987)
- 1986
- [j4]Michael Shub, Steve Smale: On the existence of generally convergent algorithms. J. Complexity 2(1): 2-11 (1986)
- [j3]Mike Shub, Steve Smale: Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II. SIAM J. Comput. 15(1): 145-161 (1986)
- [j2]Lenore Blum, Manuel Blum, Mike Shub: A Simple Unpredictable Pseudo-Random Number Generator. SIAM J. Comput. 15(2): 364-383 (1986)
- [j1]Lenore Blum, Mike Shub: Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average. SIAM J. Comput. 15(2): 384-398 (1986)
- 1984
- [c2]Lenore Blum, Mike Shub: Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average (Extended Abstract). FOCS 1984: 261-267
- 1982
- [c1]Lenore Blum, Manuel Blum, Mike Shub: Comparison of Two Pseudo-Random Number Generators. CRYPTO 1982: 61-78
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-08 21:06 CET by the dblp team