|
29
|
Accounting for memory bank contention and delay in high-bandwidth multiprocessors
– Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias, Marco Zagha
- 1997
|
|
1016
|
A bridging model for parallel computation
– L G Valiant
- 1990
|
|
595
|
An introduction to parallel algorithms
– J Jájá
- 1992
|
|
8
|
Parallel iterated bucket sort
– B S Chlebus
- 1989
|
|
4
|
Hybridsort revisited and parallelized
– T Hagerup
- 1989
|
|
6
|
The design and analysis of a new hybrid sorting algorithm
– H Meijer, S G Akl
- 1980
|
|
6
|
QRQW: Accounting for concurrency in PRAMs and Asynchronous PRAMs
– P B Gibbons, Y Matias, V Ramachandran
- 1993
|
|
6
|
On choice of a model of parallel computation
– U Vishkin
- 1001
|
|
3
|
Simple fast parallel hashing
– J Gil, Y Matias
- 1994
|
|
4
|
A Note on Reducing Parallel Model Simulations to Integer Sorting
– Yossi Matias, Uzi Vishkin
- 1995
|
|
9
|
Fast Load Balancing on a PRAM
– J Gil
- 1991
|
|
19
|
Ultra-fast expected time parallel algorithms
– Philip D. Mackenzie, Quentin F. Stout
- 1991
|
|
4
|
Renaming and dispersing: Techniques for fast load balancing
– J Gil
- 1994
|
|
17
|
Fast hashing on a PRAM|designing by expectation
– J Gil, Y Matias
- 1991
|
|
6
|
Sorting in c lg n parallel steps
– M Ajtai, J Komlos, E Szemeredi
- 1983
|
|
60
|
The KSR1: Bridging the Gap Between Shared Memory and MPPs
– James Rothnie
|
|
43
|
Converting High Probability into Nearly-Constant Time—with Applications to Parallel Hashing
– Y Matias, U Vishkin
- 1991
|
|
18
|
Parallel tree contraction part 1: Fundamentals
– Gary L Miller, John H Reif
- 1989
|
|
18
|
Highly Parallel Randomized Algorithmics
– Y Matias
- 1992
|
