Mike Shub

Michael Shub

	2009
32		Michael Shub: Complexity of Bezout's Theorem VI: Geodesics in the Condition (Number) Metric. Foundations of Computational Mathematics 9(2): 171-178 (2009)
31		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)
	2007
30		Steve Smale, Michael Shub: Smale horseshoe. Scholarpedia 2(11): 3012 (2007)
29		Michael Shub: Morse-Smale systems. Scholarpedia 2(3): 1785 (2007)
	2005
28		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)
27		Lenore Blum, Felipe Cucker, Tomaso Poggio, James Renegar, Michael Shub: Foreword. Foundations of Computational Mathematics 5(4): 349 (2005)
26		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
25		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)
24		Brenda Dietrich, Michael Shub: Preface. IBM Journal of Research and Development 47(1): 3-4 (2003)
	2001
23		Mike Shub: Editorial. Foundations of Computational Mathematics 1(1): 1-2 (2001)
22		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
21		Jean-Pierre Dedieu, Mike Shub: Multihomogeneous Newton methods. Math. Comput. 69(231): 1071-1098 (2000)
20		Jean-Pierre Dedieu, Mike Shub: Newton's method for overdetermined systems of equations. Math. Comput. 69(231): 1099-1115 (2000)
	1997
19		Charles Pugh, Michael Shub: Stably Ergodic Dynamical Systems and Partial Hyperbolicity. J. Complexity 13(1): 125-179 (1997)
18		Michael Shub: Guest Editor's Introduction. J. Complexity 13(1): 2-3 (1997)
	1996
17		Felipe Cucker, Michael Shub: EDITOR'S FOREWORD. J. Complexity 12(4): 255-256 (1996)
16		Felipe Cucker, Mike Shub: Generalized Knapsack Problems and Fixed Degree Separations. Theor. Comput. Sci. 161(1&2): 301-306 (1996)
	1994
15		Michael Shub: The implicit function theorem revisited. IBM Journal of Research and Development 38(3): 259-264 (1994)
14		Mike Shub, Steve Smale: Complexity of Bezout's Theorem V: Polynomial Time. Theor. Comput. Sci. 133(1): 141-164 (1994)
13		Felipe Cucker, Mike Shub, Steve Smale: Separation of Complexity Classes in Koiran's Weak Model. Theor. Comput. Sci. 133(1): 3-14 (1994)
	1993
12		Michael Shub, Steve Smale: Complexity of Bezout's Theorem: III. Condition Number and Packing. J. Complexity 9(1): 4-14 (1993)
	1992
11		Peter Bürgisser, Thomas Lickteig, Michael Shub: Test complexity of generic polynomials. J. Complexity 8(3): 203-215 (1992)
10		James Renegar, Michael Shub: Unified complexity analysis for Newton LP methods. Math. Program. 53: 1-16 (1992)
	1989
9		Michael Shub: On the distance to the zero set of a homogeneous polynomial. J. Complexity 5(3): 303-305 (1989)
	1988
8		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
7		Michael Shub: On the asymptotic behavior of the projective rescaling algorithm for linear programming. J. Complexity 3(3): 258-269 (1987)
	1986
6		Michael Shub, Steve Smale: On the existence of generally convergent algorithms. J. Complexity 2(1): 2-11 (1986)
5		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)
4		Lenore Blum, Manuel Blum, Mike Shub: A Simple Unpredictable Pseudo-Random Number Generator. SIAM J. Comput. 15(2): 364-383 (1986)
3		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
2		Lenore Blum, Mike Shub: Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average (Extended Abstract) FOCS 1984: 261-267
	1982
1		Lenore Blum, Manuel Blum, Mike Shub: Comparison of Two Pseudo-Random Number Generators. CRYPTO 1982: 61-78

Coauthor Index

1	Carlos Beltrán	[31]
2	Lenore Blum	[1] [2] [3] [4] [8] [27]
3	Manuel Blum	[1] [4]
4	Peter Bürgisser	[11]
5	Felipe Cucker	[13] [16] [17] [27]
6	Jean-Pierre Dedieu	[20] [21] [22] [25] [26] [28]
7	Brenda Dietrich	[24]
8	Myong-Hi Kim	[25]
9	Thomas Lickteig	[11]
10	Gregorio Malajovich	[28]
11	Tomaso Poggio	[27]
12	Charles Pugh	[19]
13	James Renegar	[10] [27]
14	Steve Smale	[5] [6] [8] [12] [13] [14] [30]
15	Françoise Tisseur	[25]

Colors in the list of coauthors