BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/382
DTSTAMP:20230914T125922Z
SUMMARY:Asymmetric Communication Complexity and Its Application
DESCRIPTION:Speaker: Sagnik  Mukhopadhyay\n\nAbstract: \nWe consider two-pa
 rty communication complexity\, the ``asymmetric case''\, when the input si
 zes of the two players differ significantly. Most of previous work on comm
 unication complexity only considers the total number of bits sent\, but we
  will see trade-offs between the number of bits the first player sends and
  the number of bits the second sends. These types of questions are closely
  related to the complexity of static data structure problems in the cell p
 robe model (which we will not discuss in this talk). We will see a simple
   application of this in membership problem.\nRef: \n(1) Peter Bro Milt
 ersen\, Noam Nisan\, Shmuel Safra\, Avi Wigderson: On Data Structures 
 and Asymmetric Communication Complexity. J. Comput. Syst. Sci. 57(1): 37-
 49 (1998)\n \n(2) Eyal Kushilevitz\, Noam Nisan: Communication complexity
 . Cambridge Univ press: 53- 56 (1997)\n\n\n\n \n
URL:https://www.tcs.tifr.res.in/web/events/382
DTSTART;TZID=Asia/Kolkata:20130712T143000
DTEND;TZID=Asia/Kolkata:20130712T160000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR