Tree compression using string grammars
type: Item
instance of: scholarly article
title: Tree compression using string grammars
title: Tree Compression Using String Grammars
zbMATH Open document ID: 1384.68016
zbMATH Open document ID: 1370.68062
DOI: 10.1007/978-3-662-49529-2_44
DOI: 10.1007/S00453-017-0279-3
author: Moses Ganardi
author: Danny Hucke
author: Markus Lohrey
author: Eric Noeth
published in: Algorithmica
published in: LATIN 2016: Theoretical Informatics
publication date: 2018-04-11T00:00:00Z
publication date: 2016-05-03T00:00:00Z
full work available at URL: https://arxiv.org/abs/1504.05535
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 6858533
zbMATH DE Number: 6576698
zbMATH Keywords: grammar-based compression
zbMATH Keywords: tree compression
zbMATH Keywords: expression evaluation
describes a project that uses: TreeRePair
MaRDI profile type: Publication
OpenAlex ID: W3155540153
OpenAlex ID: W1488047477
arXiv ID: 1504.05535
cites work: A bisection algorithm for grammar-based compression of ordered trees
cites work: Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs
cites work: On the Complexity of Numerical Analysis
cites work: Q3971277
cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
cites work: Representing trees of higher degree
cites work: Tree compression with top trees
cites work: Random Access to Grammar-Compressed Strings and Trees
cites work: XML compression via directed acyclic graphs
cites work: Database Programming Languages
cites work: Faster Fully Compressed Pattern Matching by Recompression
cites work: Nondeterministic \(NC^1\) computation
cites work: The Smallest Grammar Problem
cites work: A Brief History of Strahler Numbers
cites work: Compressing and indexing labeled trees, with applications
cites work: The number of registers required for evaluating arithmetic expressions
cites work: Constructing small tree grammars and small circuits for formulas
cites work: Q4408477
cites work: Uniform constant-depth threshold circuits for division and iterated multiplication.
cites work: Constructing Small Tree Grammars and Small Circuits for Formulas
cites work: The complexity of tree automata and XPath on grammar-compressed trees
cites work: Ultra-succinct representation of ordered trees with applications
cites work: Approximation of grammar-based compression via recompression
cites work: A \textit{really} simple approximation of smallest grammar
cites work: Q2965507
cites work: Functional programs as compressed data
cites work: Q2778879
cites work: Leaf languages and string compression
cites work: The Compressed Word Problem for Groups
cites work: Grammar-Based Tree Compression
cites work: Parameter reduction and automata evaluation for grammar-compressed trees
cites work: Isomorphism of regular trees and words
cites work: Succinct representation of balanced parentheses and static trees
cites work: A fully linear-time approximation algorithm for grammar-based compression
cites work: Q3388524
cites work: PP is as Hard as the Polynomial-Time Hierarchy
cites work: Q4393484
description: scientific article; zbMATH DE number 6576698
alternative label: Tree Compression Using String Grammars