scientific article; zbMATH DE number 7651207

DOI10.4230/LIPIcs.ESA.2020.68MaRDI QIDQ5874540

Omri Weinstein, Victor Lecomte

Publication date: 7 February 2023

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

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

zbMATH Keywords

data structureslower boundsbinary search treesdynamic optimality

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Key-independent optimality
• In Pursuit of the Dynamic Optimality Conjecture
• An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
• O(log log n)-competitive dynamic binary search trees
• Self-adjusting binary search trees
• Lower Bounds for Accessing Binary Search Trees with Rotations
• Self-Organizing Binary Search Trees
• Smooth heaps and a dual view of self-adjusting data structures
• A New Path from Splay to Dynamic Optimality
• Dynamic Optimality—Almost