Dynamic binary search trees: improved lower bounds for the greedy-future Algorithm

DOI10.4230/LIPICS.STACS.2023.53MaRDI QIDQ6615165zbMATH OpenFDO

Authors Yaniv Sadeh, Haim Kaplan

Publication date 8 October 2024

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2023.53

zbMATH Keywords

binary search treesdynamic optimality conjecturegeometric greedygreedy futurelower bounds

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• Hardness amplification for dynamic binary search trees

This page was built for publication: Dynamic binary search trees: improved lower bounds for the greedy-future Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615165)