Straight-line programs: a practical test (extended abstract)
type: Item
instance of: scholarly article
title: Straight-line programs: a practical test (extended abstract)
zbMATH Open document ID: 1276.68068
author: I. S. Burmistrov
author: A. V. Kozlova
author: E. B. Kurpilyansky
author: A. A. Khvorost
published in: Journal of Mathematical Sciences (New York)
publication date: 2013-11-04T00:00:00Z
full work available at URL: http://hdl.handle.net/10995/27423
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 6222120
zbMATH Keywords: comressed data
zbMATH Keywords: huge data sets
zbMATH Keywords: straight-line programs
zbMATH Keywords: context-free grammars
zbMATH Keywords: Lempel-Ziv algorithm
MaRDI profile type: Publication
OpenAlex ID: W1974927362
cites work: Matching for run-length encoded strings
cites work: The Smallest Grammar Problem
cites work: Collage system: A unifying framework for compressed pattern matching.
cites work: Q4349924
cites work: Processing Compressed Texts: A Tractability Border
cites work: Computing Longest Common Substring and All Palindromes from Compressed Strings
cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
cites work: Randomized search trees
cites work: Q3024796
cites work: Faster subsequence recognition in compressed strings
cites work: A universal algorithm for sequential data compression
cites work: Compression of individual sequences via variable-rate coding
DOI: 10.1007/S10958-013-1394-6
description: scientific article; zbMATH DE number 6222120