On weighted depths in random binary search trees (Q1800490)

From MaRDI portal
Revision as of 09:36, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On weighted depths in random binary search trees
scientific article

    Statements

    title
    On weighted depths in random binary search trees (English)
    0 references
    author
    Rafik Aguech
    0 references
    Anis Amri
    0 references
    Henning Sulzbach
    0 references
    publication date
    24 October 2018
    0 references
    zbMATH Keywords
    analysis of algorithm
    0 references
    data structures
    0 references
    binary search trees
    0 references
    central limit theorems
    0 references
    contraction method
    0 references
    random probability measures
    0 references
    cites work
    Q4269108
    0 references
    On Random Binary Trees
    0 references
    Q3040305
    0 references
    Quicksort
    0 references
    Q4057549
    0 references
    Q4004056
    0 references
    Q4792912
    0 references
    Q5387683
    0 references

    Identifiers

    Mathematics Subject Classification ID
    60F05
    0 references
    68P05
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6963717
    0 references
    OpenAlex ID
    W2963617856
    0 references
    Wikidata QID
    Q59614041
    0 references
    arXiv ID
    1707.00165
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1800490&oldid=38757378"
    Powered by MediaWiki