| 2006 |
|---|
| 45 | EE | Ming-Deh A. Huang,
Wayne Raskind:
Signature Calculus and Discrete Logarithm Problems.
ANTS 2006: 558-572 |
| 44 | EE | Qi Cheng,
Ming-Deh A. Huang:
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem.
Algorithmica 46(1): 59-68 (2006) |
| 2004 |
|---|
| 43 | EE | Qi Cheng,
Ming-Deh A. Huang:
On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem.
ISAAC 2004: 342-351 |
| 42 | EE | Ho-Lin Chen,
Qi Cheng,
Ashish Goel,
Ming-Deh A. Huang,
Pablo Moisset de Espanés:
Invadable self-assembly: combining robustness with efficiency.
SODA 2004: 890-899 |
| 41 | EE | Qi Cheng,
Ming-Deh A. Huang:
On counting and generating curves over small finite fields.
J. Complexity 20(2-3): 284-296 (2004) |
| 2002 |
|---|
| 40 | EE | Leonard M. Adleman,
Qi Cheng,
Ashish Goel,
Ming-Deh A. Huang,
David Kempe,
Pablo Moisset de Espanés,
Paul W. K. Rothemund:
Combinatorial optimization problems in self-assembly.
STOC 2002: 23-32 |
| 2001 |
|---|
| 39 | EE | Leonard M. Adleman,
Qi Cheng,
Ashish Goel,
Ming-Deh A. Huang:
Running time and program size for self-assembled squares.
STOC 2001: 740-748 |
| 38 | | Leonard M. Adleman,
Ming-Deh A. Huang:
Counting Points on Curves and Abelian Varieties Over Finite Fields.
J. Symb. Comput. 32(3): 171-189 (2001) |
| 2000 |
|---|
| 37 | | Qi Cheng,
Ming-Deh A. Huang:
Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments.
ANTS 2000: 233-246 |
| 36 | | Ming-Deh A. Huang,
Ka Lam Kueh,
Ki-Seng Tan:
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem.
ANTS 2000: 377-384 |
| 35 | | Ming-Deh A. Huang,
Yiu-Chung Wong:
Extended Hilbert Irreducibility and Its Applications.
J. Algorithms 37(1): 121-145 (2000) |
| 1999 |
|---|
| 34 | EE | Ming-Deh A. Huang,
Yiu-Chung Wong:
Solvability of systems of polynomial congruences modulo a large prime.
Computational Complexity 8(3): 227-257 (1999) |
| 33 | | Leonard M. Adleman,
Ming-Deh A. Huang:
Function Field Sieve Method for Discrete Logarithms over Finite Fields.
Inf. Comput. 151(1-2): 5-16 (1999) |
| 32 | | Ming-Deh A. Huang,
Chaoping Xing:
Some Computational Problems of Cryptographic Significance Concerning Elliptic Curves over Rings.
Inf. Comput. 151(1-2): 92-99 (1999) |
| 31 | | Ming-Deh A. Huang,
Ashwin J. Rao:
Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications.
J. Algorithms 33(2): 204-228 (1999) |
| 30 | | Gwoboa Horng,
Ming-Deh A. Huang:
Solving polynomials by radicals with roots of unity in minimum depth.
Math. Comput. 68(226): 881-885 (1999) |
| 29 | EE | Leonard M. Adleman,
Jonathan DeMarrais,
Ming-Deh A. Huang:
A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q).
Theor. Comput. Sci. 226(1-2): 7-18 (1999) |
| 1998 |
|---|
| 28 | EE | Ming-Deh A. Huang,
Yiu-Chung Wong:
An Algorithm for Approximate Counting of Points on Algebraic Sets over Finite Fields.
ANTS 1998: 514-527 |
| 27 | | Ming-Deh A. Huang,
Yiu-Chung Wong:
Extended Hilbert Irreducibility and its Applications.
SODA 1998: 50-58 |
| 26 | EE | Ming-Deh A. Huang,
Ashwin J. Rao:
A Black Box Approach to the Algebraic Set Decomposition Problem.
STOC 1998: 497-506 |
| 25 | | Ming-Deh A. Huang,
Doug Ierardi:
Counting Points on Curves over Finite Fields.
J. Symb. Comput. 25(1): 1-21 (1998) |
| 1997 |
|---|
| 24 | | Leonard M. Adleman,
Jonathan DeMarrais,
Ming-Deh A. Huang:
Quantum Computability.
SIAM J. Comput. 26(5): 1524-1540 (1997) |
| 1996 |
|---|
| 23 | | Leonard M. Adleman,
Ming-Deh A. Huang:
Counting Rational Points on Curves and Abelian Varieties over Finite Fields.
ANTS 1996: 1-16 |
| 22 | | Ming-Deh A. Huang,
Yiu-Chung Wong:
Solving Systems of Polynomial Congruences Modulo a Large Prime (extended abstract).
FOCS 1996: 115-124 |
| 21 | | Ming-Deh A. Huang,
Ashwin J. Rao:
Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications.
SODA 1996: 508-517 |
| 1995 |
|---|
| 20 | | Leonard M. Adleman,
Ming-Deh A. Huang,
Kireeti Kompella:
Efficient Checkers for Number-Theoretic Computations
Inf. Comput. 121(1): 93-102 (1995) |
| 1994 |
|---|
| 19 | | Leonard M. Adleman,
Ming-Deh A. Huang:
Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994, Proceedings
Springer 1994 |
| 18 | | Leonard M. Adleman,
Ming-Deh A. Huang,
Kireeti Kompella:
Efficient checking of computations in number theory.
ANTS 1994: 249 |
| 17 | | Leonard M. Adleman,
Jonathan DeMarrais,
Ming-Deh A. Huang:
A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields.
ANTS 1994: 28-40 |
| 16 | | Ming-Deh A. Huang,
Doug Ierardi:
Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve.
J. Symb. Comput. 18(6): 519-539 (1994) |
| 1993 |
|---|
| 15 | | Ming-Deh A. Huang,
Doug Ierardi:
Counting Rational Points on Curves over Finite Fields (Extended Abstract)
FOCS 1993: 616-625 |
| 1991 |
|---|
| 14 | | Ming-Deh A. Huang,
Doug Ierardi:
Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve (Extended Abstract)
FOCS 1991: 678-687 |
| 13 | | Ming-Deh A. Huang:
Generalized Riemann Hypothesis and Factoring Polynomials over Finite Fields.
J. Algorithms 12(3): 464-481 (1991) |
| 12 | | Ming-Deh A. Huang:
Factorization of Polynomials over Finite Fields and Decomposition of Primes in Algebraic Number Fields.
J. Algorithms 12(3): 482-489 (1991) |
| 1990 |
|---|
| 11 | | Gwoboa Horng,
Ming-Deh A. Huang:
Simplifying Nested Radicals and Solving Polynomials by Radicals in Minimum Depth
FOCS 1990: 847-856 |
| 10 | | Ming-Deh A. Huang,
Shang-Hua Teng:
Security, Verifiability, and Universality in Distributed Computing.
J. Algorithms 11(3): 492-521 (1990) |
| 1988 |
|---|
| 9 | | Alok Aggarwal,
Ming-Deh A. Huang:
Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection Networks.
AWOC 1988: 339-350 |
| 8 | EE | Ming-Deh A. Huang,
Shang-Hua Teng:
A Universal Problem in Secure and Verifiable Distributed Computation.
CRYPTO 1988: 336-352 |
| 7 | EE | Ming-Deh A. Huang,
Shang-Hua Teng:
Secure and Verifiable Schemes for Election and General Distributed Computing Problems.
PODC 1988: 182-196 |
| 1987 |
|---|
| 6 | | Leonard M. Adleman,
Ming-Deh A. Huang:
Recognizing Primes in Random Polynomial Time
STOC 1987: 462-469 |
| 1985 |
|---|
| 5 | | Ming-Deh A. Huang:
Solving Some Graph Problems with Optimal or Near-Optimal Speedup on Mesh-of-Trees Networks
FOCS 1985: 232-240 |
| 4 | | Ming-Deh A. Huang:
Riemann Hypothesis and Finding Roots over Finite Fields
STOC 1985: 121-130 |
| 3 | | Ming-Deh A. Huang,
Karl J. Lieberherr:
Implications of Forbidden Structures for Extremal Algorithmic Problems.
Theor. Comput. Sci. 40: 195-210 (1985) |
| 1984 |
|---|
| 2 | | Ming-Deh A. Huang:
On a Simple Primality Testing Algorithm.
EUROSAM 1984: 321-332 |
| 1 | | Ming-Deh A. Huang:
Factorization of Polynomials over Finite Fields and Factorization of Primes in Algebraic Number Fields
STOC 1984: 175-182 |
