At the roots of dictionary compression: string attractors
type: Item
instance of: scholarly article
title: At the roots of dictionary compression: string attractors
zbMATH Open document ID: 1418.68085
DOI: 10.1145/3188745.3188814
author: Dominik Kempa
author: Nicola Prezza
published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
publication date: 2019-08-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/1710.10964
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 7097047
zbMATH Keywords: dictionary compression
zbMATH Keywords: compressed data structures
MaRDI profile type: Publication
OpenAlex ID: W2765521106
arXiv ID: 1710.10964
Wikidata QID: Q130958555
Recommended article: Compressed string dictionaries via data-aware subtrie compaction
Recommended article: Sublinear algorithms for approximating string compressibility
Recommended article: Sublinear Algorithms for Approximating String Compressibility
Recommended article: Compact q-Gram Profiling of Compressed Strings
Recommended article: Compressed string-matching in standard Sturmian words
Recommended article: A new class of searchable and provably highly compressible string transformations
Recommended article: Compression of Low Entropy Strings with Lempel--Ziv Algorithms
Recommended article: Compressed data structures for strings. On searching and extracting strings from compressed textual data
description: scientific article; zbMATH DE number 7097047