O(1) Time Algorithm on BSR for Constructing a Binary Search Tree with Best Frequencies - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Limin Xiang' in GoogleThis author has not been identified. Look up 'Kazuo Ushijima' in GoogleThis author has not been identified. Look up 'Kai Cheng' in GoogleThis author has not been identified. Look up 'Jianjun Zhao' in GoogleThis author has not been identified. Look up 'Cunwei Lu' in Google

runs on WebDSL