| Newton's method on Riemannian manifolds: covariant alpha theory JP Dedieu, P Priouret, G Malajovich IMA Journal of Numerical Analysis 23 (3), 395-419, 2003 | 156 | 2003 |
| High probability analysis of the condition number of sparse polynomial systems G Malajovich, JM Rojas Theoretical computer science 315 (2-3), 525-555, 2004 | 61 | 2004 |
| A numerical algorithm for zero counting, I: Complexity and accuracy F Cucker, T Krick, G Malajovich, M Wschebor Journal of Complexity 24 (5-6), 582-605, 2008 | 49 | 2008 |
| On the curvature of the central path of linear programming theory JP Dedieu, G Malajovich, M Shub Foundations of Computational Mathematics 5, 145-171, 2005 | 47 | 2005 |
| Tangent graeffe iteration G Malajovich, JP Zubelli Numerische Mathematik 89, 749-782, 2001 | 43 | 2001 |
| On generalized Newton algorithms: quadratic convergence, path-following and error analysis G Malajovich Theoretical Computer Science 133 (1), 65-84, 1994 | 37 | 1994 |
| On the number of minima of a random polynomial JP Dedieu, G Malajovich Journal of Complexity 24 (2), 89-108, 2008 | 36 | 2008 |
| On the geometry of Graeffe iteration G Malajovich, JP Zubelli journal of complexity 17 (3), 541-573, 2001 | 33 | 2001 |
| A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis F Cucker, T Krick, G Malajovich, M Wschebor Journal of Fixed Point Theory and Applications 6, 285-294, 2009 | 32 | 2009 |
| Adaptive step-size selection for homotopy methods to solve polynomial equations JP Dedieu, G Malajovich, M Shub IMA Journal of Numerical Analysis 33 (1), 1-29, 2013 | 31 | 2013 |
| Convexity properties of the condition number C Beltrán, JP Dedieu, G Malajovich, M Shub SIAM Journal on Matrix Analysis and Applications 31 (3), 1491-1506, 2010 | 30 | 2010 |
| On the complexity of computing error bounds J Demmel, B Diament, G Malajovich Foundations of Computational Mathematics 1 (1), 101-125, 2001 | 30 | 2001 |
| Computing mixed volume and all mixed cells in quermassintegral time G Malajovich Foundations of Computational Mathematics 17 (5), 1293-1334, 2017 | 27 | 2017 |
| A numerical algorithm for zero counting. III: Randomization and condition F Cucker, T Krick, G Malajovich, M Wschebor Advances in Applied Mathematics 48 (1), 215-248, 2012 | 27 | 2012 |
| Computing minimal multi-homogeneous Bézout numbers is hard G Malajovich, K Meer Theory of Computing Systems 40 (4), 553-570, 2007 | 26 | 2007 |
| On the Structure of \calNP_\BbbC G Malajovich, K Meer SIAM Journal on Computing 28 (1), 27-35, 1998 | 23 | 1998 |
| Polynomial systems and the momentum map G Malajovich, JM Rojas Foundations of computational mathematics (Hong Kong, 2000), World Sci …, 2002 | 21 | 2002 |
| Convexity properties of the condition number II C Beltrán, JP Dedieu, G Malajovich, M Shub SIAM Journal on Matrix Analysis and Applications 33 (3), 905-939, 2012 | 20 | 2012 |
| An effective version of Kronecker’s theorem on simultaneous Diophantine approximation G Malajovich Technical report, City University of Hong Kong, 1996 | 19 | 1996 |
| A fast and stable algorithm for splitting polynomials G Malajovich, JP Zubelli Computers & Mathematics with Applications 33 (3), 1-23, 1997 | 18 | 1997 |
Michael ShubCity College of CUNYVerified email at ccny.cuny.edu