Top tree compression of tries (Q2067669): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2990872128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining information in fully dynamic trees with top trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lempel-Ziv-78 compressed string dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composite Repetition-Aware Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The level ancestor problem simplified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing trees of higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space trade-offs for Lempel-Ziv compressed indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Top Tree Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top Tree Compression of Tries. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Indexing for Packed Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree compression with top trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Access to Grammar-Compressed Strings and Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for orthogonal range searching: I. The reporting case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplex range reporting on a pointer machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed indexing with signature grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Indexed Grammar-Based Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on the Common Subexpression Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing Down Top Trees for Better Worst-Case Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Grammar-Based Self-index / rank
 
Normal rank
Property / cites work
 
Property / cites work: LZ77-Based Self-indexing with Faster Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Compressed Tries through Path Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for Path Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient randomized pattern-matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storage and Retrieval of Individual Genomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed representations of sequences and full-text indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal compressed text indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic index and LZ factorization in compressed space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of finite sets of points in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of algorithms which require nonlinear time to maintain disjoint sets / rank
 
Normal rank

Latest revision as of 18:46, 27 July 2024

scientific article
Language Label Description Also known as
English
Top tree compression of tries
scientific article

    Statements

    Top tree compression of tries (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 January 2022
    0 references
    pattern matching
    0 references
    tree compression
    0 references
    top trees
    0 references
    pointer machine
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers