On Parallel Hashing and Integer Sorting (1991)

Cached

Download Links

by Yossi Matias , Uzi Vishkin
Citations:25 - 9 self

Documents Related by Co-Citation

18 Fast hashing on a PRAM— designing by expectation – J GIL, Y MATIAS - 1991
641 An Introduction to Parallel Algorithms – J JáJá - 1992
288 Parallel Merge Sort – R Cole - 1988
222 Storing a sparse table with O(1) worst case access time – M L Fredman, J Komlós, E Szemerédi - 1984
64 Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms – Sanguthevar Rajasekaran, John H. Reif - 1989
15 Fast and Reliable Parallel Hashing – H Bast, T Hagerup - 1991
43 Converting high probability into nearly-constant time - with appli cations to parallel hashing – Y Matins, U Vishkin - 1991
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
44 Towards a theory of nearly constant time parallel algorithms – Y Gil, Y Matias, U Vishkin - 1991
14 The power of collision: Randomized parallel algorithms for chaining and integer sorting – R Raman - 1991
13 On parallel integer sorting – Sanguthevar Rajasekaran, Sandeep Sen - 1992
18 Optimal Parallel Bucket Sorting – T Hagerup, “Towards - 1987
120 A logarithmic time sort for linear size networks – J H Reif, L G Valiant - 1987
38 auf der Heide. A new universal class of hash functions and dynamic hashing in real time – Martin Dietzfelbinger, Friedhelm Meyer - 1990
5 Fast and efficient simulations among CRCW PRAMs – Joseph Gil, Yossi Matias - 1994
173 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
114 Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking – R Cole, U Vishkin - 1986
11 auf der Heide. An optimal parallel dictionary – M Dietzfelbinger, F Meyer - 1989
2452 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974