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

Research output: Contribution to journalConference articlepeer-review

2 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)218-225
Number of pages8
JournalLecture Notes in Computer Science
Volume3320
DOIs
Publication statusPublished - 2004
Externally publishedYes
Event5th International Conference, PDCAT 2004 - , Singapore
Duration: Dec 8 2004Dec 10 2004

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'O(1) time algorithm on BSR for constructing a binary search tree with best frequencies'. Together they form a unique fingerprint.

Cite this