scientific article; zbMATH DE number 7651207

DOI10.4230/LIPICS.ESA.2020.68MaRDI QIDQ5874540FDO

Authors Victor Lecomte, O. Weinstein

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/1912.02858

zbMATH Keywords

data structureslower boundsdynamic optimalitybinary search trees

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 1670671 (Why is no real title available?)
• O(log log n)-competitive dynamic binary search trees
• A new path from Splay to dynamic optimality
• An \(O(\log \log n)\)-competitive binary search tree with optimal worst-case access times
• Dynamic Optimality—Almost
• In pursuit of the dynamic optimality conjecture
• Key-independent optimality
• Lower Bounds for Accessing Binary Search Trees with Rotations
• Self-Organizing Binary Search Trees
• Self-adjusting binary search trees
• Smooth heaps and a dual view of self-adjusting data structures
• The geometry of binary search trees

Cited in

(1)

• Dynamic utility-based good deal bounds

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 Q5874540)