BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/674
DTSTAMP:20230914T125933Z
SUMMARY:Computing on a Full Memory
DESCRIPTION:Speaker: Bruno Loff (Charles University\nDepartment of Computer
  Science\nMalosranske nam. 25\, 118 00 Praha 1\nCzech Republic)\n\nAbstrac
 t: \nAbstract: Suppose that you have log(n) bits of free working memory\, 
 plus an additional poly(n) bits of auxiliary memory which is *full*. Meani
 ng\, the auxiliary memory has some contents\, and you are allowed to read/
 write into it\, but you must promise that by the time your computation is 
 done\, the contents of the auxiliary memory have been restored to their or
 iginal state.\n\nWhile it may appear at first that the full memory is usel
 ess\, it turns out that you can make a non-trivial use of it to boost the 
 power of your computation.\n\nI will show that directed connectivity can b
 e computed in this way (with log(n) working space and poly(n) full memory)
 \, and related results around this problem.\n \n
URL:https://www.tcs.tifr.res.in/web/events/674
DTSTART;TZID=Asia/Kolkata:20160420T160000
DTEND;TZID=Asia/Kolkata:20160420T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR