The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mike Shub: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lenore Blum, Manuel Blum, Mike Shub
    Comparison of Two Pseudo-Random Number Generators. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:61-78 [Conf]
  2. Lenore Blum, Mike Shub
    Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:261-267 [Conf]
  3. Lenore Blum, Mike Shub, Steve Smale
    On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:387-397 [Conf]
  4. Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub
    On the Curvature of the Central Path of Linear Programming Theory. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2005, v:5, n:2, pp:145-171 [Journal]
  5. Mike Shub
    Editorial. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2001, v:1, n:1, pp:1-2 [Journal]
  6. Jean-Pierre Dedieu, Mike Shub
    Multihomogeneous Newton methods. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2000, v:69, n:231, pp:1071-1098 [Journal]
  7. Jean-Pierre Dedieu, Mike Shub
    Newton's method for overdetermined systems of equations. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2000, v:69, n:231, pp:1099-1115 [Journal]
  8. Jean-Pierre Dedieu, Mike Shub
    On simple double zeros and badly conditioned zeros of analytic functions of n variables. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2001, v:70, n:233, pp:319-327 [Journal]
  9. Lenore Blum, Manuel Blum, Mike Shub
    A Simple Unpredictable Pseudo-Random Number Generator. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:364-383 [Journal]
  10. Lenore Blum, Mike Shub
    Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:384-398 [Journal]
  11. Mike Shub, Steve Smale
    Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:145-161 [Journal]
  12. Felipe Cucker, Mike Shub
    Generalized Knapsack Problems and Fixed Degree Separations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:301-306 [Journal]
  13. Felipe Cucker, Mike Shub, Steve Smale
    Separation of Complexity Classes in Koiran's Weak Model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:3-14 [Journal]
  14. Mike Shub, Steve Smale
    Complexity of Bezout's Theorem V: Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:141-164 [Journal]

Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002