On Cartesian trees and range minimum queries (Q528853): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-012-9683-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041783148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache-oblivious data structures for orthogonal range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal on-line decremental connectivity in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Range Minimum Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache-Oblivious B-Trees / 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: Recursive Star-Tree Parallel Data Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache-oblivious string dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum spanning tree algorithm with inverse-Ackermann type complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252293 / 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: Q4633847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Edge-Deletion Problem / 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: Surpassing the information theoretic bound with fusion trees / 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: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Schemes for Flow and Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear verification for spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal minimum spanning tree algorithm / 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: Q2934690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549658 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:33, 13 July 2024

scientific article
Language Label Description Also known as
English
On Cartesian trees and range minimum queries
scientific article

    Statements

    On Cartesian trees and range minimum queries (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 May 2017
    0 references
    range minimum query
    0 references
    lowest common ancestor
    0 references
    Cartesian tree
    0 references
    cache-oblivious
    0 references
    bottleneck paths
    0 references
    minimum spanning tree verification
    0 references
    partial sums
    0 references

    Identifiers