The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. Lenore Blum, Felipe Cucker, Tomaso Poggio, James Renegar, Michael Shub
    Foreword. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2005, v:5, n:4, pp:349- [Journal]
  2. Françoise Tisseur, Jean-Pierre Dedieu, Myong-Hi Kim, Michael Shub
    Implicit Gamma Theorems (I): Pseudoroots and Pseudospectra. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2003, v:3, n:1, pp:1-31 [Journal]
  3. Brenda Dietrich, Michael Shub
    Preface. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 2003, v:47, n:1, pp:3-4 [Journal]
  4. Peter Bürgisser, Thomas Lickteig, Michael Shub
    Test complexity of generic polynomials. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1992, v:8, n:3, pp:203-215 [Journal]
  5. Felipe Cucker, Michael Shub
    EDITOR'S FOREWORD. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1996, v:12, n:4, pp:255-256 [Journal]
  6. Michael Shub, Steve Smale
    Complexity of Bezout's Theorem: III. Condition Number and Packing. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1993, v:9, n:1, pp:4-14 [Journal]
  7. Charles Pugh, Michael Shub
    Stably Ergodic Dynamical Systems and Partial Hyperbolicity. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:1, pp:125-179 [Journal]
  8. Michael Shub
    On the asymptotic behavior of the projective rescaling algorithm for linear programming. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1987, v:3, n:3, pp:258-269 [Journal]
  9. Michael Shub
    On the distance to the zero set of a homogeneous polynomial. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1989, v:5, n:3, pp:303-305 [Journal]
  10. Michael Shub
    Guest Editor's Introduction. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:1, pp:2-3 [Journal]
  11. Michael Shub, Steve Smale
    On the existence of generally convergent algorithms. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1986, v:2, n:1, pp:2-11 [Journal]
  12. James Renegar, Michael Shub
    Unified complexity analysis for Newton LP methods. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:1-16 [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