( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient checking of computations in number theory.

, , и . ANTS, том 877 из Lecture Notes in Computer Science, стр. 249. Springer, (1994)

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.

Leonard Rupp

Leonard Düben

Leonard Olschner

Leonard Lennerts

Leonard Percac

 

Другие публикации лиц с тем же именем

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