Optimal binary search trees with costs depending on the access paths. (Q1401195): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ricardo A. Baeza-Yates / rank
 
Normal rank
Property / author
 
Property / author: Nivio Ziviani / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Computer Search Trees and Variable-Length Alphabetical Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subquadratic algorithm for constructing approximately optimal binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for optimum binary search trees and minimum weight triangulation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal binary search trees / 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: Q4855565 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(02)00084-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088407423 / rank
 
Normal rank

Latest revision as of 12:12, 30 July 2024

scientific article
Language Label Description Also known as
English
Optimal binary search trees with costs depending on the access paths.
scientific article

    Statements