Stephen Smale

Affiliations:
  • City University of Hong Kong, Department of Mathematics
  • Toyota Technological Institute at Chicago
  • University of California, Berkeley, Department of Mathematics


According to our database1, Stephen Smale authored at least 30 papers between 1982 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
The Pitchfork Bifurcation.
Int. J. Bifurc. Chaos, 2017

Mathematics of the Genome.
Found. Comput. Math., 2017

2014
Introduction to the Peptide Binding Problem of Computational Immunology: New Results.
Found. Comput. Math., 2014

2012
Hodge Theory on Metric Spaces.
Found. Comput. Math., 2012

Towards a Mathematical Foundation of Immunology and Amino Acid Chains
CoRR, 2012

2011
A Topological View of Unsupervised Learning from Noisy Data.
SIAM J. Comput., 2011

Mathematical and Computational Foundations of Learning Theory (Dagstuhl Seminar 11291).
Dagstuhl Reports, 2011

2010
Mathematics of the Neural Response.
Found. Comput. Math., 2010

2009
Hodge Theory on Metric Spaces.
CoRR, 2009

2008
Finding the Homology of Submanifolds with High Confidence from Random Samples.
Discret. Comput. Geom., 2008

2007
Emergent Behavior in Flocks.
IEEE Trans. Autom. Control., 2007

Smale horseshoe.
Scholarpedia, 2007

Risk Bounds for Random Regression Graphs.
Found. Comput. Math., 2007

2006
Online Learning Algorithms.
Found. Comput. Math., 2006

Data and learning.
Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

2004
Modeling Language Evolution.
Found. Comput. Math., 2004

2002
Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem.
Found. Comput. Math., 2002

1999
A Polynomial Time Algorithm for Diophantine Equations in One Variable.
J. Symb. Comput., 1999

Complexity Estimates Depending on Condition and Round-Off Error.
J. ACM, 1999

1998
Some Lower Bounds for the Complexity of Continuation Methods.
J. Complex., 1998

1994
Complexity of Bezout's Theorem V: Polynomial Time.
Theor. Comput. Sci., 1994

Separation of Complexity Classes in Koiran's Weak Model.
Theor. Comput. Sci., 1994

1993
Complexity of Bezout's Theorem: III. Condition Number and Packing.
J. Complex., 1993

1990
Some Remarks on the Foundations of Numerical Analysis.
SIAM Rev., 1990

1988
On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987
On the topology of algorithms, I.
J. Complex., 1987

1986
Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II.
SIAM J. Comput., 1986

On the existence of generally convergent algorithms.
J. Complex., 1986

1983
On the average number of steps of the simplex method of linear programming.
Math. Program., 1983

1982
The Problem of the Average Speed of the Simplex Method.
Proceedings of the Mathematical Programming The State of the Art, 1982


  Loading...