scientific article; zbMATH DE number 7651167

DOI10.4230/LIPICS.ESA.2020.28MaRDI QIDQ5874496FDOQ5874496

Authors: Parinya Chalermsook, Wanchote Po Jiamjitrak 

Publication date: 7 February 2023

Title of this publication is not available (Why is that?)

zbMATH Keywords

online algorithmsdata structuresinversionpotential functionbinary search tree

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

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

Cited In (2)

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

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)