|
281
|
Parallel merge sort
– R Cole
|
|
595
|
An introduction to parallel algorithms
– J Jájá
- 1992
|
|
17
|
Fast hashing on a PRAM|designing by expectation
– J Gil, Y Matias
- 1991
|
|
60
|
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
– Sanguthevar Rajasekaran, John H. Reif
- 1989
|
|
207
|
Storing a sparse table with O(1) worst case access time
– M Fredman, J Komlós, E Szemerédi
- 1984
|
|
7324
|
Cache-oblivious algorithms
– M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN
- 1999
|
|
14
|
Fast and reliable parallel hashing
– H Bast, T Hagerup
- 1991
|
|
44
|
Towards a theory of nearly constant time parallel algorithms
– J Gil, Y Matias, U Vishkin
- 1991
|
|
14
|
The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting
– R Raman
- 1990
|
|
13
|
On parallel integer sorting
– Sanguthevar Rajasekaran, Sandeep Sen
- 1992
|
|
43
|
Converting High Probability into Nearly-Constant Time—with Applications to Parallel Hashing
– Y Matias, U Vishkin
- 1991
|
|
18
|
Towards optimal parallel bucket sorting
– T Hagerup
- 1987
|
|
108
|
An o(log n) parallel connectivity algorithm
– Y Shiloach, U Vishkin
- 1982
|
|
114
|
A logarithmic time sort for linear size networks
– H J Reif, L G Valiant
- 1987
|
|
35
|
auf der Heide. A New Universal Class of Hash Functions and Dynamic Hashing in Real Time
– M Dietzfelbinger, F Meyer
- 1990
|
|
5
|
Fast and efficient simulations among CRCW PRAMs
– Joseph Gil, Yossi Matias
- 1994
|
|
96
|
Deterministic coin tossing with applications to optimal parallel list ranking
– R Cole, U Vishkin
- 1986
|
|
166
|
A Comparison of Sorting Algorithms for the Connection Machine CM-2
– Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
|
|
11
|
auf der Heide, An optimal parallel dictionary, in
– M Dietzfelbinger, F Meyer
- 1989
|
