On Parallel Hashing and Integer Sorting (1991)

Cached

Download Links

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

Documents Related by Co-Citation

288 Parallel Merge Sort – R Cole - 1988
18 Fast hashing on a PRAM— designing by expectation – J GIL, Y MATIAS - 1991
641 An Introduction to Parallel Algorithms – J JáJá - 1992
15 Fast and Reliable Parallel Hashing – H Bast, T Hagerup - 1991
222 Storing a sparse table with O(1) worst case access time – M L Fredman, J Komlós, E Szemerédi - 1984
43 Converting high probability into nearly-constant time - with appli cations to parallel hashing – Y Matins, U Vishkin - 1991
44 Towards a theory of nearly constant time parallel algorithms – Y Gil, Y Matias, U Vishkin - 1991
64 Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms – Sanguthevar Rajasekaran, John H. Reif - 1989
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
117 An optimal parallel connectivity algorithm – U Vishkin - 1984
13 On parallel integer sorting – Sanguthevar Rajasekaran, Sandeep Sen - 1992
14 The power of collision: Randomized parallel algorithms for chaining and integer sorting – R Raman - 1991
5 Fast and efficient simulations among CRCW PRAMs – Joseph Gil, Yossi Matias - 1994
18 Optimal Parallel Bucket Sorting – T Hagerup, “Towards - 1987
41 The QRQW PRAM: accounting for contention in parallel algorithms – Phillip B Gibbons, Yossi Matias, Vijaya Ramachandran - 1994
2452 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
273 Parallel Prefix Computation – Richard E. Ladner, Michael, J. Fischer - 1980
26 A Universal Interconnection Pattern for Parallel Computers – L M Goldschlager - 1983
120 A logarithmic time sort for linear size networks – J H Reif, L G Valiant - 1987