On the Complexity of Searching in Trees: Average-Case Minimization (Q3587405)

From MaRDI portal
Revision as of 22:52, 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
On the Complexity of Searching in Trees: Average-Case Minimization
scientific article

    Statements

    title
    On the Complexity of Searching in Trees: Average-Case Minimization (English)
    0 references
    author
    Tobias Jacobs
    0 references
    Ferdinando Cicalese
    0 references
    Marco Molinaro
    0 references
    Eduardo Sany Laber
    0 references
    publication date
    7 September 2010
    0 references
    zbMATH DE Number
    5780468
    0 references
    OpenAlex ID
    W1932722758
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3587405&oldid=32057017"
    Powered by MediaWiki