BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/923
DTSTAMP:20230914T125943Z
SUMMARY:Equality Alone Does not Simulate Randomness
DESCRIPTION:Speaker: Marc Vinyals\n\nAbstract: \nAbstract: Randomness can 
 provide an exponential saving in the amount of communication needed to sol
 ve a distributed problem\, and the canonical example of this is equality. 
 However\, in all examples where randomness helps having access to an equal
 ity oracle would be enough to solve the problem efficiently. Is equality a
 ll there is to randomness?\nIn this talk we show that equality is not enou
 gh. More precisely\, we exhibit a function that can be solved efficiently 
 using randomized protocols but not with only access to an equality oracle 
 (joint work with Arkadev Chattopadhyay and Shachar Lovett).\n
URL:https://www.tcs.tifr.res.in/web/events/923
DTSTART;TZID=Asia/Kolkata:20181207T171500
DTEND;TZID=Asia/Kolkata:20181207T181500
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR
