Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
type: Item
instance of: scholarly article
title: Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
zbMATH Open document ID: 1054.68051
DOI: 10.1016/S0890-5401(02)00013-5
author: Sergio De Agostino
author: Riccardo Silvestri
published in: Information and Computation
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 1967115
zbMATH Keywords: Parallel complexity
zbMATH Keywords: NC algorithms
zbMATH Keywords: SC\(^k\)-completeness
zbMATH Keywords: Data compression
zbMATH Keywords: Dictionary algorithms
MaRDI profile type: Publication
cites work: On Relating Time and Space to Size and Depth
cites work: Towards a complexity theory of synchronous parallel computation
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Efficient parallel algorithms to test square-freeness and factorize strings
cites work: P-complete problems in data compression
cites work: Multilist layering: Complexity and applications
cites work: Complexity theory of parallel time and hardware
cites work: Q4843270
cites work: Q4385525
cites work: A universal algorithm for sequential data compression
cites work: Relations Among Complexity Measures
cites work: On uniform circuit complexity
cites work: Compression of individual sequences via variable-rate coding
Recommended article: BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC
Recommended article: Compressed Dictionaries: Space Measures, Data Sets, and Experiments
Recommended article: Q3367201
Recommended article: Compressed data structures: Dictionaries and data-aware measures
Recommended article: Optimal-Time Dictionary-Compressed Indexes
Recommended article: Q3484345
Recommended article: Q5088899
Recommended article: Q5283997
Recommended article: P-complete problems in data compression
Recommended article: Disk compression of \(k\)-mer sets
description: scientific article; zbMATH DE number 1967115