BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1275
DTSTAMP:20230921T105045Z
SUMMARY:Communication is Everything. Everything is Communication
DESCRIPTION:Speaker: Raghuvansh Saxena (Microsoft Research)\n\nAbstract: \n
 Communication complexity is the study of how two or more parties with priv
 ate inputs compute a function that depends on all their inputs. The scarce
  resource is communication\, or the number of bits exchanged between the p
 arties. What is amazing about this field is that it has applications not o
 nly in areas where there is actual communication between parties\, such as
  auction design and distributed computing\, but also in areas which superf
 icially may seem completely unrelated to communication\, such as graph str
 eaming and data structures. This is because bounds on communication can of
 ten be translated into bounds on other resources of interest\, such as mem
 ory and the number of wires.\nIn this talk\, I will cover my work in devel
 oping and applying new communication complexity tools to mechanism design\
 , streaming algorithms\, error-resilient circuits\, and interactive coding
 \, with a special focus on the latter. Specifically\, I shall cover two of
  my recent results [EKS20a] and [EKSZ22]\, that develop new codes resilien
 t to a larger fraction of noise than the previous state-of-the-art. In the
  case of [EKSZ22]\, I will also explain why our result opens a whole new p
 aradigm for error correcting codes that was previously unexplored. No prio
 r background will be assumed.\n
URL:https://www.tcs.tifr.res.in/web/events/1275
DTSTART;TZID=Asia/Kolkata:20230221T090000
DTEND;TZID=Asia/Kolkata:20230221T100000
LOCATION:Online with A-201 screening
END:VEVENT
END:VCALENDAR