Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. G. Cesari and R. Maeder. Parallel 3-primes FFT algorithm. In J. Calmet and C. Limongelli, editors, DISCO'96, pages 174–182. Springer LNCS 1128, 1996.
2. G. Cesari and R. Maeder. Performance analysis of the parallel Karatsuba multiplication algorithm for distributed memory architectures. J. of Symbolic Computation, 21:467–473, 1996.
3. B. Char, J. Johnson, D. Saunders, and A. P. Wack. Some experiments with bignum arithmetic. In H. Hong, editor, PASCO'94, pages 94–103. World Scientific, Singapore, 1994.
4. H. Hong, W. Schreiner, and A. Neubacher. The design of the SACLIB/PACLIB kernel. J. of Symbolic Computation, 19(1-3):111–132, 1995.
5. T. Jebelean. Exact division with Karatsuba complexity. Technical Report 96-31, RISC-Linz, December 1996.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parallel integer multiplication;2022 30th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP);2022-03
2. Centralized key distribution protocol using the greatest common divisor method;Computers & Mathematics with Applications;2013-05
3. Using the parallel Karatsuba algorithm for long integer multiplication and division;Euro-Par'97 Parallel Processing;1997