Constant-time tree traversal and subtree equality check for grammar-compressed trees
type: Item
instance of: scholarly article
title: Constant-time tree traversal and subtree equality check for grammar-compressed trees
zbMATH Open document ID: 1392.68185
author: Markus Lohrey
author: Sebastian Maneth
author: Carl Philipp Reh
published in: Algorithmica
publication date: 2018-07-25T00:00:00Z
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 6910196
zbMATH Keywords: grammar-compressed trees
zbMATH Keywords: tree straight-line programs
zbMATH Keywords: algorithms for compressed trees
describes a project that uses: TreeRePair
MaRDI profile type: Publication
full work available at URL: s00453-017-0331-3
OpenAlex ID: W2738674715
cites work: Q4508365
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: Using multiset discrimination to solve language processing problems without hashing
cites work: The Smallest Grammar Problem
cites work: The complexity of tree automata and XPath on grammar-compressed trees
cites work: Algorithmics on SLP-compressed strings: a survey
cites work: Constructing Small Tree Grammars and Small Circuits for Formulas
cites work: Algorithms on Strings, Trees and Sequences
cites work: Q2965507
cites work: Q5585020
cites work: Parameter reduction and automata evaluation for grammar-compressed trees
cites work: Fully functional static and dynamic succinct trees
cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization
cites work: Automata for XML -- a survey
DOI: 10.1007/S00453-017-0331-3
description: scientific article; zbMATH DE number 6910196