Converting high probability into nearly-constant time - with applications to parallel hashing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 307-316

  Matias, Yossi ^a,b   Vishkin, Uzi ^a,b  

^a UNIVERSITY OF MARYLAND   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; HASH FUNCTIONS; PARALLEL ALGORITHMS;

ACTUAL OPERATION; CONSTANT TIME; HIGH PROBABILITY; TIME UNITS;

PARALLEL PROCESSING SYSTEMS;

EID: 84983648984     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. R.J. Anderson. Parallel algorithms for generating random permutations on a shared memory machine In Proc. 2nd Ann. ACM Symp. on Parallel Algorithms and Architectures, pages 95-102, 1990
2. P. Beame and J. Hastad. Optimal bounds for decision problems on the CRC W PRAM. In Proc. of the 19th Ann. ACM Symp. on Theory of Computing, pages 83-93, 1987
3. O. Berkman, J. JJd., S. Krishnamurthy, R. Thurimella, and U. Vishkin. Some triply-logarithmic parallel algorithms. In Proc. of the 31st IEEE Annual Symp. on Foundation of Computer Science, pages 871-881, 1990. Also in Fast Routing around a rectangle-in preparation
4. O. Berkman and U. Vishkin. Recursive∗-Tree parallel data-structure. In Proc. of the 30th IEEE Annual Symp. on Foundation of Computer Science, pages 196-202, 1989
5. J.L. Carter and M.N. Wegman. Universal classes of hash functions. J. Computer and System Sciences, 18:143-154, 1979
6. R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking Information and Controlj 70:32-53, 1986
7. R. Cole and U. Vishkin. Faster optimal parallel prefix sums and list ranking. Information and Computation, 81:334-352, 1989
8. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyerven der Heide, H. Rohnert, and R.E. Tarjan Dynamic perfect hashing: upper and lower bounds. In Proc. of the 29th IEEE Annual Symp on Foundation of Computer Science, pages 524-531, 1988
9. M. Dietzfelbinger and F. Meyer ven der Heide. An optimal parallel dictionary. In Proc. 1st Ann. ACM Symp. on Parallel Algorithms and Architectures, pages 360-368, 1989
10. M. Dietzfelbinger and F. Meyer ven der Heide. A new universal class of hash functions and dynamic hashing in real time. In Proc. of 1 ith ICALP, Springer LNCS 443, pages 6-19, 1990
11. M. L. Fredman, J. Kom16s, and E. Szemer6di. Storing a sparse table with O(1) worst case access time J. of the Association for Computing Machinery, 31:538-544, 1984
12. J. Gil. Fastload balancing on PRAM. Manuscript, 1990
13. J. Giland Y. Matias. Fast hashing on a PRAM In Proc. of the 2nd Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 271-280, 1991
14. J. Gil, Y. Matias, and U. Vishkin. A fast parallel dictionary. In preparation, 1990
15. J. Gil, F. Meyer ven der Heide, and A. Wigderson Not all keys can be hashed in constant time. In Proc. of the 22nd Ann. ACM Symp. on Theory of Computing, pages 244-253, 1990
16. J. Gil and L. Rudolph. Counting and packing in parallel. In Proc. 1986 International Conference on Parallel Processing, pages 1000-1002, 1986
17. T. Hagerup. Constant-Time parallel integer sorting In thzs proceedings, 1991
18. T. Hagerup. Fast parallel generation of random permut at ions, In to be presented at the 18th ICALP, 1991
19. T. Hagerup and M. Nowak. Parallel retrieval of scattered information. In Proc. of 16th ICALP, Springer LNCS 972, pages 439-450, 1989
20. Y. Han. Matching partition a linked list and its optimization. In Proc. 1st Ann. ACM Symp. on Parallel Algorithms and Architectures, pages 246-253, 1989
21. J. Jai. Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1991
22. D.E. Knuth. The art of computer programming, volume 3, Sorting and searching. Addison-Wesley, Reading, 1973
23. C, P. Kruskal. Searching, merging, and sorting in parallel computation. IEEE Trans. on Computers, C-32:942-946, 1983
24. Y. Matias and U. Vishkin. On parallel hashing and integer sorting. In Proc. of 17th ICALP, Springer LNCS 443, pages 729-743, 1990. Also to appear in J. of Algorithms
25. G.L. Miller and J.H. Reif. Parallel tree contraction and its application. In Proc. of the 26th IEEE Annual Symp. on Foundation of Computer Science, pages 478-489, 1985
26. P, Ragde. The parallel simplicity of compaction and chaining. In Proc. of 17th ICALP, Springer LNCS 443, pages 744-751, 1990
27. S. Rajasekaran and J.H. Reif. Optimal and sublogarithmic time randomized parallel sorting algorithms SIAM J. Comput., 18:594-607, 1989
28. R. Raman. The power of collision: Randomized parallel algorithms for chaining and integer sorting In Proc. of the 10th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTt3TCS), December 1990. Also in TR-336, Univ. of Rochester Computer Science Dept., revised January 1991
29. R. Raman. Optimal sub-logarithmic time integer sorting on a CRCW PRAM (note). Submitted for publication, 1991
30. J .H. Reif. An optimal parallel algorithm for integer sorting. In Proc. of the 26th IEEE Annual Symp on Foundation of Computer Science, pages 496-503, 1985
31. G.E. Shannon. Optimal on-line load balancing. In Proc. Ist Ann. ACM Symp. on Parallel Algorithms and Architectures, pages 235-245, 1989
32. U. Vishkin. Randomized speed-ups in parallel computations In Proc. of the 16th Ann. ACM Symp on Theory of Computing, pages 230-239, 1984