Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Huang, Ming-Deh"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Partial lifting and the elliptic curve discrete logarithm problem
Qi Cheng
,
Ming-Deh Huang
Algorithmica
46
(1), 2006, pp. 59-68
Signature calculus and discrete logarithm problems
Ming-Deh Huang
,
Wayne Raskind
Lecture Notes in Computer Science
4076
, 2006, pp. 558-572
On counting and generating curves over small finite fields
Qi Cheng
,
Ming-Deh Huang
Journal of Complexity
20
(2-3), 2004, pp. 284-296
On partial lifting and the elliptic curve discrete logarithm problem
Qi Cheng
,
Ming-Deh Huang
Lecture Notes in Computer Science
3341
, 2004, pp. 342-351
Combinatorial optimization problems in self-assembly
Leonard Adleman
,
Qi Cheng
,
Ashish Goel
,
Ming-Deh Huang
,
David Kempe
,
Pablo Moisset de Espanés
,
Paul Wilhelm Karl Rothemund
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 23-32
Running time and program size for self-assembled squares
Leonard Adleman
,
Qi Cheng
,
Ashish Goel
,
Ming-Deh Huang
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 740-748
Counting points on curves and Abelian varieties over finite fields
Leonard M. Adleman
,
Ming-Deh Huang
Journal Symbolic Computation
32
(3), 2001, pp. 171-189
Factoring polynomials over finite fields and stable colorings of tournaments
Qi Cheng
,
Ming-Deh A. Huang
Lecture Notes in Computer Science
1838
, 2000, pp. 233-245
Lifting elliptic curves and solving the elliptic curve discrete logarithm problem
Ming-Deh A. Huang
,
Ka Lam Kueh
,
Ki-Seng Tan
Lecture Notes in Computer Science
1838
, 2000, pp. 377-384
Extended Hilbert irreducibility and its applications
Ming-Deh Huang
,
Yiu-Chung Wong
Journal of Algorithms
37
(1), 2000, pp. 121-145
A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over
GF(q)
Leonard M. Adleman
,
Jonathan DeMarrais
,
Ming-Deh Huang
Theoretical Computer Science
226
(1-2), 1999, pp. 7-18
Function field sieve method for discrete logarithms over finite fields
Leonard M. Adleman
,
Ming-Deh A. Huang
Information and Computation
151
(1-2), 1999, pp. 5-16
Interpolation of sparse multivariate polynomials over large finite fields with applications
Ming-Deh A. Huang
,
Ashwin J. Rao
Journal of Algorithms
33
(2), 1999, pp. 204-228
Some computational problems of cryptographic significance concerning elliptic curves over rings
Ming-Deh A. Huang
,
Chaoping Xing
Information and Computation
151
(1-2), 1999, pp. 92-99
Counting points on curves over finite fields
Ming-Deh Huang
,
Doug Ierardi
Journal Symbolic Computation
25
(1), 1998, pp. 1-21
A black box approach to the algebraic set decomposition problem
Ming-Deh A. Huang
,
Ashwin J. Rao
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 497-506
An algorithm for approximate counting of points on algebraic sets over finite fields
Ming-Deh Huang
,
Yiu-Chung Wong
Lecture Notes in Computer Science
1423
, 1998, pp. 514-527
Extended Hilbert irreducibility and its applications
Ming-Deh Huang
,
Yiu-Chung Wong
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 50-58
Quantum computability
Leonard M. Adleman
,
Jonathan Demarrais
,
Ming-Deh A. Huang
SIAM Journal on Computing
26
(5), 1997, pp. 1524-1540
Counting rational points on curves and Abelian varieties over finite fields
Leonard M. Adleman
,
Ming-Deh A. Huang
Lecture Notes in Computer Science
1122
, 1996, pp. 1-16
Interpolation of sparse multivariate polynomials over large finite fields with applications
Ming-Deh A. Huang
,
Ashwin J. Rao
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 508-517
Solving systems of polynomial congruences modulo a large prime
Ming-Deh Huang
,
Yiu-Chung Wong
Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, FOCS'96 (Burlington, Vermont, October 14-16, 1996)
, 1996, pp. 115-124
Efficient checkers for number-theoretic computations
Leonard M. Adleman
,
Ming-Deh Huang
,
Kireeti Kompella
Information and Computation
121
(1), 1995, August, pp. 93-102
A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields
Leonard M. Adleman
,
Jonathan DeMarrais
,
Ming-Deh Huang
Proceedings of the 1st International Symposium, ANTS-I. Algorithmic Number Theory (Ithaca, NY, USA, May 6-9, 1994)
LNCS 877
, 1994, pp. 28-40
Efficient checking of computations in number theory
Leonard M. Adleman
,
Ming-Deh Huang
,
Kireeti Kompella
Proceedings of the 1st International Symposium, ANTS-I. Algorithmic Number Theory (Ithaca, NY, USA, May 6-9, 1994)
LNCS 877
, 1994, pp. 249
Seiten 1
2
3
>