On the max-entropy rule for a binary search tree
type: Item
instance of: scholarly article
title: On the max-entropy rule for a binary search tree
zbMATH Open document ID: 0394.68048
DOI: 10.1007/BF00264017
author: Yasuichi Horibe
author: Tibor O. H. Nemetz
published in: Acta Informatica
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 94-04
Mathematics Subject Classification ID: 94A17
zbMATH DE Number: 3612455
zbMATH Keywords: Complexity
zbMATH Keywords: Binary Search Tree
zbMATH Keywords: Ordered Keys
zbMATH Keywords: Entropy
zbMATH Keywords: Algorithm
MaRDI profile type: Publication
cites work: Q3941314
cites work: Q5585020
cites work: Q4057549
cites work: Nearly optimal binary search trees
full work available at URL: https://doi.org/10.1007/bf00264017
OpenAlex ID: W1988401877
description: scientific article; zbMATH DE number 3612455