Pattern-avoiding access in binary search trees

DOI10.1109/FOCS.2015.32MaRDI QIDQ6946880zbMATH OpenFDO

Authors K. Mehlhorn, Thatchaphol Saranurak, Parinya Chalermsook, László Kozma, Mayank Goswami

Publication date 5 August 2025

Full work available at URL https://hdl.handle.net/11858/00-001M-0000-0028-8F4C-0

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

Cited in

(2)

• The group access bounds for binary search trees
• Graph theory. Abstracts from the workshop held January 5--10, 2025

This page was built for publication: Pattern-avoiding access in binary search trees

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