Surpassing the information theoretic bound with fusion trees
作者：
Highlights：
•
摘要
This paper introduces a new sublogarithmic data structure for searching, the fusion tree. These trees lead to improved worst-case algorithms for sorting and searching, surpassing the limitations of the information theoretic lower bound.
论文关键词：
论文评审过程：Received 23 October 1990, Revised 2 September 1991, Available online 2 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(93)90040-4
