A strategy for searching with different access costs.
type: Item
instance of: scholarly article
title: A strategy for searching with different access costs.
zbMATH Open document ID: 1061.68040
DOI: 10.1016/S0304-3975(01)00262-6
author: Eduardo S. Laber
author: Ruy L. Milidiú
author: Artur Alves Pessoa
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1857038
MaRDI profile type: Publication
cites work: On binary search trees
cites work: Search in an Ordered Array Having Variable Probe Cost
cites work: Optimum binary search trees
cites work: A subquadratic algorithm for constructing approximately optimal binary search trees
cites work: Minimum average cost testing for partially ordered components
cites work: Nearly optimal binary search trees
cites work: Binary searching with nonuniform costs and its application to text retrieval
cites work: On an efficient dynamic programming technique of F. F. Yao
full work available at URL: s0304-3975(01)00262-6
OpenAlex ID: W2032297021
description: scientific article; zbMATH DE number 1857038