On Demand String Sorting over Unbounded Alphabets

DOI10.1007/978-3-540-73437-6_5MaRDI QIDQ3506905zbMATH OpenOpenAlexFDO

Authors Carmel Kent, Dafna Sheinwald, Moshe Lewenstein

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73437-6_5

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• On demand string sorting over unbounded alphabets
• External String Sorting: Faster and Cache-Oblivious
• scientific article; zbMATH DE number 1559569
• Engineering External Memory Induced Suffix Sorting
• Faster suffix sorting

Cited in

(3)

• A VLSI algorithm for sorting variable-length character strings
• Tight bounds for searching a sorted array of strings
• On demand string sorting over unbounded alphabets

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 Q3506905)