On the max-entropy rule for a binary search tree

DOI10.1007/BF00264017zbMATH Open0394.68048OpenAlexW1988401877MaRDI QIDQ1252720

Yasuichi Horibe, Tibor O. H. Nemetz

Publication date: 1979

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264017

zbMATH Keywords

AlgorithmComplexityEntropyBinary Search TreeOrdered Keys

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Measures of information, entropy (94A17) Discrete mathematics in relation to computer science (68R99) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Cites Work

• Nearly optimal binary search trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Related Items (1)

Optimal binary search trees

This page was built for publication: On the max-entropy rule for a binary search tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1252720)