Sorting strings and constructing digital search trees in parallel
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4064468 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
- An efficient parallel algorithm for the single function coarsest partition problem
- Fast canonization of circular strings
- Faster optimal parallel prefix sums and list ranking
- Improved deterministic parallel integer sorting
- Lexicographically least circular substrings
- Merging and sorting strings in parallel
- Optimal algorithms for computing the canonical form of a circular string
- Optimal parallel pattern matching in strings
- Parallel Merge Sort
- Parallel construction of a suffix tree with applications
- Probabilistic Parallel Algorithms for Sorting and Selection
- Relations between Concurrent-Write Models of Parallel Computation
- Routing, merging, and sorting on parallel models of computation
- Searching, Merging, and Sorting in Parallel Computation
- Sorting in \(c \log n\) parallel steps
Cited in
(8)- Optimal parallel string algorithms: sorting, merging and computing the minimum
- scientific article; zbMATH DE number 4172389 (Why is no real title available?)
- On demand string sorting over unbounded alphabets
- Parallel string sample sort
- Merging and sorting strings in parallel
- Searching in Trees, Series-Parallel and Interval Orders
- String Processing and Information Retrieval
- 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)
