On demand string sorting over unbounded alphabets

DOI10.1016/J.TCS.2011.12.001MaRDI QIDQ418735zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

data structuresstring matching

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Algorithms on strings (68W32)

Recommendations

• On Demand String Sorting over Unbounded Alphabets
• External String Sorting: Faster and Cache-Oblivious
• Engineering External Memory Induced Suffix Sorting
• Faster suffix sorting
• scientific article; zbMATH DE number 1559569

Cites work

• scientific article; zbMATH DE number 177571 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 2038766 (Why is no real title available?)
• scientific article; zbMATH DE number 1559569 (Why is no real title available?)
• scientific article; zbMATH DE number 1792107 (Why is no real title available?)
• scientific article; zbMATH DE number 194543 (Why is no real title available?)
• scientific article; zbMATH DE number 6472611 (Why is no real title available?)
• A Space-Economical Suffix Tree Construction Algorithm
• Cache-efficient string sorting using copying
• Dynamic Binary Search
• Linear-time construction of suffix arrays (extended abstract)
• Merging and sorting strings in parallel
• On the sorting-complexity of suffix tree construction
• On-line construction of suffix trees
• Optimal parallel string algorithms: sorting, merging and computing the minimum
• Sorting strings and constructing digital search trees in parallel
• Space efficient linear time construction of suffix arrays
• Suffix Arrays: A New Method for On-Line String Searches

Cited in

(5)

• On Demand String Sorting over Unbounded Alphabets
• A VLSI algorithm for sorting variable-length character strings
• Tight bounds for searching a sorted array of strings
• Near-optimal quantum algorithms for string problems
• Engineering parallel string sorting

Describes a project that uses

Uses Software

• DB2

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)