Generalized binary split trees-Reference-Cited by-同舟云学术

Generalized binary split trees

Published:1984-05 Issue:1 Volume:21 Page:113-123
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Stephen Huang Shou -Hsuan,Wong C. K.

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00289143.pdf

Reference9 articles.

1. Comer, D.: A Note on Median Split Trees. ACM Trans. on Programming Languages and Systems, 2 (1), pp. 129?133 (1980)

2. Gotlieb, L., Wood, D.: The Construction of Optimal Multiway Search Trees and the Monotonicity Principle. McMaster University, Computer Science Technical Report 79-CS-18, Canada, 1979

3. Huang, S., Wong, C.K.: Optimal Binary Split Trees. Technical Report #UH-CS-82-8, Department of Computer Science, University of Houston, May 1982, to appear in J. Algorithms

4. Knuth, D.E.: The Art of Computer Programming, Vol. 1. Reading, Mass.: Addison-Wesley 1968

5. Knuth, D.E.: Optimal Binary Search Trees. Acta Informat. 1, 14?25 (1971)

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Classification via Two-Way Comparisons (Extended Abstract);Lecture Notes in Computer Science;2023

2. On Huang and Wong’s algorithm for generalized binary split trees;Acta Informatica;2022-02-14

3. A Simple Algorithm for Optimal Search Trees with Two-way Comparisons;ACM Transactions on Algorithms;2022-01-31

4. On the cost of unsuccessful searches in search trees with two-way comparisons;Information and Computation;2021-12

5. Twenty (simple) questions;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19