Weighted dynamic finger in binary search trees

DOI10.1137/1.9781611974331.ch49zbMath1410.68101arXiv1810.01785OpenAlexW2949923424MaRDI QIDQ4575627

Stefan Langerman, John Iacono

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (7)

On minimum generalized Manhattan connections ⋮ Better analysis of binary search tree on decomposable sequences ⋮ Unnamed Item ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ Belga B-trees ⋮ Multi-Finger Binary Search Trees ⋮ Competitive Online Search Trees on Trees

This page was built for publication: Weighted dynamic finger in binary search trees