On Huang and Wong's algorithm for generalized binary split trees
type: Item
instance of: scholarly article
title: On Huang and Wong's algorithm for generalized binary split trees
author: Marek Chrobak
author: Mordecai J. Golin
author: J. Ian Munro
author: Neal E. Young
published in: Acta Informatica
publication date: 2022-10-24T00:00:00Z
full work available at URL: https://arxiv.org/abs/1901.03783
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7605996
MaRDI profile type: Publication
OpenAlex ID: W4213086851
cites work: Thresholds and optimal binary comparison search trees
cites work: Optimal multiway generalized split trees
cites work: Optimal Search Trees with 2-Way Comparisons
cites work: A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
cites work: On the cost of unsuccessful searches in search trees with two-way comparisons
cites work: Faster construction of optimal binary split trees
cites work: Generalized binary split trees
cites work: Optimal binary split trees
cites work: Optimum binary search trees
cites work: Q4349924
cites work: Optimum split trees
cites work: Median split trees
cites work: Optimal search trees using two-way key comparisons
DOI: 10.1007/S00236-021-00411-Z
Recommended article: Generalized binary split trees
Recommended article: Faster construction of optimal binary split trees
Recommended article: A note on optimal multiway split trees
Recommended article: Construction of optimal binary split trees in the presence of bounded access probabilities
Recommended article: Optimal binary split trees
Recommended article: A parallel algorithm for bisection width in trees
Recommended article: Q5111415
Recommended article: Optimal multiway generalized split trees
Recommended article: On Exact Algorithms for Treewidth
Recommended article: Q3796765
description: scientific article; zbMATH DE number 7605996