Fast and reliable parallel hashing

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1991

Volumn , Issue , 1991, Pages 50-61

  Bast, Holger ^a   Hagerup, Torben ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS; PARALLEL ALGORITHMS;

CONSTANT TIME; MULTISET; RESOURCE REQUIREMENTS; SINGLE PROCESSORS;

PARALLEL ARCHITECTURES;

EID: 0342959268     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/113379.113384     Document Type: Conference Paper

References (14)

1. BOLLOBÁS, B. (1987), Martingales, Isoperimetric Inequalities and Random Graphs, in Colloq. Math. Soc. J. Bolyai 52, pp. 113-139.
2. CHLEBUS, B. S., DIKS, K., HAGERUP, T., AND RAD-ZIK, T. (1988), Efficient Simulations between Concurrent-Read Concurrent-Write PRAM Models, in Proc. 13th Symposium on Mathematical Foundations of Computer Science, Springer Lecture Notes in Computer Science, Vol. 324, pp. 231-239.
3. DETZFELBINGER, M., AND MEYER AUF DER HEIDE, F. (1989), An Optimal Parallel Dictionary, in Proc. 1st Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 360-368.
4. FEDMAN, M. L, KOMLÓS, J., AND SZEMEREDI, E. (1984), Storing a Sparse Table with O(1) Worst Case Access Time, J. ACM 31, pp. 538-544.
5. GIL, J., AND MATIAS, Y. (1991), Fast Hashing on a PRAM - Designing by Expectation, in Proc. 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 271-280.
6. GIL, J., MEYER AUF DER HEIDE, F., AND WIGDERSON, A. (1990), Not All Keys Can be Hashed in Constant Time, in Proc. 22nd Annual ACM Symposium on Theory of Computing, pp. 244-253.
7. HAGERUP, T., AND RUB, C. (1990), A Guided Tour of Chernoff Bounds, Inf. Proc. Lett. 33, pp. 305-308.
8. HAGERUP, T. (1991), Fast Parallel Space Allocation, Estimation and Integer Sorting, Tech. Rep. no. 03/91, SFB 124, Universitat des Saarlandes.
9. MATIAS, Y., AND VISHKIN, U. (1990a), On Parallel Hashing and Integer Sorting, in Proc. 17th International Colloquium on Automata, Languages and Programming, Springer Lecture Notes in Computer Science, Vol. 443, pp. 729-743.
10. MATIAS, Y., AND VISHKIN, U. (1990b), On Parallel Hashing and Integer Sorting, Tech. Rep. No. UMIACS-TR-90-13 (revised version), University of Maryland, College Park.
11. MATIAS, Y., AND VISHKIN, U. (1991), Converting High Probability into Nearly-Constant Time - with Applications to Parallel Hashing, preliminary draft. Also in Proc. 23nd Annual ACM Symposium on Theory of Computing, to appear.
12. RAGDE, P. (1990), The Parallel Simplicity of Compaction and Chaining, in Proc. 17th International Colloquium on Automata, Languages and Programming, Springer Lecture Notes in Computer Science, Vol. 443, pp. 744-751.
13. RAMAN, R. (1990), The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting, in Proc. 10th Conference on Foundations of Software Technology and Theoretical Computer Science, Springer Lecture Notes in Computer Science, Vol. 472, pp. 161-175.
14. SIEGEL, A. (1989), On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications, in Proc. 30th Annual Symposium on Foundations of Computer Science, pp. 20-25.