Sorting strings and constructing digital search trees in parallel
- 1 February 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 154 (2) , 225-245
- https://doi.org/10.1016/0304-3975(94)00263-0
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Improved deterministic parallel integer sortingInformation and Computation, 1991
- An Optimal $O(\log\log n)$ Time Parallel String Matching AlgorithmSIAM Journal on Computing, 1990
- Faster optimal parallel prefix sums and list rankingInformation and Computation, 1989
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Parallel Merge SortSIAM Journal on Computing, 1988
- Relations between Concurrent-Write Models of Parallel ComputationSIAM Journal on Computing, 1988
- Probabilistic Parallel Algorithms for Sorting and SelectionSIAM Journal on Computing, 1985
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Searching, Merging, and Sorting in Parallel ComputationIEEE Transactions on Computers, 1983
- Lexicographically least circular substringsInformation Processing Letters, 1980