sign in · help · news · about ·

BibSonomy :: author :: Adleman ::

tag user group author concept BibTeX key search:all

The blue social bookmark and publication sharing system.

>
|
<

bookmarks

bookmarks per page: 5 10 20 50 100

RSS BibTeX RDF more

publications

(59)

<< < 1 | 2 | 3 > >>

Implementing an Electronic Notary Public.
Leonard M. Adleman CRYPTO, page 259-265. Plenum Press, New York, (1982)
to dblp by dblp on Dec 23, 2011, 12:00 AM
URL | BibTeX
On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem.
Leonard M. Adleman CRYPTO, page 303-308. Plenum Press, New York, (1982)
to dblp by dblp on Dec 23, 2011, 12:00 AM
URL | BibTeX
Primality Testing.
Leonard M. Adleman CRYPTO, page 10. U. C. Santa Barbara, Dept. of Elec. and Computer Eng., ECE Report No 82-04, (1981)
to dblp by dblp on Dec 23, 2011, 12:00 AM
URL | BibTeX
Computational Complexity of Decision Procedures for Polynomials Extended Abstract
Leonard M. Adleman, and Kenneth L. Manders FOCS, page 169-177. IEEE Computer Society, (1975)
to dblp by dblp on Oct 19, 2011, 12:00 AM
URL | BibTeX
Algorithmic Number Theory-The Complexity Contribution
Leonard M. Adleman FOCS, page 88-113. IEEE Computer Society, (1994)
to dblp by dblp on Oct 19, 2011, 12:00 AM
URL | BibTeX
An Application of Higher Reciprocity to Computational Number Theory Abstract
Leonard M. Adleman, and Robert McDonnell FOCS, page 100-106. IEEE Computer Society, (1982)
to dblp by dblp on Oct 19, 2011, 12:00 AM
URL | BibTeX
Irreducibility Testing and Factorization of Polynomials Extended Abstract
Leonard M. Adleman, and Andrew M. Odlyzko FOCS, page 409-418. IEEE Computer Society, (1981)
to dblp by dblp on Oct 19, 2011, 12:00 AM
URL | BibTeX
On Distinguishing Prime Numbers from Composite Numbers Abstract
Leonard M. Adleman FOCS, page 387-406. IEEE Computer Society, (1980)
to dblp by dblp on Oct 19, 2011, 12:00 AM
URL | BibTeX
A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography Abstract
Leonard M. Adleman FOCS, page 55-60. IEEE Computer Society, (1979)
to dblp by dblp on Oct 19, 2011, 12:00 AM
URL | BibTeX
Reductions that Lie
Leonard M. Adleman, and Kenneth L. Manders FOCS, page 397-410. IEEE Computer Society, (1979)
to dblp by dblp on Oct 19, 2011, 12:00 AM
URL | BibTeX
Two Theorems on Random Polynomial Time
Leonard M. Adleman FOCS, page 75-83. IEEE Computer Society, (1978)
to dblp by dblp on Oct 19, 2011, 12:00 AM
URL | BibTeX
On Taking Roots in Finite Fields
Leonard M. Adleman, Kenneth L. Manders, and Gary L. Miller FOCS, page 175-178. IEEE Computer Society, (1977)
to dblp by dblp on Oct 19, 2011, 12:00 AM
URL | BibTeX
Diophantine Complexity
Leonard M. Adleman, and Kenneth L. Manders FOCS, page 81-88. IEEE Computer Society, (1976)
to dblp by dblp on Oct 19, 2011, 12:00 AM
URL | BibTeX
Reducibility, Randomness, and Intractability Abstract
Leonard M. Adleman, and Kenneth L. Manders STOC, page 151-163. ACM, (1977)
to dblp by dblp on Oct 17, 2011, 12:00 AM
URL | BibTeX
NP-Complete Decision Problems for Quadratic Polynomials
Kenneth L. Manders, and Leonard M. Adleman STOC, page 23-29. ACM, (1976)
to dblp by dblp on Oct 17, 2011, 12:00 AM
URL | BibTeX
Factoring Numbers Using Singular Integers
Leonard M. Adleman STOC, page 64-71. ACM, (1991)
to dblp by dblp on Oct 17, 2011, 12:00 AM
URL | BibTeX
On Breaking Generalized Knapsack Public Key Cryptosystems Abstract
Leonard M. Adleman STOC, page 402-412. ACM, (1983)
to dblp by dblp on Oct 17, 2011, 12:00 AM
URL | BibTeX
Recognizing Primes in Random Polynomial Time
Leonard M. Adleman, and Ming-Deh A. Huang STOC, page 462-469. ACM, (1987)
to dblp by dblp on Oct 17, 2011, 12:00 AM
URL | BibTeX
Finding Irreducible Polynomials over Finite Fields
Leonard M. Adleman, and Hendrik W. Lenstra Jr. STOC, page 350-355. ACM, (1986)
to dblp by dblp on Oct 17, 2011, 12:00 AM
URL | BibTeX
Using Smoothness to Achieve Parallelism Abstract
Leonard M. Adleman, and Kireeti Kompella STOC, page 528-538. ACM, (1988)
to dblp by dblp on Oct 17, 2011, 12:00 AM
URL | BibTeX

<< < 1 | 2 | 3 > >>publications per page: 5 10 20 50 100

a gripper