Relaxed balance through standard rotations

DOI10.1007/3-540-63307-3_82zbMath1497.68143OpenAlexW1577409284MaRDI QIDQ5096960

Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer

Publication date: 19 August 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_82

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient rebalancing of chromatic search trees
• Amortization results for chromatic search trees, with an application to priority queues
• On-the-fly optimization of data structures
• Amortized Computational Complexity
• EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE

This page was built for publication: Relaxed balance through standard rotations