Algorithmica

, Volume 3, Issue 1, pp 329–346

The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time

  • Richard Cole
  • Uzi Vishkin
Article

DOI: 10.1007/BF01762121

Cite this article as:
Cole, R. & Vishkin, U. Algorithmica (1988) 3: 329. doi:10.1007/BF01762121

Abstract

A new general parallel algorithmic technique for computations on trees is presented. In particular, it provides the firstn/logn processor,O(logn)-time deterministic EREW PRAM algorithm for expression tree evaluation. The technique solves many other tree problems within the same complexity bounds.

Key words

Expression treeParallel algorithmPRAMCentroid decompositionList ranking

Copyright information

© Springer-Verlag New York Inc. 1988

Authors and Affiliations

  • Richard Cole
    • 1
  • Uzi Vishkin
    • 2
  1. 1.Department of Computer Science, Courant Institute of Mathematical SciencesNew York UniversityNew YorkUSA
  2. 2.Computer Science Department, Sackler Faculty of Exact SciencesTel Aviv UniversityTel AvivIsrael