Limin Xiang, Kazuo Ushijima, Kai Cheng, Jianjun Zhao, Cunwei Lu. O(1) Time Algorithm on BSR for Constructing a Binary Search Tree with Best Frequencies. In Kim-Meow Liew, Hong Shen, Simon See, Wentong Cai, Pingzhi Fan, Susumu Horiguchi, editors, Parallel and Distributed Computing: Applications and Technologies, 5th International Conference, PDCAT 2004, Singapore, December 8-10, 2004, Proceedings. Volume 3320 of Lecture Notes in Computer Science, pages 218-225, Springer, 2004. [doi]
@inproceedings{XiangUCZL04,
title = {O(1) Time Algorithm on BSR for Constructing a Binary Search Tree with Best Frequencies},
author = {Limin Xiang and Kazuo Ushijima and Kai Cheng and Jianjun Zhao and Cunwei Lu},
year = {2004},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3320&spage=218},
tags = {search},
researchr = {https://researchr.org/publication/XiangUCZL04},
cites = {0},
citedby = {0},
pages = {218-225},
booktitle = {Parallel and Distributed Computing: Applications and Technologies, 5th International Conference, PDCAT 2004, Singapore, December 8-10, 2004, Proceedings},
editor = {Kim-Meow Liew and Hong Shen and Simon See and Wentong Cai and Pingzhi Fan and Susumu Horiguchi},
volume = {3320},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-24013-6},
}