Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree

DOI10.1007/BF01407411zbMath0638.68059OpenAlexW2000376885MaRDI QIDQ1099627

Shietung Peng, Eliezer Dekel, S. Sitharma Iyenga

Publication date: 1986

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01407411

zbMATH Keywords

parallel algorithmssearch treesMIMD

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (2)

Cost-optimal parallel algorithms for constructing B-trees ⋮ A unified approach to parallel depth-first traversals of general trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Generalized Dictionary Machine for VLSI
• Derivation of a parallel algorithm for balancing binary trees

This page was built for publication: Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree