Succinct indices for path minimum, with applications (Q2362355): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A unifying look at data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal static range reporting in one dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct indexes for strings, binary relations and multilabeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on tree edit distance and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct sampling from discrete distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Dimensional Range Minimum Queries and Fibonacci Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Minima Queries in Dynamic Weighted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On space efficient two dimensional range minimum data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Indices for Path Minimum, with Applications to Path Reporting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal range searching on the RAM, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing on a free tree via complexity-preserving mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / 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: A linear lower bound on index size for text retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform paradigm to succinctly encode various families of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Succinct Representations of Trees? / 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: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Data Structure for Dynamically Maintaining Rooted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct ordinal trees with level-ancestor queries / 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: More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries / 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: Succinct ordinal trees based on tree covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Queries in Weighted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Data Structures for Path Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Path Counting and Reporting in Linear Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for succinct labeled ordinal trees over large alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Minima in Incremental Unrooted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler minimum spanning tree verification algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear verification for spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5705139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921648 / 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 weighted trees supporting path queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inverse-Ackermann type lower bound for online minimum spanning tree verification / 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: Squeezing succinct data structures into entropy bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank

Latest revision as of 02:07, 14 July 2024

scientific article
Language Label Description Also known as
English
Succinct indices for path minimum, with applications
scientific article

    Statements

    Succinct indices for path minimum, with applications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 July 2017
    0 references
    path minimum
    0 references
    semigroup path sum
    0 references
    path reporting
    0 references
    succinct data structures
    0 references
    succinct encoding of directed topology trees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers