#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1982

2018

- This year (5)
- Last 5 years (8)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang
- STOC
- 2001

Recently Rothemund and Winfree [6] have considered the program size complexity of constructing squares by self-assembly. Here, we consider the time complexity of such constructions using a natural… (More)

- Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang
- SIAM J. Comput.
- 1997

In this paper some theoretical and (potentially) practical aspects of quantum computing are considered. Using the tools of transcendental number theory it is demonstrated that quantum Turing machines… (More)

- Leonard M. Adleman, Qi Cheng, +4 authors Paul W. K. Rothemund
- STOC
- 2002

Self-assembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate self-assembly processes will ultimately be used in… (More)

- Leonard M. Adleman, Ming-Deh A. Huang
- STOC
- 1987

This paper is the first in a sequence of papers which will prove the existence of a random polynomial time algorithm for the set of primes. The techniques used are from arithmetic algebraic geometry… (More)

- Leonard M. Adleman, Ming-Deh A. Huang
- Inf. Comput.
- 1999

Let Fpn denote the finite field of p elements, where p is a prime. Let x be a generator for the multiplicative group of Fpn . The discrete logarithm problem over Fpn is to compute, for any given… (More)

- Leonard M. Adleman, Ming-Deh A. Huang
- J. Symb. Comput.
- 2001

Self-assembly is a ubiquitous process by which objects autonomously assemble into complexes. In the context of computation, self-assembly is important to both DNA computing and amorphous computing.… (More)

- Ming-Deh A. Huang
- J. Algorithms
- 1991