Searching for:
Found 49 results
sorted by:
Pages: 1 2 3 ... 5
Ronald L. Rivest, Adi Shamir, Leonard M. Adleman : A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Commun. ACM (CACM) 21(2):120-126 (1978)
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang : Running time and program size for self-assembled squares. STOC 2001
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 (JCB) 6(1):53-63 (1999)
Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus : On the Decidability of Self-Assembly of Infinite Ribbons. FOCS 2002
Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus, Petr Sosík : The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly. SIAM J. Comput. (SIAMCOMP) 38(6):2356-2381 (2009)
Leonard M. Adleman, Ming-Deh A. Huang : Counting Points on Curves and Abelian Varieties Over Finite Fields. J. Symb. Comput. (JSC) 32(3):171-189 (2001)
(search: 0.118 sec. - facets: 0.0 sec.) (?)
Pages: 1 2 3 ... 5

Refine by VENUE:

show:

Refine by YEAR:

show:
[No canvas support]