Steve Smale

Publication Activity (10 Years)

Years Active: 1982-2017
Publications (10 Years): 2

Top Topics

Phylogenetic Analysis

Computer Assisted Instruction

Similarity Searching

Top Venues

Found. Comput. Math.

Int. J. Bifurc. Chaos

Publications

Indika Rajapakse, Steve Smale
Mathematics of the Genome. Found. Comput. Math. 17 (5) (2017)
Indika Rajapakse, Steve Smale
The Pitchfork Bifurcation. Int. J. Bifurc. Chaos 27 (9) (2017)
Laurent Bartholdi, Thomas Schick, Nat Smale, Steve Smale
Hodge Theory on Metric Spaces. Found. Comput. Math. 12 (1) (2012)
Matthias Hein, Gábor Lugosi, Lorenzo Rosasco, Steve Smale
Mathematical and Computational Foundations of Learning Theory (Dagstuhl Seminar 11291). Dagstuhl Reports 1 (7) (2011)
Steve Smale, Lorenzo Rosasco, Jake V. Bouvrie, Andrea Caponnetto, Tomaso A. Poggio
Mathematics of the Neural Response. Found. Comput. Math. 10 (1) (2010)
Laurent Bartholdi, Thomas Schick, Nat Smale, Steve Smale, Anthony W. Baker
Hodge Theory on Metric Spaces. CoRR (2009)
Andrea Caponnetto, Steve Smale
Risk Bounds for Random Regression Graphs. Found. Comput. Math. 7 (4) (2007)
Felipe Cucker, Steve Smale
Emergent Behavior in Flocks. IEEE Trans. Autom. Control. 52 (5) (2007)
Steve Smale, Michael Shub
Smale horseshoe. Scholarpedia 2 (11) (2007)
Steve Smale, Yuan Yao
Online Learning Algorithms. Found. Comput. Math. 6 (2) (2006)
Felipe Cucker, Steve Smale, Ding-Xuan Zhou
Modeling Language Evolution. Found. Comput. Math. 4 (3) (2004)
Felipe Cucker, Steve Smale
Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem. Found. Comput. Math. 2 (4) (2002)
Felipe Cucker, Steve Smale
Complexity Estimates Depending on Condition and Round-Off Error. J. ACM 46 (1) (1999)
Felipe Cucker, Pascal Koiran, Steve Smale
A Polynomial Time Algorithm for Diophantine Equations in One Variable. J. Symb. Comput. 27 (1) (1999)
Felipe Cucker, Steve Smale
Complexity Estimates Depending on Condition and Round-Off Error. ESA (1998)
Jean-Pierre Dedieu, Steve Smale
Some Lower Bounds for the Complexity of Continuation Methods. J. Complex. 14 (4) (1998)
Mike Shub, Steve Smale
Complexity of Bezout's Theorem V: Polynomial Time. Theor. Comput. Sci. 133 (1) (1994)
Felipe Cucker, Mike Shub, Steve Smale
Separation of Complexity Classes in Koiran's Weak Model. Theor. Comput. Sci. 133 (1) (1994)
Michael Shub, Steve Smale
Complexity of Bezout's Theorem: III. Condition Number and Packing. J. Complex. 9 (1) (1993)
Steve Smale
Some Remarks on the Foundations of Numerical Analysis. SIAM Rev. 32 (2) (1990)
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)
Steve Smale
On the topology of algorithms, I. J. Complex. 3 (2) (1987)
Mike Shub, Steve Smale
Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II. SIAM J. Comput. 15 (1) (1986)
Michael Shub, Steve Smale
On the existence of generally convergent algorithms. J. Complex. 2 (1) (1986)
Steve Smale
On the average number of steps of the simplex method of linear programming. Math. Program. 27 (3) (1983)
Steve Smale
The Problem of the Average Speed of the Simplex Method. ISMP (1982)