scientific article; zbMATH DE number 7651167

DOI10.4230/LIPICS.ESA.2020.28MaRDI QIDQ5874496FDOQ5874496

Authors Parinya Chalermsook, Wanchote Po Jiamjitrak

Publication date 7 February 2023

zbMATH Keywords

online algorithmsdata structuresinversionpotential functionbinary search tree

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 1670671 (Why is no real title available?)
• scientific article; zbMATH DE number 5764839 (Why is no real title available?)
• scientific article; zbMATH DE number 6297801 (Why is no real title available?)
• scientific article; zbMATH DE number 7758335 (Why is no real title available?)
• A new path from Splay to dynamic optimality
• A study on splay trees
• An Optimal On-Line Algorithm for K Servers on Trees
• Dynamic Optimality—Almost
• Improved Randomized On-Line Algorithms for the List Update Problem
• Multi-Finger Binary Search Trees
• 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
• Online algorithms: a survey
• Self-adjusting binary search trees: what makes them tick?
• The geometry of binary search trees
• Weighted dynamic finger in binary search trees

Cited in

(2)

• The Geometry of Generalized Binary Search
• Lower Bounds for Accessing Binary Search Trees with Rotations

This page was built for publication:

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