Leonard M. Adleman

55 papers A* 27Journal 16Unranked 10

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Darwin Turing Dawkins: Building a General Theory of Evolution. CoRR Leonard M. Adleman
2012	—	`conf`	An Algorithmic View of the Universe. ACM-TURING Christos H. Papadimitriou, Leonard M. Adleman, Richard M. Karp, Donald E. Knuth, Robert E. Tarjan, Leslie G. Valiant
2009	J	`jnl`	The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly. SIAM J. Comput. Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus, Petr Sosík
2002	A*	`conf`	Combinatorial optimization problems in self-assembly. STOC Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espanés, Paul W. K. Rothemund
2002	A*	`conf`	On the Decidability of Self-Assembly of Infinite Ribbons. FOCS Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus
2001	J	`jnl`	Counting Points on Curves and Abelian Varieties Over Finite Fields. J. Symb. Comput. Leonard M. Adleman, Ming-Deh A. Huang
2001	A*	`conf`	Running time and program size for self-assembled squares. STOC Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang
2000	—	`conf`	Solution of a Satisfiability Problem on a Gel-Based DNA Computer. DNA Computing Ravinderjit S. Braich, Cliff Johnson, Paul W. K. Rothemund, Darryl Hwang, Nickolas V. Chelyapov, Leonard M. Adleman
1999	J	`jnl`	A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q). Theor. Comput. Sci. Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang
1999	J	`jnl`	Function Field Sieve Method for Discrete Logarithms over Finite Fields. Inf. Comput. Leonard M. Adleman, Ming-Deh A. Huang
1999	J	`jnl`	On Applying Molecular Computation to the Data Encryption Standard. J. Comput. Biol. Leonard M. Adleman, Paul W. K. Rothemund, Sam T. Roweis, Erik Winfree
1998	J	`jnl`	A Sticker-Based Model for DNA Computation. J. Comput. Biol. Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nickolas V. Chelyapov, Myron F. Goodman, Paul W. K. Rothemund, Leonard M. Adleman
1997	J	`jnl`	Quantum Computability. SIAM J. Comput. Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang
1996	—	`conf`	A sticker based model for DNA computation. DNA Based Computers Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nickolas V. Chelyapov, Myron F. Goodman, Paul W. K. Rothemund, Leonard M. Adleman
1996	—	`conf`	Counting Rational Points on Curves and Abelian Varieties over Finite Fields. ANTS Leonard M. Adleman, Ming-Deh A. Huang
1996	—	`conf`	On applying molecular computation to the data encryption standard. DNA Based Computers Leonard M. Adleman, Paul W. K. Rothemund, Sam T. Roweis, Erik Winfree
1995	—	`ch.`	Algorithmic Number Theory and Its Relationship to Computational Complexity. Computer Science Today Leonard M. Adleman
1995	J	`jnl`	Efficient Checkers for Number-Theoretic Computations Inf. Comput. Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella
1995	—	`conf`	On constructing a molecular computer. DNA Based Computers Leonard M. Adleman
1994	—	`conf`	A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields. ANTS Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang
1994	—	`ed.`	Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994, Proceedings ANTS Leonard M. Adleman, Ming-Deh A. Huang
1994	A*	`conf`	Algorithmic Number Theory-The Complexity Contribution FOCS Leonard M. Adleman
1994	—	`conf`	Efficient checking of computations in number theory. ANTS Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella
1994	—	`conf`	Open problems in number theoretic complexity, II. ANTS Leonard M. Adleman, Kevin S. McCurley
1994	—	`conf`	The function field sieve. ANTS Leonard M. Adleman
1993	A*	`conf`	A Subexponential Algorithm for Discrete Logarithms over All Finite Fields. CRYPTO Leonard M. Adleman, Jonathan DeMarrais
1991	A*	`conf`	Factoring Numbers Using Singular Integers STOC Leonard M. Adleman
1991	J	`jnl`	Inductive Inference and Unsolvability. J. Symb. Log. Leonard M. Adleman, Manuel Blum
1990	A*	`conf`	Fast Checkers for Cryptography. CRYPTO Kireeti Kompella, Leonard M. Adleman
1988	A*	`conf`	An Abstract Theory of Computer Viruses. CRYPTO Leonard M. Adleman
1988	A*	`conf`	Using Smoothness to Achieve Parallelism (Abstract) STOC Leonard M. Adleman, Kireeti Kompella
1987	A*	`conf`	Recognizing Primes in Random Polynomial Time STOC Leonard M. Adleman, Ming-Deh A. Huang
1986	A*	`conf`	Finding Irreducible Polynomials over Finite Fields STOC Leonard M. Adleman, Hendrik W. Lenstra Jr.
1985	A*	`conf`	Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields. CRYPTO Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller
1983	J	`jnl`	A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint). Commun. ACM Ronald L. Rivest, Adi Shamir, Leonard M. Adleman
1983	A*	`conf`	On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract) STOC Leonard M. Adleman
1982	A*	`conf`	An Application of Higher Reciprocity to Computational Number Theory (Abstract) FOCS Leonard M. Adleman, Robert McDonnell
1982	A*	`conf`	Implementing an Electronic Notary Public. CRYPTO Leonard M. Adleman
1982	A*	`conf`	On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem. CRYPTO Leonard M. Adleman
1981	A*	`conf`	Irreducibility Testing and Factorization of Polynomials (Extended Abstract) FOCS Leonard M. Adleman, Andrew M. Odlyzko
1981	A*	`conf`	Primality Testing. CRYPTO Leonard M. Adleman
1981	J	`jnl`	Space-Bounded Simulation of Multitape Turing Machines. Math. Syst. Theory Leonard M. Adleman, Michael C. Loui
1980	A*	`conf`	On Distinguishing Prime Numbers from Composite Numbers (Abstract) FOCS Leonard M. Adleman
1979	A*	`conf`	A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract) FOCS Leonard M. Adleman
1979	A*	`conf`	Reductions that Lie FOCS Leonard M. Adleman, Kenneth L. Manders
1978	J	`jnl`	A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Commun. ACM Ronald L. Rivest, Adi Shamir, Leonard M. Adleman
1978	J	`jnl`	Improved Time and Space Bounds for Boolean Matrix Multiplication. Acta Informatica Leonard M. Adleman, Kellogg S. Booth, Franco P. Preparata, Walter L. Ruzzo
1978	J	`jnl`	NP-Complete Decision Problems for Binary Quadratics. J. Comput. Syst. Sci. Kenneth L. Manders, Leonard M. Adleman
1978	A*	`conf`	Two Theorems on Random Polynomial Time FOCS Leonard M. Adleman
1977	A*	`conf`	On Taking Roots in Finite Fields FOCS Leonard M. Adleman, Kenneth L. Manders, Gary L. Miller
1977	A*	`conf`	Reducibility, Randomness, and Intractability (Abstract) STOC Leonard M. Adleman, Kenneth L. Manders
1976	A*	`conf`	Diophantine Complexity FOCS Leonard M. Adleman, Kenneth L. Manders
1976	A*	`conf`	NP-Complete Decision Problems for Quadratic Polynomials STOC Kenneth L. Manders, Leonard M. Adleman
1975	A*	`conf`	Computational Complexity of Decision Procedures for Polynomials (Extended Abstract) FOCS Leonard M. Adleman, Kenneth L. Manders
1974	J	`jnl`	Short permutation strings. Discret. Math. Leonard M. Adleman