<i>O</i>(log log <i>n</i>)-competitive dynamic binary search trees (Q3581539)

From MaRDI portal
Revision as of 23:48, 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
<i>O</i>(log log <i>n</i>)-competitive dynamic binary search trees
scientific article

    Statements

    title
    <i>O</i>(log log <i>n</i>)-competitive dynamic binary search trees (English)
    0 references
    publication date
    16 August 2010
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68P10
    0 references
    05C85
    0 references
    68P05
    0 references
    zbMATH DE Number
    5771555
    0 references
    OpenAlex ID
    W4256485853
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3581539&oldid=32249621"
    Powered by MediaWiki