Derivation of a parallel algorithm for balancing binary trees

DOI10.1109/TSE.1986.6312885MaRDI QIDQ3729998zbMATH OpenOpenAlexFDO

Authors Abha Moitra, S. S. 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

binary search treesparallel algorithmparallel programsprogram transformationsequential programsstepwise refinement

Mathematics Subject Classification ID

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

Recommendations

• A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
• Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree
• Refinement of parallel algorithms
• scientific article; zbMATH DE number 1760065
• Balanced trees inhabiting functional parallel programming

Cited in

(11)

• 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
• A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
• scientific article; zbMATH DE number 1760065 (Why is no real title available?)
• scientific article; zbMATH DE number 1863307 (Why is no real title available?)
• Parallel dynamic lowest common ancestors
• Balanced trees inhabiting functional parallel programming
• Parallel algorithms for red--black trees
• Derivation of efficient parallel programs: An example from genetic sequence analysis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3729998)