Sorting strings and constructing digital search trees in parallel

DOI10.1016/0304-3975(94)00263-0zbMath0877.68033OpenAlexW1968627340MaRDI QIDQ1365679

Uzi Vishkin, Kwan Woo Ryu, Joseph F. Ja'Ja'

Publication date: 9 September 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00263-0

zbMATH Keywords

digital search trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

On demand string sorting over unbounded alphabets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Routing, merging, and sorting on parallel models of computation
• Parallel construction of a suffix tree with applications
• Lexicographically least circular substrings
• Improved deterministic parallel integer sorting
• Optimal algorithms for computing the canonical form of a circular string
• An efficient parallel algorithm for the single function coarsest partition problem
• Faster optimal parallel prefix sums and list ranking
• Searching, Merging, and Sorting in Parallel Computation
• An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
• Probabilistic Parallel Algorithms for Sorting and Selection
• Optimal parallel pattern matching in strings
• Parallel Merge Sort
• Relations between Concurrent-Write Models of Parallel Computation
• Fast canonization of circular strings
• Merging and sorting strings in parallel

This page was built for publication: Sorting strings and constructing digital search trees in parallel