Search the dblp DataBase

Publications of Author

1. 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. [Citation Graph (0, 0)][DBLP]
   DNA Computing, 2000, pp:27-42 [Conf]
   
2. Matthew Cook, Paul W. K. Rothemund, Erik Winfree
   Self-Assembled Circuit Patterns. [Citation Graph (0, 0)][DBLP]
   DNA, 2003, pp:91-107 [Conf]
   
3. Paul W. K. Rothemund
   Design of DNA origami. [Citation Graph (0, 0)][DBLP]
   ICCAD, 2005, pp:471-478 [Conf]
   
4. 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]
   
5. Paul W. K. Rothemund, Erik Winfree
   The program-size complexity of self-assembled squares (extended abstract). [Citation Graph (0, 0)][DBLP]
   STOC, 2000, pp:459-468 [Conf]
   
6. Leonard M. Adleman, Paul W. K. Rothemund, Sam T. Roweis, Erik Winfree
   On Applying Molecular Computation to the Data Encryption Standard. [Citation Graph (0, 0)][DBLP]
   Journal of Computational Biology, 1999, v:6, n:1, pp:53-64 [Journal]
   
7. 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. [Citation Graph (0, 0)][DBLP]
   Journal of Computational Biology, 1998, v:5, n:4, pp:615-630 [Journal]
   
8. 
   Scaffolded DNA Origami: from Generalized Multicrossovers to Polygonal Networks. [Citation Graph (, )][DBLP]