Fast Bounds on the Distribution of Smooth Numbers (2006)

Cached

Download Links

by Scott T. Parsell , Jonathan P. Sorenson
Citations:3 - 2 self

Documents Related by Co-Citation

2 On a Parallel Extended Euclidean Algorithm – Sidi Mohammed Sedjelmaci
11 An improved parallel algorithm for integer GCD – B Chor, O Goldreich - 1990
11 Sublinear parallel algorithm for computing the greatest common divisor of two integers – R Kannan, G Miller, L Rudolph - 1987
7 On a parallel Lehmer–Euclid GCD algorithm – Sidi Mohammed Sedjelmaci
2 A modular reduction for GCD computation – Sidi Mohammed Sedjelmaci - 2002
4 A parallel extended GCD algorithm – Sidi Mohamed Sedjelmaci - 2008
39 Limits to Parallel Computation – R Greenlaw, H J Hoover, W L Ruzzo - 1995
24 Two Fast GCD Algorithms – J P Sorenson - 1994
5 An analysis of the generalized binary GCD algorithm – Jonathan P. Sorenson - 2007
8 MODULAR EXPONENTIATION VIA THE EXPLICIT CHINESE REMAINDER THEOREM – Daniel J. Bernstein, Jonathan, P. Sorenson
17 Using smoothness to achieve parallelism – L Adleman, K Kompella - 1988
148 Synthesis of Parallel Algorithms – J H Reif, editor - 1993
137 Prime Numbers: A Computational Perspective – Richard Crandall, Carl Pomerance - 2005
287 A survey of parallel algorithms for shared-memory machines, Rep – R Karp, V Ramachandran - 1989
80 Schnelle Multiplikation großer Zahlen – A Schönhage, V Strassen - 1971
117 Log depth circuits for division and related problems – P W Beame, S A Cook, H J Hoover - 1986
40 Integers without large prime factors – A Hildebrand, G Tenenbaum - 1993
7 Integers without large prime factors, Journal de Theorie des Nombres de Bordeaux 5 – A Hildebrand, G Tenenbaum - 1993
1 Fast Arithmetics Using Chinese Remaindering – George Davida, Bruce Litow, Guangwu Xu - 806