| Polynomial and matrix computations: fundamental algorithms D Bini, VY Pan Springer Science & Business Media, 2012 | 736 | 2012 |
| Algorithms and theory of computation handbook, volume 2: special topics and techniques MJ Atallah, M Blanton CRC press, 2009 | 641 | 2009 |
| Structured matrices and polynomials: unified superfast algorithms V Pan Springer Science & Business Media, 2001 | 455 | 2001 |
| Solving a polynomial equation: some history and recent progress VY Pan SIAM review 39 (2), 187-220, 1997 | 411 | 1997 |
| Computer science handbook AB Tucker CRC press, 2004 | 351 | 2004 |
| Numerical Methods for Roots of Polynomials-Part II JM McNamee, V Pan Newnes, 2013 | 243 | 2013 |
| Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding VY Pan Journal of Symbolic Computation 33 (5), 701-733, 2002 | 239 | 2002 |
| Fast rectangular matrix multiplication and applications X Huang, VY Pan Journal of complexity 14 (2), 257-299, 1998 | 235 | 1998 |
| Efficient parallel solution of linear systems V Pan, J Reif Proceedings of the seventeenth annual ACM symposium on Theory of computing …, 1985 | 216 | 1985 |
| The complexity of the matrix eigenproblem VY Pan, ZQ Chen Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 208 | 1999 |
| How to multiply matrices faster V Pan Lecture notes in computer science 179, 1984 | 206 | 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 | 188 | 1991 |
| How can we speed up matrix multiplication? V Pan SIAM review 26 (3), 393-415, 1984 | 173 | 1984 |
| On computations with dense structured matrices V Pan Mathematics of Computation 55 (191), 179-190, 1990 | 170 | 1990 |
| Optimal and nearly optimal algorithms for approximating polynomial zeros VY Pan Computers & Mathematics with Applications 31 (12), 97-138, 1996 | 164 | 1996 |
| Multivariate polynomials, duality, and structured matrices B Mourrain, VY Pan Journal of complexity 16 (1), 110-180, 2000 | 161 | 2000 |
| 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 | 158 | 1978 |
| Methods of computing values of polynomials VY Pan RuMaS 21 (1), 105-136, 1966 | 147 | 1966 |
| Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations DA Bini, L Gemignani, VY Pan Numerische Mathematik 100 (3), 373-408, 2005 | 130 | 2005 |
| Complexity of parallel matrix computations V Pan Theoretical Computer Science 54 (1), 65-85, 1987 | 125 | 1987 |
