Sorting strings and constructing digital search trees in parallel

Theoretical Computer Science

Volumn 154, Issue 2, 1996, Pages 225-245

  JáJá, Joseph F ^a,b   Ryu, Kwan Woo ^c   Vishkin, Uzi ^a,b,d  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c Kyungpook National University   (South Korea)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DIGITAL ARITHMETIC; MATHEMATICAL MODELS; OPTIMAL SYSTEMS; PARALLEL ALGORITHMS; PROBLEM SOLVING; SORTING;

ALPHABETS; DIGITAL SEARCH TREES; LEXICOGRAPHIC ORDERING; RANDOMIZED ALGORITHMS; SORTING STRINGS;

DATA STRUCTURES;

EID: 0030569858     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)00263-0     Document Type: Article

References (22)

1. A. V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974) 78-84.
2. M. Ajtai, J. Komlos and E. Szemeredi, An O(n log n) sorting network, Proc. 15Th ACM Symp. on Theory of Computing (1983) 1-9.
3. R.J. Anderson and G.L. Miller, Optimal parallel algorithms for list ranking, 3rd Aegean Workshop in Computing, Lecture Notes in Computer Science, Vol. 319 (Springer, Berlin 1988) 81-90.
4. A. Apostolico, C. Iliopoulos, G.M. Landau, B. Schieber and U. Vishkin, Parallel construction of a suffix tree with applications, Algorithmica 3 (1988) 347-365.
5. O. Berkman and U. Vishkin, Recursive *-tree parallel data structure, Proc. 30th Ann. Symp. Foundations of Computer Science (1989) 196-202. Also, SIAM J. Comput., to appear.
6. O. Berkman and U. Vishkin, Recursive *-tree parallel data structure, Proc. 30th Ann. Symp. Foundations of Computer Science (1989) 196-202. Also, SIAM J. Comput., to appear.
7. P.C.P. Bhatt, K. Diks, T. Hagerup, V.C. Prasad, T. Radzik and S. Saxena, Improved deterministic parallel integer sorting, Inform. and Comput. 94 (1991) 29-47.
8. A. Borodin and J.E. Hopcroft, Routing, merging, and sorting on parallel models of computation, J. Comput. System Sci. 30 (1985) 130-145.
9. K.S. Booth, Lexicographically least circular substrings, Inform. Processing Lett. 10 (1980) 240-242.
10. D. Breslauer and Z. Galil, An optimal O(log log n) time parallel string matching algorithm, SIAM J. Comput. 19 (1990) 1051-1058.
11. R. Cole, Parallel merge sort, SIAM J. Comput. 17 (1988) 770-785.
12. R. Cole and U. Vishkin, Faster optimal prefix sums and list ranking, Inform. and Comput. 81 (1989) 334-352.
13. F.E. Fich, P.L. Ragde and A. Wigderson, Relations between concurrent-write models of parallel computation, SIAM J. Comput. 1 (1988) 606-627.
14. T. Hagerup and O. Petersson, Merging and Sorting strings in parallel, Mathematical Foundations of Computer Science 1992, 17th Internat. Symp., Lecture Notes in Computer Science, Vol. 629 (Springer, Berlin, 1992) 298-306.
15. C.S. Iliopoulos and W.F. Smyth, Optimal algorithms for computing the canonical form of a circular string, personal communication, 1992.
16. J. JáJá, An Introduction to Parallel Algorithms (Addison-Wesley, Reading, MA, 1992).
17. J. JáJá and K.W. Ryu, An efficient parallel algorithm for the single function coarsest partition problem, Proc. 5th ACM Symp. on Parallel Algorithms and Architectures, 1993.
18. S.R. Kosaraju, ,On a multidimensional search problem, Proc. 11th Ann. ACM Symp. Theory of Computing (1979) 67-73.
19. C.P. Kruskal, Searching, merging, and sorting in parallel computation, IEEE Trans. Comput. C-32 (1983) 942-946.
20. R. Reischuk, Probabilistic parallel algorithms for sorting and selection, SIAM J. Comput. 14 (1985) 396-409.
21. Y. Shiloach, Fast canonization of circular strings, J. Algorithms 2 (1981) 107-121.
22. U. Vishkin, Optimal parallel matching in strings, Inform. and Control 67 (1985) 91-113.