BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/517
DTSTAMP:20230914T125927Z
SUMMARY:Communication Complexity
DESCRIPTION:Speaker: Arkadev Chattopadhyay\n\nAbstract: \nAbstract: Alice a
 nd Bob want to compute jointly/collaboratively a function. They are both s
 uper-computers. However\, part of the input is with Alice and the other pa
 rt is with Bob. How many bits do they *need* to communicate with each othe
 r\, in the worst case\, so that they can compute the function?\n\nIt turns
  out that the above puzzle and some of its variants have deep connection w
 ith all sorts of important questions: can we process large data using smal
 l memory? can we have efficient data-structures for a variety of problems?
  does there exist parallel algorithms for factoring?... and many others...
 \n\nWe will introduce the basic model of communication and briefly go thro
 ugh some of these exciting connections.\n
URL:https://www.tcs.tifr.res.in/web/events/517
DTSTART;TZID=Asia/Kolkata:20140704T143000
DTEND;TZID=Asia/Kolkata:20140704T153000
LOCATION:AG-80
END:VEVENT
END:VCALENDAR