| A new algorithm for decoding Reed-Solomon codes S Gao Communications, information and network security, 55-68, 2003 | 230 | 2003 |
| Normal bases over finite fields. S Gao University of Waterloo, 1993 | 179 | 1993 |
| Factoring multivariate polynomials via partial differential equations S Gao Mathematics of computation 72 (242), 801-822, 2003 | 173 | 2003 |
| Optimal normal bases S Gao, HW Lenstra Jr Designs, Codes and Cryptography 2 (4), 315-323, 1992 | 169 | 1992 |
| Finite field multiplier using redundant representation H Wu, MA Hasan, IF Blake, S Gao IEEE Transactions on Computers 51 (11), 1306-1316, 2002 | 153 | 2002 |
| Absolute irreducibility of polynomials via Newton polytopes S Gao Journal of Algebra 237 (2), 501-520, 2001 | 134 | 2001 |
| Algorithms for exponentiation in finite fields S Gao, D Panario, V Shoup Journal of Symbolic Computation 29 (6), 879-889, 2000 | 118 | 2000 |
| A new incremental algorithm for computing Gröbner bases S Gao, Y Guan, F Volny IV Proceedings of the 2010 International Symposium on Symbolic and Algebraic …, 2010 | 115 | 2010 |
| Approximate factorization of multivariate polynomials via differential equations S Gao, E Kaltofen, J May, Z Yang, L Zhi Proceedings of the 2004 international symposium on Symbolic and algebraic …, 2004 | 108 | 2004 |
| On orders of optimal normal basis generators S Gao, SA Vanstone Mathematics of Computation 64 (211), 1227-1233, 1995 | 101 | 1995 |
| Additive fast Fourier transforms over finite fields S Gao, T Mateer IEEE Transactions on Information Theory 56 (12), 6265-6272, 2010 | 96 | 2010 |
| Decomposition of polytopes and polynomials S Gao, AGB Lauder Discrete & Computational Geometry 26, 89-104, 2001 | 93 | 2001 |
| Explicit factorization of+ 1 over F p with prime p≡ 3 mod 4 IF Blake, S Gao, RC Mullin Applicable Algebra in Engineering, Communication and Computing 4 (2), 89-94, 1993 | 78 | 1993 |
| Tests and constructions of irreducible polynomials over finite fields S Gao, D Panario Foundations of Computational Mathematics: Selected Papers of a Conference …, 1997 | 76 | 1997 |
| Elements of provable high orders in finite fields S Gao Proceedings of the American Mathematical Society 127 (6), 1615-1623, 1999 | 74 | 1999 |
| Gauss periods and fast exponentiation in finite fields S Gao, J von zur Gathen, D Panario LATIN'95: Theoretical Informatics: Second Latin American Symposium …, 1995 | 69 | 1995 |
| A new framework for computing Gröbner bases S Gao, F Volny IV, M Wang Mathematics of computation 85 (297), 449-465, 2016 | 67 | 2016 |
| Computing roots of polynomials over function fields of curves S Gao, MA Shokrollahi Coding theory and cryptography: from enigma and Geheimschreiber to quantum …, 2000 | 62 | 2000 |
| Gauss periods: orders and cryptographical applications S Gao, J Von Zur Gathen, D Panario Mathematics of Computation 67 (221), 343-352, 1998 | 56 | 1998 |
| Random Krylov spaces over finite fields RP Brent, S Gao, AGB Lauder SIAM Journal on Discrete Mathematics 16 (2), 276-287, 2003 | 55 | 2003 |
Daqing WanUniversity of California, Irvine在 math.uci.edu 的电子邮件经过验证
