Recent Papers

  1. Running time and program size for self-assembled squares, with L. Adleman and Q. Cheng and A. Goel, ACM Symp. on Theoey of Computing (STOC), 2001. Pdf Version.
  2. Linear Self-Assemblies: Equilibria, Entropy, and Convergence Rates, with L. Adleman, Q. Cheng, A. Goel, and H. Wasserman, Proc. 6th International Conference on Difference Equations and Applications (ICDEA). Pdf Version.
  3. Combinatorial optimization problems in self-assembly, with L. Adleman, Q. Cheng, A. Goel, D. Kempe, P. Moisset, and P. Rothemund, Proc. ACM Symp. on Theory of Computing (STOC), 2002. Pdf Version.
  4. On counting and generating curves over small finite fields, with Q. Cheng, J. Complexity, 20/2-3, (2004), 284-296. Pdf Version.
  5. Deciding whether the p-torsion group of the Qp-rational points of an elliptic curve is non-trivial, with I. Burhanuddin, ACM SIGSAM Bulletin, Vol 38, No. 3, 96-98, 2004.
  6. Invadable Self-Assembly: Combinig Robustness with Efficiency, with H. Chen Q. Cheng, A. Goel, and P. Moisset, Proc. ACM-SIAM Symposium on Discrete Algorithms, 890-899, 2004.Pdf Version.
  7. On partial lifting and the elliptic curve discrete logarithm problem, with Q. Cheng, Proc.15th Annual Symposium on Algorithms and Computation (ISAAC) 2004. Pdf Version of the full paper.
  8. Factoring Polynomials over Large Finite Fields and Stable Coloring of Tournaments, with Q. Cheng, preprint.
  9. Global Methods for Discrete Logarithm Problems, I, II and III, with W. Raskind, preprints, 2006 Pdf Version of I. Pdf Version of II.Pdf Version of III.
  10. Finding positive solutions of algebraic systems with application to algorithmic self-assembly and chemical reaction networks, with Q. Luo, preprint, 2005.
  11. On computing rational torsion on elliptic curves, with I. Burhanuddin, preprint, 2005.