 | 2006 |
|---|
| 8 |       | Paul W. K. Rothemund:
Scaffolded DNA Origami: from Generalized Multicrossovers to Polygonal Networks.
Nanotechnology: Science and Computation 2006: 3-21 |
| 2005 |
|---|
| 7 |  | Paul W. K. Rothemund:
Design of DNA origami.
ICCAD 2005: 471-478 |
| 2003 |
|---|
| 6 | | Matthew Cook,
Paul W. K. Rothemund,
Erik Winfree:
Self-Assembled Circuit Patterns.
DNA 2003: 91-107 |
| 2002 |
|---|
| 5 | | 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 |
| 2000 |
|---|
| 4 | | Ravinderjit S. Braich,
Cliff Johnson,
Paul W. K. Rothemund,
Darryl Hwang,
Nickolas V. Chelyapov,
Leonard M. Adleman:
Solution of a Satisfiability Problem on a Gel-Based DNA Computer.
DNA Computing 2000: 27-42 |
| 3 | | Paul W. K. Rothemund,
Erik Winfree:
The program-size complexity of self-assembled squares (extended abstract).
STOC 2000: 459-468 |
| 1999 |
|---|
| 2 | | Leonard M. Adleman,
Paul W. K. Rothemund,
Sam T. Roweis,
Erik Winfree:
On Applying Molecular Computation to the Data Encryption Standard.
Journal of Computational Biology 6(1): 53-64 (1999) |
| 1998 |
|---|
| 1 | | Sam T. Roweis,
Erik Winfree,
Richard Burgoyne,
Nickolas V. Chelyapov,
Myron F. Goodman,
Paul W. K. Rothemund,
Leonard M. Adleman:
A Sticker-Based Model for DNA Computation.
Journal of Computational Biology 5(4): 615-630 (1998) |
