An \(O(\log \log n)\)-competitive binary search tree with optimal worst-case access times

From MaRDI portal

(Redirected from Publication:3569877)
An \(O(\log \log n)\)-competitive binary search tree with optimal worst-case access times

Jump to:navigation, search

MaRDI QID[[Item:|]]

Authors

No records found

Cited in

No records found

This page was built for publication:

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_%5C(O(%5Clog_%5Clog_n)%5C)-competitive_binary_search_tree_with_optimal_worst-case_access_times&oldid=81051230"