On demand string sorting over unbounded alphabets
From MaRDI portal
Publication:418735
DOI10.1016/J.TCS.2011.12.001zbMATH Open1243.68167OpenAlexW2117767048MaRDI QIDQ418735FDOQ418735
Authors: Carmel Kent, Moshe Lewenstein, Dafna Sheinwald
Publication date: 30 May 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.001
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Suffix Arrays: A New Method for On-Line String Searches
- A Space-Economical Suffix Tree Construction Algorithm
- Title not available (Why is that?)
- On-line construction of suffix trees
- Space efficient linear time construction of suffix arrays
- Title not available (Why is that?)
- Linear-time construction of suffix arrays (extended abstract)
- Sorting strings and constructing digital search trees in parallel
- Optimal parallel string algorithms: sorting, merging and computing the minimum
- Cache-efficient string sorting using copying
- Title not available (Why is that?)
- Dynamic Binary Search
- Title not available (Why is that?)
- Title not available (Why is that?)
- Merging and sorting strings in parallel
- On the sorting-complexity of suffix tree construction
Cited In (5)
Uses Software
This page was built for publication: On demand string sorting over unbounded alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418735)