Today's exponentially increasing data volumes and the high cost of storage make
compression essential for the Big Data industry. Although research has concentrated on …

Segmented sort, as a generalization of classical sort, orders a batch of independent
segments in a whole array. Along with the wider adoption of manycore processors for HPC …

We present parallel lightweight algorithms to construct wavelet trees, rank and select
structures, and suffix arrays in a shared-memory setting. The work and depth of our first …

Suffix arrays are fundamental full‐text index data structures of importance to a broad
spectrum of applications in such fields as bioinformatics, Burrows–Wheeler transform‐based …

This dissertation focuses on two fundamental sorting problems: string sorting and suffix
sorting. The first part considers parallel string sorting on shared-memory multi-core …

Graph partitioning is a common computational phase in many application domains,
including social network analysis, data mining, scheduling, and VLSI design. The significant …

Many real-world problems require a sorting operation as part of their efficient solution. Some
examples of this are real-time plasma diagnostic, image re-ranking, and suffix array …

For full-text indexing of massive data, the suffix and LCP (longest common prefix) arrays
have been recognized as fundamental data structures, and there are at least two needs in …

Large scale data sets from the web, social networks, and bioinformatics are widely available
and can often be rep-resented by strings and suffix arrays are highly efficient data structures …

Sorting is one of the fundamental operations of Computer Science. Many problems, such as
plasma real-time diagnostic, image re-ranking, and suffix array construction, require that we …