Path balance heuristic for self-adjusting binary search trees

DOI10.1007/3-540-60692-0_59MaRDI QIDQ2956694zbMATH OpenOpenAlexFDO

Authors R. Balasubramanian, Venkatesh Raman

Publication date 19 January 2017

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

Full work available at URL https://doi.org/10.1007/3-540-60692-0_59

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Recommendations

• Self-adjusting binary search trees: what makes them tick?
• Self-adjusting binary search trees
• Balancing binary trees by internal path reduction
• scientific article; zbMATH DE number 140483
• Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost

Cited in

(7)

• relaxed balance for search trees with local rebalancing
• Fibonacci BSTs: a new balancing method for binary search trees
• Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying
• Height balance distribution of search trees
• Self-adjusting binary search trees: what makes them tick?
• scientific article; zbMATH DE number 140483 (Why is no real title available?)
• Improved bounds for multipass pairing heaps and path-balanced binary search trees

This page was built for publication: Path balance heuristic for self-adjusting binary search trees

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