O(1) time algorithm on BSR for constructing a binary search tree with best frequencies

Limin Xiang, Kazuo Ushijiam, Kai Cheng, Jianjun Zhao, Cunwei Lu

研究成果: ジャーナルへの寄稿Conference article

2 引用 (Scopus)

抄録

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 200412 10 2004

Fingerprint

Random access storage

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

Xiang, Limin ; Ushijiam, Kazuo ; Cheng, Kai ; Zhao, Jianjun ; Lu, Cunwei. / O(1) time algorithm on BSR for constructing a binary search tree with best frequencies. :: Lecture Notes in Computer Science. 2004 ; 巻 3320. pp. 218-225.
@article{52020d1a3de34f7f9030cacdaca37119,
title = "O(1) time algorithm on BSR for constructing a binary search tree with best frequencies",
abstract = "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.",
author = "Limin Xiang and Kazuo Ushijiam and Kai Cheng and Jianjun Zhao and Cunwei Lu",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "3320",
pages = "218--225",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

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 -