Universal retrieval trees

DOI10.1016/0166-218X(85)90031-9zbMath0582.05021OpenAlexW2042131308MaRDI QIDQ1068838

Boris Ya. Ryabko, Rafail E. Krichevsky

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(85)90031-9

zbMATH Keywords

redundancy of a treeretrieval treesubgenera of ants

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) General biology and biomathematics (92B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Optimal key for taxons ordered in accordance with their frequencies
• Nearly optimal binary search trees
• A source matching approach to finding minimax codes
• Comments on "A source matching approach to finding minimax codes" by Davisson, L. D. and Leon-Garcia, A.
• Identification Keys and Diagnostic Tables: A Review
• The Complexity of Trie Index Construction
• Computation of channel capacity and rate-distortion functions

This page was built for publication: Universal retrieval trees