Publications

  1. Implications of Forbidden Structures for Extremal Algorithmic Problems, with K. Lieberherr, Journal of Theoretical Computer Science, 40 (1985), 195-210.
  2. Security, Verifiability, and Universality in Distributed Computing, with S.H. Teng, Journal of Algorithms, 11 (1990), 492-521.
  3. Factorization of Polynomials over Finite Fields and Decomposition of Primes in Algebraic Number Fields, Journal of Algorithms, 12 (1991), 482-489.
  4. Generalized Riemann Hypothesis and Factoring Polynomials over Finite Fields, Journal of Algorithms, 12 (1991), 464-481.
  5. Primality Testing and Two Dimensional Abelian Varieties over Finite Fields with L. M. Adleman, monograph in Springer-Verlag Lecture Note Series in Mathematics 1512 (142 pages), 1992.
  6. Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve, with D. Ierardi, Journal of Symbolic Computation, 18 (1994), 519-539.
  7. Efficient Program Checkers for Number Theoretical Computations, with L. M. Adleman and K. Kompella, Information and Computation, 121, (1995), 93-102.
  8. Quantum Computability, with L.M. Adleman and J. DeMarrais, Siam J. Computing, 26,(1997), 1523-1539
  9. Counting Points on Curves over Finite Fields, with D. Ierardi, Journal of Symbolic Computation, 25, (1998), 1-21.
  10. Solving Polynomials by Radicals with Roots of Unity in Minimum Depth, with G. Horng, to appear in Mathematics of Computation.
  11. A Subexponential Algorithm for Discrete Logarithms over the Jacobians of Large Genus Hyperelliptic Curves over GF(p), with L.M. Adleman and J, DeMarrais, to appear in Journal of Theoretical Computer Science.
  12. A Function Field Sieve Method for Discrete Logarithms over Finite Fields, with L.M. Adleman, to appear in Journal of Information and Computation.
  13. Solvability of Systems of Polynomial Congruences Modulo a Large Prime, with Y.C. Wong, provisionally accepted by J. Computational Complexity.
  14. Some Computational Problems of Cryptographic Significance Concerning Elliptic Curves over Rings, with C. Xing, to appear in Journal of Information and Computation.