Derivation of a parallel algorithm for balancing binary trees
From MaRDI portal
Publication:3729998
DOI10.1109/TSE.1986.6312885zbMath0596.68017MaRDI QIDQ3729998
S. Sitharama Iyengar, Abha Moitra
Publication date: 1986
Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)
stepwise refinement; parallel algorithm; program transformation; parallel programs; binary search trees; sequential programs
68Q60: Specification and verification (program logics, model checking, etc.)
68N01: General topics in the theory of software
Related Items
Parallel algorithms for red--black trees, Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree, A unified approach to parallel depth-first traversals of general trees, A class of systems with nearly zero distributed simulation overhead, Cost-optimal parallel algorithms for constructing B-trees