default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen Smale
Person information
- affiliation: City University of Hong Kong, Department of Mathematics
- affiliation: Toyota Technological Institute at Chicago
- affiliation: University of California, Berkeley, Department of Mathematics
- award (1996): National Medal of Science
- award (1966): Fields Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j24]Indika Rajapakse, Steve Smale:
Mathematics of the Genome. Found. Comput. Math. 17(5): 1195-1217 (2017)- [j23]Indika Rajapakse, Steve Smale:
The Pitchfork Bifurcation. Int. J. Bifurc. Chaos 27(9): 1750132:1-1750132:5 (2017) - 2014
- [j22]Wen-Jun Shen, Hau-San Wong
, Quan-Wu Xiao, Xin Guo, Stephen Smale:
Introduction to the Peptide Binding Problem of Computational Immunology: New Results. Found. Comput. Math. 14(5): 951-984 (2014) - 2012
- [j21]Laurent Bartholdi, Thomas Schick, Nat Smale, Steve Smale:
Hodge Theory on Metric Spaces. Found. Comput. Math. 12(1): 1-48 (2012) - [i3]Wen-Jun Shen, Hau-San Wong, Quan-Wu Xiao, Xin Guo, Stephen Smale:
Towards a Mathematical Foundation of Immunology and Amino Acid Chains. CoRR abs/1205.6031 (2012) - 2011
- [j20]Partha Niyogi, Stephen Smale, Shmuel Weinberger:
A Topological View of Unsupervised Learning from Noisy Data. SIAM J. Comput. 40(3): 646-663 (2011) - [i2]Matthias Hein, Gábor Lugosi, Lorenzo Rosasco, Steve Smale:
Mathematical and Computational Foundations of Learning Theory (Dagstuhl Seminar 11291). Dagstuhl Reports 1(7): 53-69 (2011) - 2010
- [j19]Steve Smale, Lorenzo Rosasco, Jake V. Bouvrie, Andrea Caponnetto, Tomaso A. Poggio:
Mathematics of the Neural Response. Found. Comput. Math. 10(1): 67-91 (2010)
2000 – 2009
- 2009
- [i1]Laurent Bartholdi, Thomas Schick, Nat Smale, Steve Smale, Anthony W. Baker:
Hodge Theory on Metric Spaces. CoRR abs/0912.0284 (2009) - 2008
- [j18]Partha Niyogi, Stephen Smale, Shmuel Weinberger:
Finding the Homology of Submanifolds with High Confidence from Random Samples. Discret. Comput. Geom. 39(1-3): 419-441 (2008) - 2007
- [j17]Andrea Caponnetto, Steve Smale:
Risk Bounds for Random Regression Graphs. Found. Comput. Math. 7(4): 495-528 (2007) - [j16]Steve Smale, Michael Shub:
Smale horseshoe. Scholarpedia 2(11): 3012 (2007) - [j15]Felipe Cucker, Steve Smale:
Emergent Behavior in Flocks. IEEE Trans. Autom. Control. 52(5): 852-862 (2007) - 2006
- [j14]Steve Smale, Yuan Yao:
Online Learning Algorithms. Found. Comput. Math. 6(2): 145-170 (2006) - [c4]Stephen Smale:
Data and learning. GrC 2006: 21 - 2004
- [j13]Felipe Cucker, Steve Smale, Ding-Xuan Zhou:
Modeling Language Evolution. Found. Comput. Math. 4(3): 315-343 (2004) - 2002
- [j12]Felipe Cucker, Steve Smale:
Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem. Found. Comput. Math. 2(4): 413-428 (2002)
1990 – 1999
- 1999
- [j11]Felipe Cucker, Steve Smale:
Complexity Estimates Depending on Condition and Round-Off Error. J. ACM 46(1): 113-184 (1999) - [j10]Felipe Cucker, Pascal Koiran, Steve Smale:
A Polynomial Time Algorithm for Diophantine Equations in One Variable. J. Symb. Comput. 27(1): 21-29 (1999) - 1998
- [j9]Jean-Pierre Dedieu, Steve Smale:
Some Lower Bounds for the Complexity of Continuation Methods. J. Complex. 14(4): 454-465 (1998) - [c3]Felipe Cucker, Steve Smale:
Complexity Estimates Depending on Condition and Round-Off Error. ESA 1998: 115-126 - 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) - [j7]Mike Shub, Steve Smale:
Complexity of Bezout's Theorem V: Polynomial Time. Theor. Comput. Sci. 133(1): 141-164 (1994) - 1993
- [j6]Michael Shub, Steve Smale:
Complexity of Bezout's Theorem: III. Condition Number and Packing. J. Complex. 9(1): 4-14 (1993) - 1990
- [j5]Steve Smale:
Some Remarks on the Foundations of Numerical Analysis. SIAM Rev. 32(2): 211-220 (1990)
1980 – 1989
- 1988
- [c2]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
- [j4]Steve Smale:
On the topology of algorithms, I. J. Complex. 3(2): 81-89 (1987) - 1986
- [j3]Michael Shub, Steve Smale:
On the existence of generally convergent algorithms. J. Complex. 2(1): 2-11 (1986) - [j2]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) - 1983
- [j1]Steve Smale:
On the average number of steps of the simplex method of linear programming. Math. Program. 27(3): 241-262 (1983) - 1982
- [c1]Steve Smale:
The Problem of the Average Speed of the Simplex Method. ISMP 1982: 530-539
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-21 00:13 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:
