The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ming-Deh A. Huang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.215secs, Finished in 0.217secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002