The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
type: Item
instance of: scholarly article
title: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
zbMATH Open document ID: 0646.68081
DOI: 10.1007/BF01762121
author: Uzi Vishkin
author: Richard Cole
published in: Algorithmica
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4055067
zbMATH Keywords: centroid decomposition
zbMATH Keywords: list ranking
zbMATH Keywords: parallel algorithm
zbMATH Keywords: EREW PRAM algorithm
zbMATH Keywords: expression tree
MaRDI profile type: Publication
cites work: Q3798228
cites work: Optimal parallel generation of a computation tree form
cites work: Deterministic coin tossing with applications to optimal parallel list ranking
cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
cites work: Faster optimal parallel prefix sums and list ranking
cites work: Q3761691
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: An Efficient Parallel Biconnectivity Algorithm
cites work: On efficient parallel strong orientation
cites work: On the Parallel Evaluation of Certain Arithmetic Expressions
full work available at URL: https://doi.org/10.1007/bf01762121
OpenAlex ID: W2034282023
description: scientific article; zbMATH DE number 4055067