A unified approach to the parallel construction of search trees
type: Item
instance of: scholarly article
title: A unified approach to the parallel construction of search trees
zbMATH Open document ID: 0833.68063
author: Sajal K. Das
author: Kwang Bae Min
published in: Journal of Parallel and Distributed Computing
publication date: 1995-09-24T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 799684
zbMATH Keywords: bottom-level balancing
zbMATH Keywords: EREW PRAM model
zbMATH Keywords: CREW PRAM model
MaRDI profile type: Publication
full work available at URL: jpdc.1995.1072
OpenAlex ID: W2036280621
DOI: 10.1006/JPDC.1995.1072
Recommended article: A unified approach to parallel depth-first traversals of general trees
Recommended article: Parallel search algorithms for graphs and trees
Recommended article: On a sublinear time parallel construction of optimal binary search trees
Recommended article: Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree
Recommended article: An efficient parallel algorithm for building the separating tree
Recommended article: Parallel construction of succinct trees
Recommended article: Parallel construction of binary trees with near optimal weighted path length
description: scientific article; zbMATH DE number 799684