Improved parallel construction of wavelet trees and rank/select structures
Author:
- Julian ShunJSJulian Shun
- 1 August 2020
- journal article
- research article
- Published by Elsevier in Information and Computation
- Vol. 273
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- U.S. Department of Energy (DE-SC0018947)
- Adolph C. and Mary Sprague Miller Institute for Basic Research in Science, University of California Berkeley
- National Science Foundation (CCF-1845763)
- National Science Foundation (-1845763)
This publication has 10 references indexed in Scilit:
- Parallel lightweight wavelet tree, suffix array and FM-index constructionJournal of Discrete Algorithms, 2017
- Parallel construction of wavelet trees on multicore architecturesKnowledge and Information Systems, 2016
- Parallel algorithms for Burrows–Wheeler compression and decompressionTheoretical Computer Science, 2014
- Wavelet trees: A surveyComputer Science and Information Systems, 2012
- Rank and select revisited and extendedTheoretical Computer Science, 2007
- Compressed representations of sequences and full-text indexesACM Transactions on Algorithms, 2007
- When indexing equals compressionACM Transactions on Algorithms, 2006
- Improved deterministic parallel integer sortingInformation and Computation, 1991
- Optimal and Sublogarithmic Time Randomized Parallel Sorting AlgorithmsSIAM Journal on Computing, 1989
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974