Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Steve Smale
2010 – today
- 2012
[j17]Laurent Bartholdi, Thomas Schick, Nat Smale, Steve Smale: Hodge Theory on Metric Spaces. Foundations of Computational Mathematics 12(1): 1-48 (2012)- 2011
- [i1]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
- [j16]Steve Smale, Lorenzo Rosasco, Jake V. Bouvrie, Andrea Caponnetto, Tomaso Poggio: Mathematics of the Neural Response. Foundations of Computational Mathematics 10(1): 67-91 (2010)
2000 – 2009
- 2007
- [j15]Andrea Caponnetto, Steve Smale: Risk Bounds for Random Regression Graphs. Foundations of Computational Mathematics 7(4): 495-528 (2007)
- [j14]
- [j13]Felipe Cucker, Steve Smale: Emergent Behavior in Flocks. IEEE Trans. Automat. Contr. 52(5): 852-862 (2007)
- 2006
- [j12]Steve Smale, Yuan Yao: Online Learning Algorithms. Foundations of Computational Mathematics 6(2): 145-170 (2006)
- 2004
- [j11]Felipe Cucker, Steve Smale, Ding-Xuan Zhou: Modeling Language Evolution. Foundations of Computational Mathematics 4(3): 315-343 (2004)
- 2002
- [j10]Felipe Cucker, Steve Smale: Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem. Foundations of Computational Mathematics 2(4): 413-428 (2002)
1990 – 1999
- 1999
- [j9]Felipe Cucker, Steve Smale: Complexity Estimates Depending on Condition and Round-Off Error. J. ACM 46(1): 113-184 (1999)
- [j8]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
- [j7]Jean-Pierre Dedieu, Steve Smale: Some Lower Bounds for the Complexity of Continuation Methods. J. Complexity 14(4): 454-465 (1998)
- [c2]Felipe Cucker, Steve Smale: Complexity Estimates Depending on Condition and Round-Off Error. ESA 1998: 115-126
- 1994
- [j6]Felipe Cucker, Mike Shub, Steve Smale: Separation of Complexity Classes in Koiran's Weak Model. Theor. Comput. Sci. 133(1): 3-14 (1994)
- [j5]Mike Shub, Steve Smale: Complexity of Bezout's Theorem V: Polynomial Time. Theor. Comput. Sci. 133(1): 141-164 (1994)
- 1993
- [j4]Michael Shub, Steve Smale: Complexity of Bezout's Theorem: III. Condition Number and Packing. J. Complexity 9(1): 4-14 (1993)
1980 – 1989
- 1988
- [c1]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
- [j3]
- 1986
- [j2]Michael Shub, Steve Smale: On the existence of generally convergent algorithms. J. Complexity 2(1): 2-11 (1986)
- [j1]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)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-07 21:53 CET by the dblp team