BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/293
DTSTAMP:20230914T125918Z
SUMMARY:Findinding Top k Elements and Heavy Hitters in Data Streams
DESCRIPTION:Speaker: Swagato  Sanyal\n\nAbstract: \nFinding top k items  a
 nd finding heavy hitters in data streams are two well studied problems in 
 streaming algorithms. We shall discuss two deterministic streaming algorit
 hms\, one for each of these two problems.\nReference: Ahmed Metwally\, Div
 yakant Agrawal\, Amr El Abbadi: Efficient Computation of Frequent and Top-
 k Elements in Data Streams. ICDT 2005.\n
URL:https://www.tcs.tifr.res.in/web/events/293
DTSTART;TZID=Asia/Kolkata:20120727T150000
DTEND;TZID=Asia/Kolkata:20120727T163000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR