Constructing small tree grammars and small circuits for formulas (Q2396826): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2016.12.007 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963295241 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1407.4286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bisection algorithm for grammar-based compression of ordered trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds on the length of word chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the length of word chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree compression with top trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-depth tradeoffs for Boolean formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: XML compression via directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-Depth Tradeoffs for Algebraic Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smallest Grammar Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on the Common Subexpression Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressing and indexing labeled trees, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar-Based Compression in a Streaming Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least upper bounds on OBDD sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Small Tree Grammars and Small Circuits for Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of grammar-based compression via recompression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \textit{really} simple approximation of smallest grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2965507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar-based codes: a new class of universal lossless source codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal lossless compression via multilevel pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the OBDD-representation of general Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics on SLP-compressed strings: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameter reduction and automata evaluation for grammar-compressed trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representation of Balanced Parentheses and Static Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representations of Ordinal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on word chains and regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-size bounded alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully linear-time approximation algorithm for grammar-based compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Catalan Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Universal Grammar-Based Code for Lossless Compression of Binary Trees / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2016.12.007 / rank
 
Normal rank

Latest revision as of 09:30, 18 December 2024

scientific article
Language Label Description Also known as
English
Constructing small tree grammars and small circuits for formulas
scientific article

    Statements

    Constructing small tree grammars and small circuits for formulas (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 2017
    0 references
    grammar-based compression
    0 references
    tree compression
    0 references
    arithmetical circuits over semirings
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references