A subquadratic algorithm for constructing approximately optimal binary search trees-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A subquadratic algorithm for constructing approximately optimal binary search trees

Published:1987-12 Issue:4 Volume:8 Page:579-591
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Larmore Lawrence L

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference9 articles.

1. Optimal and near-optimal binary search trees;Allen;Acta Inform.,1982

2. Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees;Bayer,1975

3. Two applications of a probabilistic search technique: Sorting X + Y and building balanced search trees;Fredman,1975

4. Binary search trees: Average and worst case behavior;Guttler;Elektron. Informationsverarb. Kybernet.,1980

5. Subtree Weight Ratios for Optimal Binary Search Trees;Hirschberg,1986

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

1. Operations research applications of dichotomous search;European Journal of Operational Research;2018-03

2. A new genetic approach to construct near-optimal binary search trees;Applied Mathematics and Computation;2007-07

3. Restructuring binary search trees revisited;Information Processing Letters;2005-08

4. Optimal binary search trees with costs depending on the access paths;Theoretical Computer Science;2003-01

5. New Ways to Construct Binary Search Trees;Algorithms and Computation;2003

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP