- DIMACS Technical Report 200118 Short containers in Cayley graphs
- PRIMARY DECOMPOSITION OF ZERO-DIMENSIONAL IDEALS OVER FINITE FIELDS
- DIMACS Technical Report 200118 Short containers in Cayley graphs
- OBNER BASES AND GENERALIZED PAD APPROXIMATION
- HENSEL LIFTING AND BIVARIATE POLYNOMIAL FACTORISATION OVER FINITE FIELDS
- A NEW ALGORITHM FOR DECODING REEDSOLOMON CODES SHUHONG GAO
- Approximate Factorization of Multivariate Polynomials via Differential Equations*
- COMPUTING ROOTS OF POLYNOMIALS OVER FUNCTION FIELDS SHUHONG GAO AND M. AMIN SHOKROLLAHI
- FACTORING MULTIVARIATE POLYNOMIALS VIA PARTIAL DIFFERENTIAL EQUATIONS
- IRREDUCIBILITY OF POLYNOMIALS MODULO p VIA NEWTON POLYTOPES
- ABSOLUTE IRREDUCIBILITY OF POLYNOMIALS VIA NEWTON POLYTOPES
- GAUSS PERIODS: ORDERS AND CRYPTOGRAPHICAL APPLICATIONS
- Construction and Distribution Problems for Irreducible Trinomials over Finite Fields 1
- On the deterministic complexity of factoring polynomials +
- Fast Absolute Irreducibility Testing via Newton Polytopes #
- Associative rational functions in two variables # Joel V. Brawley 1 , Shuhong Gao 1 and Donald Mills 2
- Random Krylov spaces over finite fields # Richard P. Brent + , Shuhong Gao # and Alan G.B. Lauder
- Decomposition of polytopes and polynomials # Shuhong Gao 1 and Alan Lauder 2
- OBNER BASIS STRUCTURE OF FINITE SETS OF POINTS SHUHONG GAO, VIRG INIA M. RODRIGUES, AND JEFFREY STROOMER
- IRREDUCIBLE POLYNOMIALS OF GIVEN FORMS SHUHONG GAO, JASON HOWELL, AND DANIEL PANARIO
- A GENERAL POLYNOMIAL SIEVE SHUHONG GAO AND JASON HOWELL
- ABELIAN GROUPS, GAUSS PERIODS, AND NORMAL SHUHONG GAO
- COMPUTING GR OBNER BASES FOR VANISHING IDEALS OF
- Density of Normal Elements Shuhong Gao
- ON DENSITY OF PRIMITIVE ELEMENTS FOR FIELD EXTENSIONS
- Factoring Polynomials via Polytopes Fatima Abu Salem
- Mathematical Models in PublicKey Cryptology
- OBNER BASES, PAD E APPROXIMATION, AND DECODING
- ABELIAN GROUPS, GAUSS PERIODS, AND NORMAL SHUHONG GAO
- Tests and Constructions of Irreducible Polynomials over Finite Fields
- FACTORING MULTIVARIATE POLYNOMIALS VIA PARTIAL DIFFERENTIAL EQUATIONS
- DIMACS Technical Report 2001-18 Short containers in Cayley graphs
- Linked Graphs with Restricted Lengths Guantao Chena,b
- MULTIVARIATE PUBLIC KEY CRYPTOSYSTEMS FROM DIOPHANTINE EQUATIONS
- Specific Irreducible Polynomials with Linearly Independent Roots over Finite Fields
- A New Incremental Algorithm for Computing Groebner Bases
- Finite Field Multiplier Using Redundant Representation
- Decomposition of polytopes and polynomials Shuhong Gao1
- COMPUTING GROBNER BASES FOR VANISHING IDEALS OF FINITE SETS OF POINTS
- A NEW ALGORITHM FOR COMPUTING GROBNER BASES SHUHONG GAO, FRANK VOLNY IV, AND MINGSHENG WANG
- Approximate Factorization of Multivariate Polynomials via Differential Equations*
- GROBNER BASES AND GENERALIZED PADE APPROXIMATION
- Article Submitted to Journal of Symbolic Computation Deterministic distinct-degree factorisation
- ON DENSITY OF PRIMITIVE ELEMENTS FOR FIELD EXTENSIONS
- IRREDUCIBLE POLYNOMIALS OF GIVEN FORMS SHUHONG GAO, JASON HOWELL, AND DANIEL PANARIO
- From Hall's matching theorem to optimal routing on Shuhong Gao
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. X, NO. X, XXXXXXX 20XX 1 Additive Fast Fourier Transforms over Finite Fields
- Random Krylov spaces over finite fields Richard P. Brent
- Designs, Codes and Cryptogrphy 2 (1992), 315-323. Optimal normal bases
- PRIMARY DECOMPOSITION OF ZERO-DIMENSIONAL IDEALS OVER FINITE FIELDS
- A GENERAL POLYNOMIAL SIEVE SHUHONG GAO AND JASON HOWELL
- A NEW ALGORITHM FOR DECODING REED-SOLOMON CODES SHUHONG GAO
- HENSEL LIFTING AND BIVARIATE POLYNOMIAL FACTORISATION OVER FINITE FIELDS
- Fast Absolute Irreducibility Testing via Newton Polytopes
- Normal and Self-dual Normal Bases from Factorization of cxq+1
- doi:10.1006/jsco.1999.0309 Available online at http://www.idealibrary.com on IDEAL
- On the deterministic complexity of factoring polynomials
- ELEMENTS OF PROVABLE HIGH ORDERS IN FINITE FIELDS SHUHONG GAO
- Mathematical Models in Public-Key Cryptology
- On Orders of Optimal Normal Basis Generators Shuhong Gao
- IRREDUCIBILITY OF POLYNOMIALS MODULO p VIA NEWTON POLYTOPES
- Associative rational functions in two variables Joel V. Brawley1
- On Non-Abelian Group Difference Sets1 Shuhong Gao
- Factoring Polynomials via Polytopes Fatima Abu Salem
- FAULT TOLERANCE OF CAYLEY GRAPHS SHUHONG GAO AND BETH NOVICK
- GROBNER BASES, PADE APPROXIMATION, AND DECODING OF LINEAR CODES
- ABSOLUTE IRREDUCIBILITY OF POLYNOMIALS VIA NEWTON POLYTOPES
- COMPUTING ROOTS OF POLYNOMIALS OVER FUNCTION FIELDS SHUHONG GAO AND M. AMIN SHOKROLLAHI
- GROBNER BASIS STRUCTURE OF FINITE SETS OF POINTS SHUHONG GAO, VIRGINIA M. RODRIGUES, AND JEFFREY STROOMER
- Bases of Minimum-Weight Vectors for Codes from Designs S. Gao and J. D. Key
- Dynamics of f(x) = x + x-1 via Elliptic Curves
- Explicit Factorization of x2k over Fp with Prime p 3 mod 4
- Solving the 100 Swiss Francs Problem Mingfu Zhu, Guangran Jiang and Shuhong Gao
