O(1) time algorithm on BSR for constructing a random binary search tree

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

doi:10.1109/pdcat.2003.1236373

O(1) time algorithm on BSR for constructing a random binary search tree

Limin Xiang Limin Xiang, Kazuo Ushijiam Kazuo Ushijiam + Show 3 more

https://doi.org/10.1109/pdcat.2003.1236373

Copy DOI

Publication Date: Oct 20, 2003

Citations: 9

Affiliation: Kyushu Sangyo University, Fukuoka Institute of Technology, Sichuan University

#Time Algorithm #CRCW PRAM + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

Constructing a random binary search tree with n nodes needs /spl theta/(nlog n) time on RAM, and /spl omega/(log n) time on n-processor EREW, CREW, or CRCW PRAM. 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.

Full Text