The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Leonard M. Adleman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ronald L. Rivest, Adi Shamir, Leonard M. Adleman
    A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. [Citation Graph (7, 0)][DBLP]
    Commun. ACM, 1978, v:21, n:2, pp:120-126 [Journal]
  2. Leonard M. Adleman
    The function field sieve. [Citation Graph (0, 0)][DBLP]
    ANTS, 1994, pp:108-121 [Conf]
  3. Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang
    A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 1994, pp:28-40 [Conf]
  4. Leonard M. Adleman, Ming-Deh A. Huang
    Counting Rational Points on Curves and Abelian Varieties over Finite Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:1-16 [Conf]
  5. Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella
    Efficient checking of computations in number theory. [Citation Graph (0, 0)][DBLP]
    ANTS, 1994, pp:249- [Conf]
  6. Leonard M. Adleman, Kevin S. McCurley
    Open problems in number theoretic complexity, II. [Citation Graph (0, 0)][DBLP]
    ANTS, 1994, pp:291-322 [Conf]
  7. Leonard M. Adleman
    Primality Testing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1981, pp:10- [Conf]
  8. Leonard M. Adleman
    Implementing an Electronic Notary Public. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:259-265 [Conf]
  9. Leonard M. Adleman
    On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:303-308 [Conf]
  10. Leonard M. Adleman
    An Abstract Theory of Computer Viruses. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:354-374 [Conf]
  11. Leonard M. Adleman, Jonathan DeMarrais
    A Subexponential Algorithm for Discrete Logarithms over All Finite Fields. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:147-158 [Conf]
  12. Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller
    Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:3-13 [Conf]
  13. Kireeti Kompella, Leonard M. Adleman
    Fast Checkers for Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:515-529 [Conf]
  14. 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]
  15. Leonard M. Adleman
    Two Theorems on Random Polynomial Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:75-83 [Conf]
  16. Leonard M. Adleman
    A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:55-60 [Conf]
  17. Leonard M. Adleman
    On Distinguishing Prime Numbers from Composite Numbers (Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:387-406 [Conf]
  18. Leonard M. Adleman
    Algorithmic Number Theory-The Complexity Contribution [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:88-113 [Conf]
  19. Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus
    On the Decidability of Self-Assembly of Infinite Ribbons. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:530-537 [Conf]
  20. Leonard M. Adleman, Kenneth L. Manders
    Computational Complexity of Decision Procedures for Polynomials (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:169-177 [Conf]
  21. Leonard M. Adleman, Kenneth L. Manders
    Diophantine Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1976, pp:81-88 [Conf]
  22. Leonard M. Adleman, Kenneth L. Manders
    Reductions that Lie [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:397-410 [Conf]
  23. Leonard M. Adleman, Robert McDonnell
    An Application of Higher Reciprocity to Computational Number Theory (Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:100-106 [Conf]
  24. Leonard M. Adleman, Kenneth L. Manders, Gary L. Miller
    On Taking Roots in Finite Fields [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:175-178 [Conf]
  25. Leonard M. Adleman, Andrew M. Odlyzko
    Irreducibility Testing and Factorization of Polynomials (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:409-418 [Conf]
  26. Leonard M. Adleman
    On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:402-412 [Conf]
  27. Leonard M. Adleman
    Factoring Numbers Using Singular Integers [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:64-71 [Conf]
  28. Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang
    Running time and program size for self-assembled squares. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:740-748 [Conf]
  29. 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]
  30. Leonard M. Adleman, Ming-Deh A. Huang
    Recognizing Primes in Random Polynomial Time [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:462-469 [Conf]
  31. Leonard M. Adleman, Kireeti Kompella
    Using Smoothness to Achieve Parallelism (Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:528-538 [Conf]
  32. Leonard M. Adleman, Hendrik W. Lenstra Jr.
    Finding Irreducible Polynomials over Finite Fields [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:350-355 [Conf]
  33. Leonard M. Adleman, Kenneth L. Manders
    Reducibility, Randomness, and Intractability (Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:151-163 [Conf]
  34. Kenneth L. Manders, Leonard M. Adleman
    NP-Complete Decision Problems for Quadratic Polynomials [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:23-29 [Conf]
  35. Leonard M. Adleman, Kellogg S. Booth, Franco P. Preparata, Walter L. Ruzzo
    Improved Time and Space Bounds for Boolean Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1978, v:11, n:, pp:61-77 [Journal]
  36. Ronald L. Rivest, Adi Shamir, Leonard M. Adleman
    A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint). [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1983, v:26, n:1, pp:96-99 [Journal]
  37. Leonard M. Adleman, Ming-Deh A. Huang
    Function Field Sieve Method for Discrete Logarithms over Finite Fields. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:151, n:1-2, pp:5-16 [Journal]
  38. Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella
    Efficient Checkers for Number-Theoretic Computations [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:121, n:1, pp:93-102 [Journal]
  39. 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]
  40. 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]
  41. Kenneth L. Manders, Leonard M. Adleman
    NP-Complete Decision Problems for Binary Quadratics. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:16, n:2, pp:168-184 [Journal]
  42. Leonard M. Adleman, Ming-Deh A. Huang
    Counting Points on Curves and Abelian Varieties Over Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2001, v:32, n:3, pp:171-189 [Journal]
  43. Leonard M. Adleman, Manuel Blum
    Inductive Inference and Unsolvability. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1991, v:56, n:3, pp:891-900 [Journal]
  44. Leonard M. Adleman, Michael C. Loui
    Space-Bounded Simulation of Multitape Turing Machines. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1981, v:14, n:, pp:215-222 [Journal]
  45. Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang
    Quantum Computability. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:5, pp:1524-1540 [Journal]
  46. Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang
    A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:226, n:1-2, pp:7-18 [Journal]

Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002