default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Shub
Person information
- affiliation: University of Toronto, Department of Mathematics
- affiliation: IBM Thomas J. Watson Research Center
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i3]Michael Shub, Qing Xu, Xiaohua Xuan:
Disease Prediction with a Maximum Entropy Method. CoRR abs/2102.02668 (2021)
2010 – 2019
- 2019
- [j39]Gregorio Malajovich
, Mike Shub:
A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations. J. ACM 66(4): 27:1-27:38 (2019) - 2018
- [j38]Felipe Cucker, Teresa Krick, Michael Shub:
Computing the Homology of Real Projective Sets. Found. Comput. Math. 18(4): 929-970 (2018) - [i2]Gregorio Malajovich, Mike Shub:
A theory of NP-completeness and ill-conditioning for approximate real computations. CoRR abs/1803.03600 (2018) - 2016
- [j37]Diego Armentano, Carlos Beltrán, Peter Bürgisser, Felipe Cucker, Michael Shub:
Condition Length and Complexity for the Solution of Polynomial Systems. Found. Comput. Math. 16(6): 1401-1422 (2016) - 2014
- [j36]Diego Armentano, Michael Shub:
Smale's Fundamental Theorem of Algebra Reconsidered. Found. Comput. Math. 14(1): 85-114 (2014) - [j35]Diego Armentano, Michael Shub:
Erratum to: Smale's Fundamental Theorem of Algebra Reconsidered. Found. Comput. Math. 14(4): 861 (2014) - 2012
- [j34]Carlos Beltrán, Michael Shub:
On the Geometry and Topology of the Solution Variety for Polynomial System Solving. Found. Comput. Math. 12(6): 719-763 (2012) - [j33]Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub:
Convexity Properties of the Condition Number II. SIAM J. Matrix Anal. Appl. 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
- [j32]Carlos Beltrán, Michael Shub:
A Note on the Finite Variance of the Averaging Function for Polynomial System Solving. Found. Comput. Math. 10(1): 115-125 (2010)
2000 – 2009
- 2009
- [j31]Michael Shub:
Complexity of Bezout's Theorem VI: Geodesics in the Condition (Number) Metric. Found. Comput. Math. 9(2): 171-178 (2009) - [j30]Carlos Beltrán, Michael Shub:
Complexity of Bezout's Theorem VII: Distance Estimates in the Condition Metric. Found. Comput. Math. 9(2): 179-195 (2009) - [j29]Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub:
Convexity Properties of the Condition Number. SIAM J. Matrix Anal. Appl. 31(3): 1491-1506 (2009) - 2007
- [j28]Michael Shub:
Morse-Smale systems. Scholarpedia 2(3): 1785 (2007) - [j27]Steve Smale, Michael Shub:
Smale horseshoe. Scholarpedia 2(11): 3012 (2007) - 2005
- [j26]Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub:
On the Curvature of the Central Path of Linear Programming Theory. Found. Comput. Math. 5(2): 145-171 (2005) - [j25]Lenore Blum, Felipe Cucker, Tomaso A. Poggio, James Renegar, Michael Shub:
Foreword. Found. Comput. Math. 5(4): 349 (2005) - [j24]Jean-Pierre Dedieu, Mike Shub:
Newton Flow and interior Point Methods in Linear Programming. Int. J. Bifurc. Chaos 15(3): 827-839 (2005) - 2003
- [j23]Françoise Tisseur, Jean-Pierre Dedieu, Myong-Hi Kim, Michael Shub:
Implicit Gamma Theorems (I): Pseudoroots and Pseudospectra. Found. Comput. Math. 3(1): 1-31 (2003) - [j22]Brenda Dietrich, Michael Shub:
Preface. IBM J. Res. Dev. 47(1): 3-4 (2003) - 2001
- [j21]Mike Shub:
Editorial. Found. Comput. Math. 1(1): 1-2 (2001) - [j20]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
- [j19]Jean-Pierre Dedieu, Mike Shub:
Multihomogeneous Newton methods. Math. Comput. 69(231): 1071-1098 (2000) - [j18]Jean-Pierre Dedieu, Mike Shub:
Newton's method for overdetermined systems of equations. Math. Comput. 69(231): 1099-1115 (2000)
1990 – 1999
- 1997
- [j17]Michael Shub:
Guest Editor's Introduction. J. Complex. 13(1): 2-3 (1997) - [j16]Charles Pugh, Michael Shub:
Stably Ergodic Dynamical Systems and Partial Hyperbolicity. J. Complex. 13(1): 125-179 (1997) - 1996
- [j15]Felipe Cucker, Michael Shub:
EDITOR'S FOREWORD. J. Complex. 12(4): 255-256 (1996) - [j14]Felipe Cucker, Mike Shub:
Generalized Knapsack Problems and Fixed Degree Separations. Theor. Comput. Sci. 161(1&2): 301-306 (1996) - 1994
- [j13]Michael Shub:
The implicit function theorem revisited. IBM J. Res. Dev. 38(3): 259-264 (1994) - [j12]Felipe Cucker, Mike Shub, Steve Smale:
Separation of Complexity Classes in Koiran's Weak Model. Theor. Comput. Sci. 133(1): 3-14 (1994) - [j11]Mike Shub, Steve Smale:
Complexity of Bezout's Theorem V: Polynomial Time. Theor. Comput. Sci. 133(1): 141-164 (1994) - 1993
- [j10]Michael Shub, Steve Smale:
Complexity of Bezout's Theorem: III. Condition Number and Packing. J. Complex. 9(1): 4-14 (1993) - 1992
- [j9]Peter Bürgisser, Thomas Lickteig, Michael Shub:
Test complexity of generic polynomials. J. Complex. 8(3): 203-215 (1992) - [j8]James Renegar, Michael Shub:
Unified complexity analysis for Newton LP methods. Math. Program. 53: 1-16 (1992)
1980 – 1989
- 1989
- [j7]Michael Shub:
On the distance to the zero set of a homogeneous polynomial. J. Complex. 5(3): 303-305 (1989) - [j6]Nimrod Megiddo, Michael Shub:
Boundary Behavior of Interior Point Algorithms in Linear Programming. Math. Oper. Res. 14(1): 97-146 (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. Complex. 3(3): 258-269 (1987) - 1986
- [j4]Michael Shub, Steve Smale:
On the existence of generally convergent algorithms. J. Complex. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
