On Cartesian trees and range minimum queries (Q528853)

From MaRDI portal
Revision as of 20:33, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On Cartesian trees and range minimum queries
scientific article

    Statements

    title
    On Cartesian trees and range minimum queries (English)
    0 references
    author
    Erik D. Demaine
    0 references
    Gad M. Landau
    0 references
    Oren Weimann
    0 references
    published in
    Algorithmica
    0 references
    publication date
    17 May 2017
    0 references
    zbMATH Keywords
    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

    zbMATH DE Number
    6718306
    0 references
    OpenAlex ID
    W2041783148
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q528853&oldid=36321928"
    Powered by MediaWiki