scientific article; zbMATH DE number 7651167

DOI10.4230/LIPIcs.ESA.2020.28MaRDI QIDQ5874496

Parinya Chalermsook, Wanchote Po Jiamjitrak

Publication date: 7 February 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

online algorithmsdata structuresinversionbinary search treepotential function

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The power and limitations of static binary search trees with lazy finger
• Online algorithms: a survey
• A study on splay trees
• An Optimal On-Line Algorithm for K Servers on Trees
• Self-Adjusting Binary Search Trees: What Makes Them Tick?
• Improved Randomized On-Line Algorithms for the List Update Problem
• On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
• On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
• Weighted dynamic finger in binary search trees
• Multi-Finger Binary Search Trees
• A New Path from Splay to Dynamic Optimality
• Dynamic Optimality—Almost

This page was built for publication: