Combining Binary Search Trees

DOI10.1007/978-3-642-39206-1_33zbMath1336.68046arXiv1304.7604OpenAlexW1553603221MaRDI QIDQ5326577

Erik D. Demaine, Özgür Özkan, Stefan Langerman, John Iacono

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (5)

A study on splay trees ⋮ The power and limitations of static binary search trees with lazy finger ⋮ Belga B-trees ⋮ Multi-Finger Binary Search Trees ⋮ In Pursuit of the Dynamic Optimality Conjecture

This page was built for publication: Combining Binary Search Trees