( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Two Fast GCD Algorithms.

. J. Algorithms, 16 (1): 110-144 (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.

Jonathan Roth

Jonathan Cavanagh

Jonathan Burmeister

Jonathan Vöglein

Jonathan Rother

 

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

Genetic algorithms for the extended GCD problem (work in progress)., , и . SIGSAM Bull., 31 (3): 34-35 (1997)Near-optimal online multiselection in internal and external memory., , , и . J. Discrete Algorithms, (2016)Polylog Depth Circuits for Integer Factoring and Discrete Logarithms. Inf. Comput., 110 (1): 1-18 (апреля 1994)Two Fast GCD Algorithms.. J. Algorithms, 16 (1): 110-144 (1994)Fast Bounds on the Distribution of Smooth Numbers., и . ANTS, том 4076 из Lecture Notes in Computer Science, стр. 168-181. Springer, (2006)A Space-Efficient Fast Prime Number Sieve., , и . Inf. Process. Lett., 59 (2): 79-84 (1996)Trading Time for Space in Prime Number Sieves.. ANTS, том 1423 из Lecture Notes in Computer Science, стр. 179-195. Springer, (1998)Efficient Algorithms for Computing the Jacobi Symbol., и . J. Symb. Comput., 26 (4): 509-523 (1998)Efficient Algorithms for Computing the Jacobi Symbol., и . ANTS, том 1122 из Lecture Notes in Computer Science, стр. 225-239. Springer, (1996)A binary algorithm for the Jacobi symbol., и . SIGSAM Bull., 27 (1): 4-11 (1993)