TY - JOUR
T1 - O(1) time algorithm on BSR for constructing a binary search tree with best frequencies
AU - Xiang, Limin
AU - Ushijiam, Kazuo
AU - Cheng, Kai
AU - Zhao, Jianjun
AU - Lu, Cunwei
PY - 2004
Y1 - 2004
N2 - Constructing a binary search tree of n nodes with best frequencies needs Ω(n log n) time on RAM, and Ω(log n) time on n-processor EREW, CREW, or CRCW PRAM. In this paper, we propose an O(1) time algorithm on n-processor BSR PRAM for the problem, which is the first constant time solution to the problem on any model of computation.
AB - Constructing a binary search tree of n nodes with best frequencies needs Ω(n log n) time on RAM, and Ω(log n) time on n-processor EREW, CREW, or CRCW PRAM. In this paper, we propose an O(1) time algorithm on n-processor BSR PRAM for the problem, which is the first constant time solution to the problem on any model of computation.
UR - http://www.scopus.com/inward/record.url?scp=13944262190&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=13944262190&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-30501-9_48
DO - 10.1007/978-3-540-30501-9_48
M3 - Conference article
AN - SCOPUS:13944262190
VL - 3320
SP - 218
EP - 225
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
T2 - 5th International Conference, PDCAT 2004
Y2 - 8 December 2004 through 10 December 2004
ER -