Group updates for red-black trees

DOI10.1007/3-540-46521-9_21MaRDI QIDQ2728907zbMATH OpenFDO

Authors Sabine Hanke, Eljas Soisalon-Soininen

Publication date 6 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46521-9_21

zbMATH Keywords

group update algorithmindexingred-black search trees

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• Relaxed red-black trees with group updates
• Relaxed multi-way trees with group updates.
• Red-black trees with constant update time
• Parallel algorithms for red--black trees
• scientific article; zbMATH DE number 1218261

Cited in

(2)

• Relaxed multi-way trees with group updates.
• Relaxed red-black trees with group updates

This page was built for publication: Group updates for red-black trees

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