Simple Fast Parallel Hashing by Oblivious Execution (1994)

Cached

Download Links

by Joseph Gil , Yossi Matias
Venue:AT&T Bell Laboratories
Citations:4 - 2 self

Documents Related by Co-Citation

32 Accounting for memory bank contention and delay in high-bandwidth multiprocessors – Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias, Marco Zagha - 1997
1132 A bridging model for parallel computation – L Valiant - 1990
636 An Introduction to Parallel Algorithms – J JaJa - 1992
44 Converting High Probability into Nearly-Constant Time --- with Applications to Parallel Hashing – Y Matias, U Vishkin - 1991
19 Fast Hashing on a PRAM -- Designing by Expectation – J Gil, Y Matias - 1991
25 On Parallel Hashing and Integer Sorting – Yossi Matias, Uzi Vishkin - 1991
218 Storing a sparse table with O(1) worst case access time – M L Fredman, J Komlós, E Szemerédi - 1984
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
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
6 Sorting in c lg n parallel steps – M Ajtai, J Komlos, E Szemeredi - 1983
23 The Queue-Read Queue-Write Asynchronous PRAM Model – Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran - 1998
57 Probabilistic Parallel Algorithms for Sorting and Selection – R Reischuk - 1985
5 Renaming and dispersing: Techniques for fast load balancing – J Gil - 1994
16 Fast parallel generation of random permutations – T Hagerup - 1991