New Lower Bounds on the Cost of Binary Search Trees
暂无分享,去创建一个
[1] Rudolf Ahlswede,et al. Search Problems , 1987 .
[2] Thomas M. Cover,et al. Some equivalences between Shannon entropy and Kolmogorov complexity , 1978, IEEE Trans. Inf. Theory.
[3] Kurt Mehlhorn. A Best Possible Bound for the Weighted Path Length of Binary Search Trees , 1977, SIAM J. Comput..
[4] Jorma Rissanen. Tight lower bounds for optimum code length , 1982, IEEE Trans. Inf. Theory.
[5] Erik I. Verriest. An achievable bound for optimal noiseless coding of a random variable , 1986, IEEE Trans. Inf. Theory.
[6] E. F. Moore,et al. Variable-length binary encodings , 1959 .
[7] Noga Alon,et al. A lower bound on the expected length of one-to-one codes , 1994, IEEE Trans. Inf. Theory.
[8] Carlo Blundo,et al. New bounds on the expected length of one-to-one codes , 1996, IEEE Trans. Inf. Theory.
[9] Martin Aigner. Combinatorial search , 1988 .
[10] Alfredo De Santis,et al. On Binary Search Trees , 1993, Inf. Process. Lett..