Refereed Conference Proceedings

  1. Toward an $\epsilon$-Approximation Scheme for Generalized Satisfiability, with K. Lieberherr, Proceedings of 1982 Princeton Conference on Information Sciences and Syetems (1982), 268-273.
  2. A Hierarchical Compaction Algorithm with Low Page-Fault omplexity, with K. Steiglitz, Proc. MIT Conference on Advanced Research in VLSI} (1984), 203-212.
  3. On a Simple Primality Testing Algorithm, Proc. 1984 International Symposium on Symbolic and Algebraic Computation (1984), 321-332.
  4. Factorization of Polynomials over Finite Fields and Factorization of Primes in Algebraic Number Fields, Proc. 16th Annual ACM Symposium on Theory of Computing (1984),175-182.
  5. Riemann Hypothesis and Finding Roots over Finite Fields, Proc. 17th Annual ACM Symposium on Theory of Computing (1985), 175-182.
  6. Solving Some Graph Problems with Optimal or Near-Optimal Speedup on Mesh-of-Trees Networks, Proc. 26th Annual IEEE Symposium on the Foundations of Computer Science (1985), 232-240. (
  7. Recognizing Primes in Random Polynomial Time, with L.M. Adleman, Proc. 19th ACM Symposium on Theory of Computing} (1987), 462-469.
  8. Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection Networks, with A. Aggarwal,Proc. 1988 Aegean Workshop on Computing: 3rd International Workshop on Parallel Computation and VLSI Theory.
  9. Secure and Verifiable Schemes for Election and General Distributed Computing Problems, with S.H. Teng, Proc. 7th Annual ACM Symp. on Principles of Distributed Computing (1988), 182-196.
  10. A Universal Problem in Secure and Verifiable Distributed Computation, with S.H. Teng, 1988 CRYPTO Conference
  11. Simplifying Nested Radicals and Solving Polynomials by Radicals in Minimum Depth, with Gwoboa Horng, Proc. 31st IEEE Annual Symp. on Foundations of Computer Science (1990), 847-856.
  12. Efficient Algorithms for the Riemann-Roch Problem and Addition in the Jacobian of a Curve with Applications, with D. Ierardi, Proc. 32nd IEEE Annual Symp. on Foundations of Computer Science (1991), 678-687.
  13. Counting Rational Points on Curves over Finite Fields, with D. Ierardi Proc. 34th IEEE Annual Symp. on Foundations of Computer Science (1993), 616-625.
  14. A Subexponential Algorithm for Discrete Logarithms over the Rational Subgroup of the Jacobian of Large Genus Hyperelliptic Curves over Finite Fields, with L.M. Adleman and J, DeMarrais, Proc. First Int'l Symp. on Algorithmic Number Theory (ANTS-I)(1994), 28-40.
  15. Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications, with A.J. Rao, Proc. 7th ACM-SIAM Symp. on Discrete Algorithms(SODA), (1996), 508-517.
  16. Counting Rational Points on Curves and Abelian Varieties over Finite Fields, with L.M. Adleman, Proc. Second Int'l Algorithmic Number Theory Symposium (ANTS II), (1996), 1-16.
  17. Solving Systems of Polynomial Congruences Modulo a Large Prime, with Y.C. Wong, Proc. 37th IEEE Annual Symp. on Foundations of Computer Science (1996), 115-124.
  18. Extended Hilbert Irreducibility and Applications, with Y.C. Wong, Proc. 9th ACM-SIAM Symp. on Discrete Algorithms (SODA), (1998), 50-58.
  19. A Black-Box Approach to the Algebraic Set Decomposition Problem, with A. Rao, to appear in Proc. 1998 ACM Symp. on Theory of Computing.
  20. An Algorithm for Approximate Counting of Points on Algebraic sets over Finite Fields, with Y.C. Wong, Proc. Third Int'l Symp. on Algorithmic Number Theory (ANTS-III), (1998).