Transforming comparison model lower bounds to the parallel-random-access-machine

Information Processing Letters

Volumn 62, Issue 2, 1997, Pages 103-110

  Breslauer, Dany ^a   Czumaj, Artur ^b   Dubhashi, Devdatt P ^a,c   Meyer Auf Der Heide, Friedhelm ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b UNIVERSITY OF PADERBORN   (Germany)

^c CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

Comparison model; Lower bounds; PRAM model; Ramsey theory

Indexed keywords

EID: 0041728587     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00032-x     Document Type: Article

References (26)

1. M. Ajtai, J. Komlós, W.L. Steiger and Szemerédi, Optimal parallel selection has complexity O(log log n), J. Comput. System Sci. 38 (1989) 125-133.
2. N. Alon and Y. Azar, Finding an approximate maximum, SIAM J. Comput. 18 (2) (1989) 258-267.
3. N. Alon and Y. Azar, Parallel comparison algorithms for approximation problems, Combinatorica 11 (2) (1991) 97-122.
4. A. Apostolico and D. Breslauer, An optimal O(log log n) time parallel algorithm for detecting all squares in a string, SIAM J. Comput., to appear.
5. Y. Azar and N. Pippenger, Parallel selection, Discrete Appl. Math. 27 (1990) 49-58.
6. Y. Azar and U. Vishkin, Tight comparison bounds on the complexity of parallel sorting, SIAM J. Comput. 16 (3) (1987) 458-464.
7. P. Bearne and J. Hastad, Optimal bound for decision problems on the CRCW-PRAM, J. ACM 36 (3) (1989) 643-670.
8. O. Berkman, Y. Matias and P. Ragde. Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs, in: Proc. 3rd Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 709 (Springer, Berlin, 1993).
9. R. Boppana, Optimal separation between concurrent-write parallel machines, in: Proc. 21st ACM Symp. on Theory of Computing (1989) 320-326.
10. A. Borodin and J.E. Hopcroft, Routing, merging and sorting on parallel models of comparison, J. Comput. System Sci. 30 (1985) 130-145.
11. D. Breslauer and D.P. Dubhashi, Tranforming comparison model lower bounds to the parallel-random-access-machine, Tech. Rept. RS-95-10, BRICS, Dept. of Computer Science, University of Aarhus, DK-8000 Aarhus C, Denmark, 1995.
12. D. Breslauer and Z. Galil, A lower bound for parallel string matching, SIAM J. Comput. 21 (5) (1992) 856-862.
13. D. Breslauer and Z. Galil, Finding all periods and initial palindromes of a string in parallel, Algorithmica, to appear.
14. R. Cole, Z. Galil, R. Hariharan, S. Muthukrishnan and K. Park, Parallel two dimensional witness computation, Manuscript, 1993.
15. A. Czumaj and F. Meyer auf der Heide, A lower bound for string matching on PRAM, Tech. Rept. tr-rf-95-011, University of Paderborn, 1995.
16. J. Edmonds, Lower bounds with smaller domain size on concurrent write parallel machines, in: Proc. 6th Ann. Conf. on Structures in Complexity Theory (1991) 322-331.
17. P. Erdös and R. Rado, A combinatorial theorem, J. London Math. Soc. 25 (1950) 249-255.
18. P. Erdös and R. Rado, Combinatorial theorems on classifications of subsets of a given set, Proc. London Math. Soc. 2 (1952) 417-439.
19. F.E. Fich, F. Meyer auf der Heide and A. Wigderson, Lower bounds for parallel random-access machines with unbounded shared memory, Adv. in Comput. Research 4 (1987) 1-15.
20. R.L. Graham, B.L. Rothschild and J.H. Spencer, Ramsey Theory (John Wiley & Sons, New York, 2nd ed., 1990).
21. F. Meyer auf der Heide and A. Wigderson, The complexity of parallel sorting, SIAM J. Comput. 16 (1) (1987) 100-107.
22. S. Moran, M. Snir and U. Manber, Applications of Ramsey's theorem to decision tree complexity, J. ACM 32 (4) (1985) 938-949.
23. P. Ragde, W. Steiger, E. Szemerédi and A. Wigderson, The parallel complexity of element distinctness is Ω(√log n), SIAM J. Discrete Math. 1 (3) (1988) 399-410.
24. B. Schieber and U. Vishkin, Finding all nearest neighbors for convex polygons in parallel: a new lower bound technique and a matching algorithm, Discrete Appl. Math. 29 (1990) 97-111.
25. Y. Shiloach and U. Vishkin, Finding the maximum, merging and sorting in a parallel computation model, J. Algorithms 2 (1981) 88-102.
26. L.G. Valiant, Parallelism in comparison models, SIAM J. Comput. 4 (1975) 348-355.