|
36
|
Integers without large prime factors
– A Hildebrand, G Tenenbaum
- 1993
|
|
1
|
On a Parallel Extended Euclidean Algorithm
– Sidi Mohammed Sedjelmaci
|
|
1
|
A modular reduction for GCD computation
– Sidi Mohammed Sedjelmaci
- 2002
|
|
3
|
An analysis of the generalized binary GCD algorithm
– Jonathan P. Sorenson
- 2007
|
|
2
|
Ian Parberry, Two fast parallel prime number sieves
– Jonathan P Sorenson
- 1994
|
|
1
|
Guangwu Xu, Fast arithmetics using Chinese remaindering
– George Davida, Bruce Litow
- 2009
|
|
7
|
On a parallel Lehmer–Euclid GCD algorithm
– Sidi Mohammed Sedjelmaci
|
|
4
|
Abstract A Parallel Extended GCD Algorithm
– Sidi Mohamed Sedjelmaci
|
|
9
|
Fast parallel matrix
– A BORODIN, J VON ZUR GATHEN, J HOPCROFT
- 1982
|
|
13
|
An improved parallel algorithm for integer GCD
– B Chor, O Goldreich
- 1990
|
|
15
|
Using Smoothness to Achieve Parallelism
– L Adleman, K Kompella
- 1988
|
|
24
|
Two fast GCD algorithms
– J Sorenson
- 1994
|
|
11
|
Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers
– R Kannan, G Miller, L Rudolph
- 1987
|
|
13
|
Efficient Algorithms for Computing the Jacobi Symbol
– S M EIKENBERRY, J SORENSON
- 1996
|
|
139
|
Synthesis of Parallel Algorithms
– J H Reif
- 1993
|
|
175
|
Introduction to analytic and probabilistic number theory
– G Tenenbaum
- 1995
|
|
64
|
Schnelle Multiplikation großer Zahlen
– A Schönhage, V Strassen
- 1971
|
|
119
|
Prime Numbers - A Computational Perspective
– R Crandall, C Pomerance
- 2000
|
|
35
|
Limits of Parallel Computation
– R Greenlaw, H J Hoover, W L Ruzzo
- 1995
|
