Sciweavers

6897 search results - page 221 / 1380
» Parallelization of Modular Algorithms
Sort
View
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
15 years 6 months ago
Montgomery Exponentiation with no Final Subtractions: Improved Results
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
Gaël Hachez, Jean-Jacques Quisquater
243
Voted
POPL
2006
ACM
16 years 2 months ago
Autolocker: synchronization inference for atomic sections
The movement to multi-core processors increases the need for simpler, more robust parallel programming models. Atomic sections have been widely recognized for their ease of use. T...
Bill McCloskey, Feng Zhou, David Gay, Eric A. Brew...
IPPS
2002
IEEE
15 years 7 months ago
An Associative Static and Dynamic Convex Hull Algorithm
This paper presents a new static and dynamic recursive parallel algorithm for the convex hull problem. This algorithm is a parallel adaptation of the Graham Scan and Quick Hull al...
Maher M. Atwah, Johnnie W. Baker
ICPP
2009
IEEE
15 years 4 days ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
IPPS
1999
IEEE
15 years 6 months ago
The Characterization of Data-Accumulating Algorithms
A data-accumulating algorithm (d-algorithm for short) works on an input considered as a virtually endless stream. The computation terminates when all the currently arrived data ha...
Stefan D. Bruda, Selim G. Akl