Upper Bounds for Maximally Greedy Binary Search Trees

DOI10.1007/978-3-642-22300-6_35zbMath1342.68109arXiv1102.4884OpenAlexW2120181493MaRDI QIDQ5199261

Kyle Fox

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Related Items (6)

Greedy Is an Almost Optimal Deque ⋮ Self-Adjusting Binary Search Trees: What Makes Them Tick? ⋮ A study on splay trees ⋮ Better analysis of binary search tree on decomposable sequences ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ In Pursuit of the Dynamic Optimality Conjecture

This page was built for publication: Upper Bounds for Maximally Greedy Binary Search Trees