Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains

Journal of Algorithms

Volumn 28, Issue 2, 1998, Pages 197-215

  Berkman, Omer ^a,d   Matias, Yossi ^b   Ragde, Prabhakar ^c  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

^d KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346613598     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0905     Document Type: Article

References (39)

1. A. Amir, G. M. Landau, and U. Vishkin, Efficient pattern matching with scaling, in "Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms," 1990, pp. 344-357.
2. P. Beame and J. Håstad, Optimal bounds for decision problems on the CRCW PRAM, in "Proceedings of the 19th ACM Symp. on Theory of Computing," 1987, pp. 83-93.
3. C. Berge, "Graphs and Hypergraphs," North-Holland, Amsterdam, 1973.
4. O. Berkman, "Paradigms for Very Fast Parallel Algorithms," Ph.D. thesis, Tel Aviv University, 1991.
5. O. Berkman, J. JáJá, . Krishnamurthy, R. Thurimella, and U. Vishkin, Top-bottom routing around a rectangle is as easy as computing prefix minima, SIAM J. Comput. 23(3) (1994), 229-465.
6. O. Berkman and Y. Matias, Fast parallel algorithms for minimum and related problems with small integer inputs, Parallel Process. Lett. 5(2) (1995), 223-230.
7. O. Berkman, Y. Matias, and U. Vishkin, Randomized range-maxima in nearly-constant parallel time, Comput. Complexity 2 (1992), 350-373.
8. O. Berkman, B. Schieber, and U. Vishkin, Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values, J. Algorithms 14 (1993), 344-370.
9. O. Berkman and U. Vishkin, On parallel integer merging, Inform Comput. 106(2) (1993), 266-285.
10. R. B. Boppana, Optimal separations between concurrent-write parallel machines, in "Proceedings of the 21st ACM Symposium on Theory of Computing," 1989, pp. 320-326.
11. J. Edmonds, Lower bounds with smaller domain size on concurrent write parallel machines, in "Proceedings of the 6th annual IEEE Conference on Structure in Complexity Theory," 1991.
12. D. Eppstein and Z. Galil, Parallel algorithmic techniques for combinatorial computation, Ann. Rev. Comput. Sci. 3 (1988), 233-283.
13. P. Erdos and R. Rado, Intersection theorems for systems of sets, J. London Math. Soc. 35 (1960), 85-90.
14. F. E. Fich, F. Meyer auf der Heide, and A. Wigderson, Lower bounds for parallel random-access machines with unbounded shared memory, in "Advances for Computing Research," JAI Press, London, 1986.
15. F. E. Fich, P. L. Ragde, and A. Wigderson, Relations between concurrent-write models of parallel computation (preliminary version), in "Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing," 1984, pp. 179-189.
16. F. E. Fich, P. L. Ragde, and A. Wigderson, Simulations among concurrent-write PRAMs, Algorithmica 3 (1988), 43-51.
17. H. N. Gabow, J. L. Bentley, and R. E. Tarjan, Scaling and related techniques for geometry problems, in "Proceedings of the 16th ACM Symposium on Theory of Computing," 1984, pp. 135-143.
18. M. Gereb-Graus and D. Krizanc, The complexity of parallel comparison merging, in "Proceedings of the 28th IEEE Symposium on Foundations of Computer Science," 1987, pp. 195-201. Also SIAM J. Comput., to appear.
19. M. Gereb-Graus and D. Krizanc, The complexity of parallel comparison merging, in "Proceedings of the 28th IEEE Symposium on Foundations of Computer Science," 1987, pp. 195-201. Also SIAM J. Comput., to appear.
20. J. Gil, Y. Matias, and U. Vishkin, Towards a theory of nearly constant time parallel algorithms, in "Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science," October 1991, pp. 698-710.
21. M. T. Goodrich, Triangulating a polygon in parallel, J. Algorithms 10 (1989), 327-351.
22. V. Grolmusz and P. L. Ragde, Incomparability in parallel computation, Discrete Appl. Math. 29 (1990), 63-78.
23. D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13(2) (1984), 338-355.
24. J. JáJá, "Introduction to Parallel Algorithms," Addison-Wesley, Reading, MA, 1992.
25. R. M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, ed.), Vol. A, pp. 869-941, North-Holland, Amsterdam, 1990.
26. C. P. Kruskal, Searching, merging, and sorting in parallel computation, IEEE Trans. Comput. C-32 (1983), 942-946.
27. Y. Matias, "Highly Parallel Randomized Algorithmics," Ph.D. thesis, Tel Aviv University, Israel, 1992.
28. Y. Matias and U. Vishkin, Converting high probability into nearly-constant time - with applications to parallel hashing, in "Proceedings of the 23rd ACM Symposium on Theory of Computing," May 1991, pp. 307-316.
29. F. Meyer auf der Heide and A. Wigderson, The complexity of parallel sorting, in "Proceedings of the 26th IEEE Symposium on Foundations of Computer Science," 1985, pp. 523-540.
30. P. L. Ragde, W. L. 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.
31. V. Ramachandran and U. Vishkin, Efficient parallel triconnectivity in logarithmic parallel time, in "Proceedings of the 3rd Aegean Workshop on Parallel Computing," Lecture Notes in Computer Science, Vol. 33-42, Springer, Berlin, 1988.
32. J. H. Reif, Ed., "A Synthesis of Parallel Algorithms," Morgan-Kaufman, San Mateo, CA, 1993.
33. R. Reischuk, Probabilistic parallel algorithms for sorting and selection, SIAM J. Comput. 14(2) (1985), 396-409.
34. B. Schieber, "Design and Analysis of Some Parallel Algorithms," Ph.D. thesis, Department of Computer Science, Tel Aviv University, 1987.
35. B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput. 17(6) (1988), 1253-1262.
36. Y. Shiloach and U. Vishkin, Finding the maximum, merging, and sorting in a parallel computation model, J. Algorithms 2 (1981), 88-102.
37. M. Snir, On parallel searching, SIAM J. Comput. 14 (1985), 688-707.
38. L. G. Valiant, Parallelism in comparison problems, SIAM J. Comput. 4 (1975), 348-355.
39. U. Vishkin, Structural parallel algorithmics, in "Proceedings of the 18th International Colloquium on Automata, Languages, and Programming," Lecture Notes in Computer Science, Vol. 510, pp. 363-380, Springer, Berlin, 1991.