Lower Bounds for Accessing Binary Search Trees with Rotations (Q3829056)

From MaRDI portal
Revision as of 20:03, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Lower Bounds for Accessing Binary Search Trees with Rotations
scientific article

    Statements

    title
    Lower Bounds for Accessing Binary Search Trees with Rotations (English)
    0 references
    author
    Robert Wilber
    0 references
    publication date
    1989
    0 references
    zbMATH Keywords
    data structures
    0 references
    binary search tree
    0 references
    rotation
    0 references
    lower bound
    0 references

    Identifiers

    DOI
    10.1137/0218004
    0 references
    Mathematics Subject Classification ID
    68P05
    0 references
    68M20
    0 references
    68P10
    0 references
    zbMATH DE Number
    4104369
    0 references
    OpenAlex ID
    W2016857845
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3829056&oldid=31452585"
    Powered by MediaWiki