BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/957
DTSTAMP:20230914T125944Z
SUMMARY:A Data Structure Lower Bound and The Peak-to-Average Lemma
DESCRIPTION:Speaker: Suhail Sherif\n\nAbstract: \nAbstract: In a recent bre
 akthrough work Kasper Green Larsen\, Omri Weinstein and Huacheng Yu [1] pr
 oved the first superlogartithmic lowerbound for a dynamic data structure p
 roblem. En route to this\, they proved an interesting lemma that they term
 ed the Peak-to-Average lemma. This lemma looks like it can be of independe
 nt interest\, and will be the focus of this talk. We will look at the high
  level ideas behind the lower bound\, why the lemma is needed and why the 
 lemma is true.\n[1] https://arxiv.org/abs/1703.03575\n
URL:https://www.tcs.tifr.res.in/web/events/957
DTSTART;TZID=Asia/Kolkata:20190412T171500
DTEND;TZID=Asia/Kolkata:20190412T181500
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR