BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/280
DTSTAMP:20230914T125917Z
SUMMARY:The Isolation Lemma
DESCRIPTION:Speaker: Girish Varma\n\nAbstract: \nIsolation lemma is a tech
 nique used in randomized algorithms to reduce the number of solutions of
  a problem to one\, should a solution exist. This is achieved by giving ra
 ndom weights to solutions and showing that there is a unique solution of
  minimal weight with constant probability. We will prove this lemma and 
 use it to show that in a computational model called switching networks c
 ounting is not weaker than non determinism.\n \n
URL:https://www.tcs.tifr.res.in/web/events/280
DTSTART;TZID=Asia/Kolkata:20120601T150000
DTEND;TZID=Asia/Kolkata:20120601T163000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR