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 conferencePaper

5 Citations (Scopus)

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 languageEnglish
Pages599-602
Number of pages4
Publication statusPublished - Dec 1 2003
Externally publishedYes
EventParallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings - Chengdu, China
Duration: Aug 27 2003Aug 29 2003

Other

OtherParallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings
CountryChina
CityChengdu
Period8/27/038/29/03

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Science Applications

Cite this

Xiang, L., Ushijiam, K., Zhao, J., Zhang, T., & Tang, C. (2003). O(1) Time Algorithm on BSR for Constructinga Random Binary Search Tree. 599-602. Paper presented at Parallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings, Chengdu, China.