6897 search results - page 3 / 1380 » Parallelization of Modular Algorithms |
135
Voted
ARITH
2007
IEEE
15 years 10 months ago
2007
IEEE
We describe a new method to perform the modular exponentiation operation, i.e., the computation of c = me mod n, where c, m, e and n are large integers. The new method uses the di...
223
Voted
ICDCN
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we report our parallel implementations of the Lanczos sparse linear system solving algorithm over large prime fields, on a multi-core platform. We employ several lo...
173
click to vote
PDCAT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Agent-based simulation of large multicellular biological systems has become a viable option owing to affordable parallel computers, such as Beowulf-style clusters. We de...
130
Voted
JDA
2008
15 years 3 months ago
2008
A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O (...
63
Voted
PODC
1987
ACM
15 years 7 months ago
1987
ACM
Abstract: We introduce the input-output automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular...