Parallel algorithms for red--black trees

DOI10.1016/S0304-3975(00)00287-5MaRDI QIDQ5958130zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Heejin Park, Kunsoo Park

Publication date 3 March 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(00)00287-5

zbMATH Keywords

parallel algorithmsbalanced search treesred-black treesdictionary operations

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• A unified approach to the parallel construction of search trees
• Parallel dictionaries using AVL trees
• OPTIMAL OPERATIONS ON RED-BLACK TREES
• scientific article; zbMATH DE number 3843145
• Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3825195 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 108391 (Why is no real title available?)
• A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
• Derivation of a parallel algorithm for balancing binary trees
• On the computational power of pushdown automata
• Parallel Merge Sort
• Relations between Concurrent-Write Models of Parallel Computation
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Updating a balanced search tree in 0(1) rotations
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes

Cited in

(7)

• OPTIMAL OPERATIONS ON RED-BLACK TREES
• Cost-optimal parallel algorithms for constructing B-trees
• Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking
• A note on the largest number of red nodes in red-black trees
• scientific article; zbMATH DE number 3843145 (Why is no real title available?)
• A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
• scientific article; zbMATH DE number 1629860 (Why is no real title available?)

This page was built for publication: Parallel algorithms for red--black trees

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