On Generalized Newton Algorithms: Quadratic Convergence, Path-Following and Error Analysis. - Gregorio Malajovich (Theor. Comput. Sci., 1994)

On the Structure of NP_C. - Gregorio Malajovich; Klaus Meer (SIAM J. Comput., 1998)

Condition Number Bounds for Problems with Integer Coefficients. - Gregorio Malajovich (J. Complex., 2000)

On the Complexity of Computing Error Bounds. - James Demmel; Benjamin Diament; Gregorio Malajovich (Found. Comput. Math., 2001)

On a Transfer Theorem for the P != NP Conjecture. - Gregorio Malajovich (J. Complex., 2001)

On the Geometry of Graeffe Iteration. - Gregorio Malajovich; Jorge P. Zubelli (J. Complex., 2001)

Tangent Graeffe iteration. - Gregorio Malajovich; Jorge P. Zubelli (Numerische Mathematik, 2001)

Lower bounds for some decision problems over C. - Gregorio Malajovich (Theor. Comput. Sci., 2002)

On the Complexity of Computing Multi-Homogeneous Bézout Numbers. - Klaus Meer; Gregorio Malajovich (Algorithms and Complexity for Continuous Problems, 2004)

Computing Multi-Homogeneous Bezout Numbers is Hard - Gregorio Malajovich; Klaus Meer (CoRR, 2004)

High probability analysis of the condition number of sparse polynomial systems. - Gregorio Malajovich; J. Maurice Rojas (Theor. Comput. Sci., 2004)

On the Curvature of the Central Path of Linear Programming Theory. - Jean-Pierre Dedieu; Gregorio Malajovich; Mike Shub (Found. Comput. Math., 2005)

Guest editors' preface. - Askold Khovanskii; Pascal Koiran; Teresa Krick; Gregorio Malajovich; Joseph F. Traub (J. Complex., 2005)

Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard. - Gregorio Malajovich; Klaus Meer (Theory Comput. Syst., 2007)

Guest Editor's Preface. - Peter Bürgisser; Andrei Gabrielov; Teresa Krick; Gregorio Malajovich (J. Complex., 2008)

A numerical algorithm for zero counting, I: Complexity and accuracy. - Felipe Cucker; Teresa Krick; Gregorio Malajovich; Mario Wschebor (J. Complex., 2008)

On the number of minima of a random polynomial. - Jean-Pierre Dedieu; Gregorio Malajovich (J. Complex., 2008)

A Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis - Felipe Cucker; Teresa Krick; Gregorio Malajovich; Mario Wschebor (CoRR, 2009)

Convexity Properties of the Condition Number. - Carlos Beltrán 001; Jean-Pierre Dedieu; Gregorio Malajovich; Mike Shub (SIAM J. Matrix Anal. Appl., 2009)

Adaptative Step Size Selection for Homotopy Methods to Solve Polynomial Equations - Jean-Pierre Dedieu; Gregorio Malajovich; Michael Shub (CoRR, 2011)

A numerical algorithm for zero counting. III: Randomization and condition. - Felipe Cucker; Teresa Krick; Gregorio Malajovich; Mario Wschebor (Adv. Appl. Math., 2012)

Convexity Properties of the Condition Number II. - Carlos Beltrán 001; Jean-Pierre Dedieu; Gregorio Malajovich; Mike Shub (SIAM J. Matrix Anal. Appl., 2012)

On the Expected Number of Zeros of Nonlinear Equations. - Gregorio Malajovich (Found. Comput. Math., 2013)

Computing Mixed Volume and All Mixed Cells in Quermassintegral Time. - Gregorio Malajovich (Found. Comput. Math., 2017)

Complexity of Sparse Polynomial Solving: Homotopy on Toric Varieties and the Condition Metric. - Gregorio Malajovich (Found. Comput. Math., 2019)

A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations. - Gregorio Malajovich; Mike Shub (J. ACM, 2019)

Complexity of Sparse Polynomial Solving 2: Renormalization. - Gregorio Malajovich (CoRR, 2020)

On the expected number of real roots of polynomials and exponential sums. - Gregorio Malajovich (J. Complex., 2023)

Complexity of sparse polynomial solving 3: Infinity. - Gregorio Malajovich (CoRR, 2025)