Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm.

Yaniv Sadeh, Haim Kaplan

Browse the full STACS paper archive.