On demand string sorting over unbounded alphabets
type: Item
instance of: scholarly article
title: On demand string sorting over unbounded alphabets
zbMATH Open document ID: 1243.68167
author: Carmel Kent
author: Moshe Lewenstein
author: Dafna Sheinwald
published in: Theoretical Computer Science
publication date: 2012-05-30T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 6039144
zbMATH Keywords: string matching
zbMATH Keywords: data structures
describes a project that uses: DB2
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.12.001
OpenAlex ID: W2117767048
cites work: Q4091421
cites work: Q4527021
cites work: Q5501814
cites work: Suffix trays and suffix trists: structures for faster text indexing
cites work: On the sorting-complexity of suffix tree construction
cites work: Q4692507
cites work: Optimal parallel string algorithms: sorting, merging and computing the minimum
cites work: Merging and sorting strings in parallel
cites work: Sorting strings and constructing digital search trees in parallel
cites work: Q4449231
cites work: Linear-Time Construction of Suffix Arrays
cites work: Q4057549
cites work: Space Efficient Linear Time Construction of Suffix Arrays
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: Dynamic Binary Search
cites work: Q4037442
cites work: Cache-efficient string sorting using copying
cites work: On-line construction of suffix trees
cites work: Q4552049
DOI: 10.1016/J.TCS.2011.12.001
description: scientific article; zbMATH DE number 6039144