Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Proof of the Weighted Dynamic Finger Theorem by Iacono and Langerman.
Speaker:Bhaskar Ray Chaudhury
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:AG1 Mittagsseminar (others' work)
Visibility:D1, D2, D3, D4, D5, RG1, SWS, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Tuesday, 17 October 2017
Duration:60 Minutes
Building:E1 4
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.
Name(s):Bhaskar Ray Chaudhury
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Keywords:Data Structures, Dynamic Optimality Conjecture
Note:The time taken will be 60 minutes!!
Attachments, File(s):
Created by:Bhaskar Ray Chaudhury, 10/05/2017 05:37 PMLast modified by:Uwe Brahm/MPII/DE, 10/17/2017 07:00 AM
  • Bhaskar Ray Chaudhury, 10/16/2017 02:50 PM
  • Bhaskar Ray Chaudhury, 10/06/2017 02:07 PM
  • Bhaskar Ray Chaudhury, 10/05/2017 05:37 PM -- Created document.