Comparison of Two Pseudo-Random Number Generators. - Lenore Blum; Manuel Blum 001; Mike Shub (CRYPTO, 1982)

Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average (Extended Abstract) - Lenore Blum; Mike Shub (FOCS, 1984)

On the existence of generally convergent algorithms. - Michael Shub; Steve Smale (J. Complex., 1986)

A Simple Unpredictable Pseudo-Random Number Generator. - Lenore Blum; Manuel Blum 001; Mike Shub (SIAM J. Comput., 1986)

Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average. - Lenore Blum; Mike Shub (SIAM J. Comput., 1986)

Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II. - Mike Shub; Steve Smale (SIAM J. Comput., 1986)

On the asymptotic behavior of the projective rescaling algorithm for linear programming. - Michael Shub (J. Complex., 1987)

On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract) - Lenore Blum; Mike Shub; Steve Smale (FOCS, 1988)

On the distance to the zero set of a homogeneous polynomial. - Michael Shub (J. Complex., 1989)

Boundary Behavior of Interior Point Algorithms in Linear Programming. - Nimrod Megiddo; Michael Shub (Math. Oper. Res., 1989)

Test complexity of generic polynomials. - Peter Bürgisser; Thomas Lickteig; Michael Shub (J. Complex., 1992)

Unified complexity analysis for Newton LP methods. - James Renegar; Michael Shub (Math. Program., 1992)

Complexity of Bezout's Theorem: III. Condition Number and Packing. - Michael Shub; Steve Smale (J. Complex., 1993)

The implicit function theorem revisited. - Michael Shub (IBM J. Res. Dev., 1994)

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

Complexity of Bezout's Theorem V: Polynomial Time. - Mike Shub; Steve Smale (Theor. Comput. Sci., 1994)

EDITOR'S FOREWORD. - Felipe Cucker; Michael Shub (J. Complex., 1996)

Generalized Knapsack Problems and Fixed Degree Separations. - Felipe Cucker; Mike Shub (Theor. Comput. Sci., 1996)

Stably Ergodic Dynamical Systems and Partial Hyperbolicity. - Charles Pugh; Michael Shub (J. Complex., 1997)

Guest Editor's Introduction. - Michael Shub (J. Complex., 1997)

Multihomogeneous Newton methods. - Jean-Pierre Dedieu; Mike Shub (Math. Comput., 2000)

Newton's method for overdetermined systems of equations. - Jean-Pierre Dedieu; Mike Shub (Math. Comput., 2000)

Editorial. - Mike Shub (Found. Comput. Math., 2001)

On simple double zeros and badly conditioned zeros of analytic functions of n variables. - Jean-Pierre Dedieu; Mike Shub (Math. Comput., 2001)

Implicit Gamma Theorems (I): Pseudoroots and Pseudospectra. - Françoise Tisseur; Jean-Pierre Dedieu; Myong-Hi Kim; Michael Shub (Found. Comput. Math., 2003)

Preface. - Brenda Dietrich; Michael Shub (IBM J. Res. Dev., 2003)

Foreword. - Lenore Blum; Felipe Cucker; Tomaso A. Poggio; James Renegar; Michael Shub (Found. Comput. Math., 2005)

On the Curvature of the Central Path of Linear Programming Theory. - Jean-Pierre Dedieu; Gregorio Malajovich; Mike Shub (Found. Comput. Math., 2005)

Newton Flow and interior Point Methods in Linear Programming. - Jean-Pierre Dedieu; Mike Shub (Int. J. Bifurc. Chaos, 2005)

Morse-Smale systems. - Michael Shub (Scholarpedia, 2007)

Smale horseshoe. - Steve Smale; Michael Shub (Scholarpedia, 2007)

Complexity of Bezout's Theorem VII: Distance Estimates in the Condition Metric. - Carlos Beltrán 001; Michael Shub (Found. Comput. Math., 2009)

Complexity of Bezout's Theorem VI: Geodesics in the Condition (Number) Metric. - Michael Shub (Found. Comput. Math., 2009)

Convexity Properties of the Condition Number. - Carlos Beltrán 001; Jean-Pierre Dedieu; Gregorio Malajovich; Mike Shub (SIAM J. Matrix Anal. Appl., 2009)

A Note on the Finite Variance of the Averaging Function for Polynomial System Solving. - Carlos Beltrán 001; Michael Shub (Found. Comput. Math., 2010)

Adaptative Step Size Selection for Homotopy Methods to Solve Polynomial Equations - Jean-Pierre Dedieu; Gregorio Malajovich; Michael Shub (CoRR, 2011)

On the Geometry and Topology of the Solution Variety for Polynomial System Solving. - Carlos Beltrán 001; Michael Shub (Found. Comput. Math., 2012)

Convexity Properties of the Condition Number II. - Carlos Beltrán 001; Jean-Pierre Dedieu; Gregorio Malajovich; Mike Shub (SIAM J. Matrix Anal. Appl., 2012)

Smale's Fundamental Theorem of Algebra Reconsidered. - Diego Armentano; Michael Shub (Found. Comput. Math., 2014)

Erratum to: Smale's Fundamental Theorem of Algebra Reconsidered. - Diego Armentano; Michael Shub (Found. Comput. Math., 2014)

Condition Length and Complexity for the Solution of Polynomial Systems. - Diego Armentano; Carlos Beltrán 001; Peter Bürgisser; Felipe Cucker; Michael Shub (Found. Comput. Math., 2016)

Computing the Homology of Real Projective Sets. - Felipe Cucker; Teresa Krick; Michael Shub (Found. Comput. Math., 2018)

A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations. - Gregorio Malajovich; Mike Shub (J. ACM, 2019)

Disease Prediction with a Maximum Entropy Method. - Michael Shub; Qing Xu; Xiaohua Xuan (CoRR, 2021)