#### Filter Results:

- Full text PDF available (27)

#### Publication Year

1974

2012

- This year (0)
- Last 5 years (4)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

Learn More

- Ronald L. Rivest, Adi Shamir, Leonard M. Adleman
- Commun. ACM
- 1978

An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intented… (More)

- L M Adleman
- Science
- 1994

The tools of molecular biology were used to solve an instance of the directed Hamiltonian path problem. A small graph was encoded in molecules of DNA, and the "operations" of the computation were performed with standard protocols and enzymes. This experiment demonstrates the feasibility of carrying out computations at the molecular level.

- 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 generalization of the Tile Assembly Model defined in [6]. In the generalized model, the Rothemund-Winfree construction of <italic>n \times n</italic> squares… (More)

- Sam T. Roweis, Erik Winfree, +4 authors Leonard M. Adleman
- Journal of Computational Biology
- 1996

We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which information is represented and of separation by hybridization as a central mechanism. However, unlike previous models, the stickers model has a random access memory that requires no… (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 circuit fabrication, nano-robotics, DNA computation, and amorphous computing. In this paper, we study two combinatorial optimization problems related to… (More)

- Leonard M. Adleman
- FOCS
- 1994

A 20-variable instance of the NP-complete three-satisfiability (3-SAT) problem was solved on a simple DNA computer. The unique answer was found after an exhaustive search of more than 1 million (2(20)) possibilities. This computational problem may be the largest yet solved by nonelectronic means. Problems of this size appear to be beyond the normal range of… (More)

- Leonard M. Adleman
- DNA Based Computers
- 1995

It has recently been suggested that under some circumstances computers based on molecular interactions may be a viable alternative to computers based on electronics. Here, some practical aspects of constructing a molecular computer are considered.

- Ravinderjit S. Braich, Cliff Johnson, Paul W. K. Rothemund, Darryl Hwang, Nickolas V. Chelyapov, Leonard M. Adleman
- DNA Computing
- 2000

- 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 and to a lesser extent algebraic and analytic number theory. The result complements the well known result of Strassen and Soloway that there exists a random… (More)