抄録
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.
| 元の言語 | 英語 |
|---|---|
| ページ（範囲） | 218-225 |
| ページ数 | 8 |
| ジャーナル | Lecture Notes in Computer Science |
| 巻 | 3320 |
| 出版物ステータス | 出版済み - 12 1 2004 |
| 外部発表 | Yes |
| イベント | 5th International Conference, PDCAT 2004 - , シンガポール 継続期間: 12 8 2004 → 12 10 2004 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
これを引用
O(1) time algorithm on BSR for constructing a binary search tree with best frequencies. / Xiang, Limin; Ushijiam, Kazuo; Cheng, Kai; Zhao, Jianjun; Lu, Cunwei.
：: Lecture Notes in Computer Science, 巻 3320, 01.12.2004, p. 218-225.研究成果: ジャーナルへの寄稿 › Conference article
}
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/12/1
Y1 - 2004/12/1
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
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
ER -