An approximation algorithm for binary searching in trees (Q633849)

From MaRDI portal
Revision as of 22:50, 3 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
An approximation algorithm for binary searching in trees
scientific article

    Statements

    title
    An approximation algorithm for binary searching in trees (English)
    0 references
    author
    Marco Molinaro
    0 references
    Eduardo Sany Laber
    0 references
    published in
    Algorithmica
    0 references
    publication date
    30 March 2011
    0 references
    Mathematics Subject Classification ID
    68W25
    0 references
    05C05
    0 references
    06A07
    0 references
    68R10
    0 references
    zbMATH DE Number
    5871674
    0 references
    zbMATH Keywords
    binary search
    0 references
    partially ordered sets
    0 references
    trees
    0 references
    approximation algorithms
    0 references
    OpenAlex ID
    W2089672536
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q633849&oldid=35220951"
    Powered by MediaWiki