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

Authors:
Limin Xiang;Kazuo Ushijiam;Kai Cheng;Jianjun Zhao;Cunwei Lu
Affiliations:
Department of Social Information Systems, Kyushu Sangyo University, Fukuoka, Japan;Department of Social Information Systems, Kyushu Sangyo University, Fukuoka, Japan;Department of Social Information Systems, Kyushu Sangyo University, Fukuoka, Japan;Department of Computer Science and Engineering, Fukuoka Institute of Technology, Fukuoka, Japan;Department of Computer Science and Engineering, Fukuoka Institute of Technology, Fukuoka, Japan
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 10
Cited 0

On the Generation of Random Binary Search Trees

SIAM Journal on Computing
Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals

IEEE Transactions on Parallel and Distributed Systems
Parallel computation: models and methods

Parallel computation: models and methods
ANSV problem on BSRs

Information Processing Letters
An Efficient Implementation for the BROADCAST Instruction of BSR+

IEEE Transactions on Parallel and Distributed Systems
A theorem on the relation between BSRk amd BSR+

Information Processing Letters
Rearranging scattered information on BSR

Information Processing Letters
On Time Bounds, the Work-Time Scheduling Principle, and Optimality for BSR

IEEE Transactions on Parallel and Distributed Systems
An Optimal Implementation of Broadcasting with Selective Reduction

IEEE Transactions on Parallel and Distributed Systems
Optimal Parallel Merging Algorithms on BSR

ISPAN '00 Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks

Quantified Score

Hi-index	0.00

Visualization

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.