Compressed range minimum queries (Q2297849): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1517.68093 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-030-00479-8_17 / rank
 
Normal rank
Property / published in
 
Property / published in: String Processing and Information Retrieval / rank
 
Normal rank
Property / publication date
 
28 July 2023
Timestamp+2023-07-28T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 28 July 2023 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W32 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7720101 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2954607443 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1902.04427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical compressed suffix trees / 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: LRM-trees: compressed indices, adaptive sorting, and compressed permutations / 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: The Smallest Grammar Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On succinct representations of binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cartesian trees and range minimum queries / 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: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree compression using string grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing Straight-line Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast \(q\)-gram mining on SLP compressed strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of smallest linear tree grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar-Based Tree Compression / 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 Space-Optimal Grammar Compression. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying look at data structures / rank
 
Normal rank

Revision as of 20:57, 21 July 2024

scientific article
Language Label Description Also known as
English
Compressed range minimum queries
scientific article

    Statements

    Compressed range minimum queries (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 February 2020
    0 references
    28 July 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    RMQ
    0 references
    grammar compression
    0 references
    SLP
    0 references
    tree compression
    0 references
    Cartesian tree
    0 references
    0 references
    0 references