An approximation algorithm for binary searching in trees (Q633849): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Protocols for asymmetric communication channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial alphabetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in random partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision trees for entity identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: On binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Entropy Hotlink Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Huffman coding with unequal letter costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3280457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search in an Ordered Array Having Variable Probe Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear probing and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for asymmetric communication protocols. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of the minimum height decision tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strategy for searching with different access costs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum average cost testing for partially ordered components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary searching with nonuniform costs and its application to text retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal binary search trees with costs depending on the access paths. / rank
 
Normal rank

Latest revision as of 22:50, 3 July 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    binary search
    0 references
    partially ordered sets
    0 references
    trees
    0 references
    approximation algorithms
    0 references
    0 references