On space efficient two dimensional range minimum data structures (Q692632): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-011-9499-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071469476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Replacing suffix trees with enhanced suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4061956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest common ancestors: a survey and a new algorithm for a distributed environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Range Minimum Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowest common ancestors in trees and directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lempel-Ziv factorization using less time \& space / 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: Optimal Succinctness for Range Minimum Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: An(other) Entropy-Bounded Compressed Suffix Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cell probe complexity of succinct data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal lower bounds for rank and select indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic orthogonal range queries in OLAP. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix trees with full functionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct data structures for flexible text retrieval systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominance made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Algorithms for Document Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying look at data structures / rank
 
Normal rank

Latest revision as of 23:42, 5 July 2024

scientific article
Language Label Description Also known as
English
On space efficient two dimensional range minimum data structures
scientific article

    Statements

    On space efficient two dimensional range minimum data structures (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 December 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    range minimum query
    0 references
    Cartesian tree
    0 references
    time-space trade-off
    0 references
    indexing model
    0 references
    encoding model
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references