scientific article; zbMATH DE number 7651207

DOI10.4230/LIPICS.ESA.2020.68MaRDI QIDQ5874540FDOQ5874540

Authors: Victor Lecomte, O. Weinstein 

Publication date: 7 February 2023

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

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

zbMATH Keywords

data structureslower boundsdynamic optimalitybinary search trees

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

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

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)