Polynomial and matrix computations: fundamental algorithms D Bini, VY Pan Springer Science & Business Media, 2012 | 786 | 2012 |

Structured matrices and polynomials: unified superfast algorithms VY Pan Springer Science & Business Media, 2012 | 551 | 2012 |

Solving a polynomial equation: some history and recent progress VY Pan SIAM review 39 (2), 187-220, 1997 | 469 | 1997 |

Numerical Methods for Roots of Polynomials-Part II JM McNamee, V Pan Newnes, 2013 | 337 | 2013 |

The complexity of the matrix eigenproblem VY Pan, ZQ Chen Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 334 | 1999 |

Univariate polynomials: nearly optimal algorithms for factorization and rootfinding VY Pan Proceedings of the 2001 international symposium on Symbolic and algebraic …, 2001 | 289 | 2001 |

Fast rectangular matrix multiplication and applications X Huang, VY Pan Journal of complexity 14 (2), 257-299, 1998 | 287 | 1998 |

Efficient parallel solution of linear systems V Pan, J Reif Proceedings of the seventeenth annual ACM symposium on Theory of computing …, 1985 | 247 | 1985 |

How to multiply matrices faster V Pan Springer-Verlag, 1984 | 240 | 1984 |

An improved Newton iteration for the generalized inverse of a matrix, with applications V Pan, R Schreiber SIAM Journal on Scientific and Statistical Computing 12 (5), 1109-1130, 1991 | 226 | 1991 |

Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations VY Pan 19th Annual Symposium on Foundations of Computer Science (sfcs 1978), 166-176, 1978 | 209 | 1978 |

On computations with dense structured matrices V Pan Mathematics of Computation 55 (191), 179-190, 1990 | 187 | 1990 |

How can we speed up matrix multiplication? V Pan SIAM review 26 (3), 393-415, 1984 | 187 | 1984 |

Methods of computing values of polynomials VY Pan Russian Mathematical Surveys 21 (1), 105, 1966 | 175 | 1966 |

Multivariate polynomials, duality, and structured matrices B Mourrain, VY Pan Journal of complexity 16 (1), 110-180, 2000 | 174 | 2000 |

Optimal and nearly optimal algorithms for approximating polynomial zeros VY Pan Computers & Mathematics with Applications 31 (12), 97-138, 1996 | 171 | 1996 |

How bad are Vandermonde matrices? VY Pan SIAM Journal on Matrix Analysis and Applications 37 (2), 676-694, 2016 | 151 | 2016 |

Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations DA Bini, L Gemignani, VY Pan Numerische Mathematik 100, 373-408, 2005 | 142 | 2005 |

Complexity of parallel matrix computations V Pan Theoretical Computer Science 54 (1), 65-85, 1987 | 139 | 1987 |

Complexity of computations with matrices and polynomials V Pan SIAM review 34 (2), 225-262, 1992 | 135 | 1992 |