O(1) Time Algorithm on BSR for Constructinga Random Binary Search Tree

Limin Xiang; Kazuo Ushijiam; Jianjun Zhao; Tianqing Zhang; Changjie Tang

O(1) Time Algorithm on BSR for Constructinga Random Binary Search Tree

Limin Xiang, Kazuo Ushijiam, Jianjun Zhao, Tianqing Zhang, Changjie Tang

Research output: Contribution to conference › Paper › peer-review

Abstract

Constructing a random binary search tree with n nodes needs θ(nlog 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.

Original language	English
Pages	599-602
Number of pages	4
Publication status	Published - Dec 1 2003
Externally published	Yes
Event	Parallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings - Chengdu, China Duration: Aug 27 2003 → Aug 29 2003

Other

Other	Parallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings
Country/Territory	China
City	Chengdu
Period	8/27/03 → 8/29/03

All Science Journal Classification (ASJC) codes

Software
Theoretical Computer Science
Hardware and Architecture
Computer Science Applications

Cite this

@conference{7b8ecb2323204e12bfbd51e213d0ce8e,

title = "O(1) Time Algorithm on BSR for Constructinga Random Binary Search Tree",

abstract = "Constructing a random binary search tree with n nodes needs θ(nlog 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 Jianjun Zhao and Tianqing Zhang and Changjie Tang",

year = "2003",

month = dec,

day = "1",

language = "English",

pages = "599--602",

note = "Parallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings ; Conference date: 27-08-2003 Through 29-08-2003",

}

TY - CONF

T1 - O(1) Time Algorithm on BSR for Constructinga Random Binary Search Tree

AU - Xiang, Limin

AU - Ushijiam, Kazuo

AU - Zhao, Jianjun

AU - Zhang, Tianqing

AU - Tang, Changjie

PY - 2003/12/1

Y1 - 2003/12/1

N2 - Constructing a random binary search tree with n nodes needs θ(nlog 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 random binary search tree with n nodes needs θ(nlog 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=1642570326&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1642570326&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:1642570326

SP - 599

EP - 602

T2 - Parallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings

Y2 - 27 August 2003 through 29 August 2003

ER -

O(1) Time Algorithm on BSR for Constructinga Random Binary Search Tree

Abstract

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this