scientific article
From MaRDI portal
Publication:2965507
DOI10.4230/LIPIcs.STACS.2014.445zbMath1359.68152arXiv1309.4958MaRDI QIDQ2965507
Publication date: 3 March 2017
Full work available at URL: https://arxiv.org/abs/1309.4958
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Equality Testing of Compressed Strings ⋮ Grammar-Based Tree Compression ⋮ Constructing small tree grammars and small circuits for formulas ⋮ A \textit{really} simple approximation of smallest grammar ⋮ Approximation of grammar-based compression via recompression ⋮ Tree compression using string grammars ⋮ Constant-time tree traversal and subtree equality check for grammar-compressed trees ⋮ One-variable word equations in linear time
This page was built for publication:
