Derivation of a parallel algorithm for balancing binary trees

DOI10.1109/TSE.1986.6312885zbMath0596.68017OpenAlexW2057524940MaRDI QIDQ3729998

Abha Moitra, S. Sitharama Iyengar

Publication date: 1986

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tse.1986.6312885

zbMATH Keywords

stepwise refinementparallel algorithmprogram transformationparallel programsbinary search treessequential programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (6)

Parallel dynamic lowest common ancestors ⋮ Cost-optimal parallel algorithms for constructing B-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 ⋮ Parallel algorithms for red--black trees

This page was built for publication: Derivation of a parallel algorithm for balancing binary trees