I will present the proof of the main theorem of the paper (by Iacono and Langerman) presented by Kurt Mehlhorn on 5th October. It states that GreedyASS performs asymptotically as well as any static binary search tree where each search begins from the last search (instead of the root). This is the strongest finger type bound to be proven for binary search trees.