Parallel Collision Search with Cryptanalytic Applications
β Scribed by Paul C. van Oorschot; Michael J. Wiener
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 254 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0933-2790
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract The goal of this paper is to investigate the application of parallel programming techniques to boost the performance of heuristic searchβbased planning systems in various aspects. It shows that an appropriate parallelization of a sequential planning system often brings gain in performan
We present a randomized selection algorithm whose performance is analyzed in an architecture independent way on the bulk-synchronous parallel (BSP) model of computation along with an application of this algorithm to dynamic data structures, namely parallel priority queues. We show that our algorithm
The parallel mechine scheduling problem with unrelated machines is studied where the objective is to minimize the maximum makespan. In this paper, new local search algorithms are proposed where the neighborhood search of a solution uses the "efficiency" of the machinea for each job. It is shown that