An approximation algorithm for binary searching in trees (Q633849)

From MaRDI portal
Revision as of 11:45, 3 July 2023 by Importer (talk | contribs) (‎Created a new 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

    An approximation algorithm for binary searching in trees (English)
    0 references
    0 references
    0 references
    0 references
    30 March 2011
    0 references
    binary search
    0 references
    partially ordered sets
    0 references
    trees
    0 references
    approximation algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references