1. Fatima Abu Salem, Shuhong Gao, and Alan G. B. Lauder, Factoring polynomials via polytopes, ISSAC 2004, ACM, New York, 2004, pp. 4–11.[MR]
  2. Jessica F. Burkhart, Neil J. Calkin, Shuhong Gao, Justine C. Hyde-Volpe, Kevin James, Hiren Maharaj, Shelly Manber, Jared Ruiz, and Ethan Smith, Finite field elements of high order arising from modular curves, Des. Codes Cryptogr. 51 (2009), no. 3, 301–314.[MR/doi]
  3. Jeffrey B. Farr and Shuhong Gao, Computing Gröbner bases for vanishing ideals of finite sets of points, Applied Algebra, Algebraic Algorithms and Error-correcting Codes, Lecture Notes in Comput. Sci., vol. 3857, Springer, Berlin, 2006, pp. 118–127.[MR]
  4. Jeffrey B. Farr and Shuhong Gao, Gröbner bases and generalized Padé approximation, Math. Comp. 75 (2006), no. 253, 461–473 (electronic).[MR]
  5. S. Gao and J. D. Key, Bases of minimum-weight vectors for codes from designs, Finite Fields Appl. 4 (1998), no. 1, 1–15.[MR]
  6. Shuhong Gao, Guangran Jiang, and Mingfu Zhu, Solving the 100 Swiss Francs problem, preprint (2008), 16 pages.[arXiv]
  7. Shuhong Gao, Daqing Wan, and Mingsheng Wang, Primary decomposition of zero-dimensional ideals over finite fields, Math. Comp. 78 (2009), no. 265, 509–521.[MR/link]