BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/936
DTSTAMP:20230914T125944Z
SUMMARY:Twenty Questions: Distributional Search Theory
DESCRIPTION:Speaker: Yuval Filmus (Technion - Israel Institute of Technolog
 y\nDepartment of Computer Science\nIsrael)\n\nAbstract: \nAbstract:  I
 ’m thinking of a person in the audience. How long will it take you to fi
 nd whom\, using only Yes/No questions?\nWe consider this puzzle\, which un
 derlies search theory\, with a twist:\nI’m choosing the person according
  to a known distribution\, and your goal is to minimize the *expected* num
 ber of questions.\nHow does the performance of your strategy depend on the
  type of question you’re allowed to ask? On the type of distribution I a
 m allowed to choose? What happens if I can lie?\nJoint work with Yuval Dag
 an (MIT)\, Ariel Gabizon (Zcash)\, Daniel Kane (UCSD)\, Shay Moran (IAS).\
 n
URL:https://www.tcs.tifr.res.in/web/events/936
DTSTART;TZID=Asia/Kolkata:20190129T143000
DTEND;TZID=Asia/Kolkata:20190129T153000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR