( en | de | ru )

 

Disambiguation of "Adleman, Leonard M."

Author of the publication

copydeleteadd this publication to your clipboard
On Distinguishing Prime Numbers from Composite Numbers (Abstract)

. FOCS, page 387-406. IEEE Computer Society, (1980)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Leonard Rupp

Leonard Düben

Leonard Lennerts

Leonard Olschner

Leonard Percac

 

Other publications of authors with the same name

Primality Testing.. CRYPTO, page 10. U. C. Santa Barbara, Dept. of Elec. and Computer Eng., ECE Report No 82-04, (1981)NP-Complete Decision Problems for Quadratic Polynomials, and . STOC, page 23-29. ACM, (1976)A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q)., , and . Theor. Comput. Sci., 226 (1-2): 7-18 (1999)Efficient checking of computations in number theory., , and . ANTS, volume 877 of Lecture Notes in Computer Science, page 249. Springer, (1994)Implementing an Electronic Notary Public.. CRYPTO, page 259-265. Plenum Press, New York, (1982)An Abstract Theory of Computer Viruses.. CRYPTO, volume 403 of Lecture Notes in Computer Science, page 354-374. Springer, (1988)Using Smoothness to Achieve Parallelism (Abstract), and . STOC, page 528-538. ACM, (1988)On applying molecular computation to the data encryption standard., , , and . DNA Based Computers, volume 44 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 31-44. DIMACS/AMS, (1996)Combinatorial optimization problems in self-assembly., , , , , , and . STOC, page 23-32. ACM, (2002)On Distinguishing Prime Numbers from Composite Numbers (Abstract). FOCS, page 387-406. IEEE Computer Society, (1980)