Run compressed rank/select for large alphabets

J. Fuentes-Sepulveda, J. Karkkainen, D. Kosolobov, S. Puglisi

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Original languageEnglish
Title of host publication2018 Data Compression Conference 27–30 March 2018 Snowbird, Utah, USA
EditorsAli Bilgin, Michael W. Marcellin, Joan Serra-Sagrista, James A. Storer
Number of pages10
PublisherIEEE
Publication date2018
Pages315-324
ISBN (Print)978-1-5386-4884-1
ISBN (Electronic)978-1-5386-4883-4
DOIs
Publication statusPublished - 2018
MoE publication typeA4 Article in conference proceedings
EventData Compression Conference - Snowbird, United States
Duration: 27 Mar 201830 Mar 2018
https://signalprocessingsociety.org/blog/dcc-2019-2019-data-compression-conference

Publication series

NameDCC
ISSN (Electronic)2375-0359

Fields of Science

  • Data structures, Arbitrary constants
  • Large alphabets
  • Optimal time
  • Predecessor problems
  • rank select
  • Run length
  • State of the art
  • succinct, Data compression
  • 113 Computer and information sciences

Cite this