Parallel algorithms for red--black trees

DOI10.1016/S0304-3975(00)00287-5zbMath0983.68252OpenAlexW2015255856WikidataQ56060744 ScholiaQ56060744MaRDI QIDQ5958130

Heejin Park, Kun Soo 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 treesdictionary operationsred-black trees

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Updating a balanced search tree in 0(1) rotations
• On the computational power of pushdown automata
• Symmetric binary B-trees: Data structure and maintenance algorithms
• A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• Derivation of a parallel algorithm for balancing binary trees
• Parallel Merge Sort
• Relations between Concurrent-Write Models of Parallel Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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