Sorting strings and constructing digital search trees in parallel

DOI10.1016/0304-3975(94)00263-0zbMATH Open0877.68033OpenAlexW1968627340MaRDI QIDQ1365679FDOQ1365679

Authors: Joseph Ja'Ja', Kwan Woo Ryu, Uzi Vishkin 

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

Recommendations

• Optimal parallel string algorithms: sorting, merging and computing the minimum
• Merging and sorting strings in parallel
• Optimal parallel suffix tree construction
• Parallel construction of a suffix tree with applications
• Parallel string sample sort

zbMATH Keywords

digital search trees

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Merging and sorting strings in parallel
• Parallel string sample sort
• On demand string sorting over unbounded alphabets
• Searching in Trees, Series-Parallel and Interval Orders
• Title not available (Why is that?)
• String Processing and Information Retrieval
• Optimal parallel string algorithms: sorting, merging and computing the minimum
• Engineering parallel string sorting

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365679)