| 2009 |
| 24 | EE | Jessica F. Burkhart,
Neil J. Calkin,
Shuhong Gao,
Justine C. Hyde-Volpe,
Kevin James,
Hiren Maharaj,
Shelly Manber,
Jared Ruiz,
Ethan Smith:
Finite field elements of high order arising from modular curves.
Des. Codes Cryptography 51(3): 301-314 (2009) |
| 2008 |
| 23 | EE | Guantao Chen,
Yuan Chen,
Shuhong Gao,
Zhiquan Hu:
Linked graphs with restricted lengths.
J. Comb. Theory, Ser. B 98(4): 735-751 (2008) |
| 2006 |
| 22 | EE | Jeffrey B. Farr,
Shuhong Gao:
Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points.
AAECC 2006: 118-127 |
| 2004 |
| 21 | EE | Shuhong Gao,
Erich Kaltofen,
John May,
Zhengfeng Yang,
Lihong Zhi:
Approximate factorization of multivariate polynomials via differential equations.
ISSAC 2004: 167-174 |
| 20 | EE | Fatima Abu Salem,
Shuhong Gao,
Alan G. B. Lauder:
Factoring polynomials via polytopes.
ISSAC 2004: 4-11 |
| 19 | EE | Shuhong Gao,
Erich Kaltofen,
Alan G. B. Lauder:
Deterministic distinct-degree factorization of polynomials over finite fields.
J. Symb. Comput. 38(6): 1461-1470 (2004) |
| 2003 |
| 18 | | Shuhong Gao:
Factoring multivariate polynomials via partial differential equations.
Math. Comput. 72(242): 801-822 (2003) |
| 17 | EE | Richard P. Brent,
Shuhong Gao,
Alan G. B. Lauder:
Random Krylov Spaces over Finite Fields.
SIAM J. Discrete Math. 16(2): 276-287 (2003) |
| 2002 |
| 16 | EE | Huapeng Wu,
M. Anwarul Hasan,
Ian F. Blake,
Shuhong Gao:
Finite Field Multiplier Using Redundant Representation.
IEEE Trans. Computers 51(11): 1306-1316 (2002) |
| 15 | | Shuhong Gao,
Alan G. B. Lauder:
Hensel lifting and bivariate polynomial factorisation over finite fields.
Math. Comput. 71(240): 1663-1676 (2002) |
| 2001 |
| 14 | EE | Shuhong Gao,
Alan G. B. Lauder:
Decomposition of Polytopes and Polynomials.
Discrete & Computational Geometry 26(1): 89-104 (2001) |
| 13 | | Shuhong Gao:
On the Deterministic Complexity of Factoring Polynomials.
J. Symb. Comput. 31(1/2): 19-36 (2001) |
| 2000 |
| 12 | | Shuhong Gao,
Joachim von zur Gathen,
Daniel Panario,
Victor Shoup:
Algorithms for Exponentiation in Finite Fields.
J. Symb. Comput. 29(6): 879-889 (2000) |
| 1999 |
| 11 | | Shuhong Gao,
Jason Howell:
A General Polynomial Sieve.
Des. Codes Cryptography 18(1/3): 149-157 (1999) |
| 1998 |
| 10 | EE | Shuhong Gao,
Beth Novick,
Ke Qiu:
From Hall's Matching Theorem to Optimal Routing on Hypercubes.
J. Comb. Theory, Ser. B 74(2): 291-301 (1998) |
| 9 | | Shuhong Gao,
Joachim von zur Gathen,
Daniel Panario:
Gauss periods: orders and cryptographical applications.
Math. Comput. 67(221): 343-352 (1998) |
| 1995 |
| 8 | | Shuhong Gao,
Joachim von zur Gathen,
Daniel Panario:
Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract).
LATIN 1995: 311-322 |
| 1994 |
| 7 | | Shuhong Gao,
Scott A. Vanstone:
On orders of optimal normal basis generators.
ANTS 1994: 220 |
| 6 | EE | Ian F. Blake,
Shuhong Gao,
Ronald C. Mullin:
Normal and Self-dual Normal Bases from Factorization of c xq+1 + d xq - ax - b.
SIAM J. Discrete Math. 7(3): 499-512 (1994) |
| 1993 |
| 5 | | Ian F. Blake,
Shuhong Gao,
Robert J. Lambert:
Constructive problems for irreducible polynominals over finite fields.
Information Theory and Applications 1993: 1-23 |
| 4 | | Ian F. Blake,
Shuhong Gao,
Ronald C. Mullin:
Explicit Factorization of x2k + 1 over Fp with Prime p= 3 mod 4.
Appl. Algebra Eng. Commun. Comput. 4: 89-94 (1993) |
| 3 | EE | Shuhong Gao,
Wan-Di Wei:
On non-Abelian group difference sets.
Discrete Mathematics 112(1-3): 93-102 (1993) |
| 2 | EE | Wan-Di Wei,
Shuhong Gao,
Benfu Yang:
Cyclic near difference sets of type 1.
Discrete Mathematics 123(1-3): 151-177 (1993) |
| 1992 |
| 1 | | Shuhong Gao,
Hendrik W. Lenstra Jr.:
Optimal Normal Bases.
Des. Codes Cryptography 2(4): 315-323 (1992) |