BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/624
DTSTAMP:20230914T125932Z
SUMMARY:Algebraic Methods in Distributed Graph Algorithms
DESCRIPTION:Speaker: Ami Paz (Technion Israel Institute of Technology\nDepa
rtment of Computer Science\nHaifa 3200\nIsrael)\n\nAbstract: \nAbstract: W
e consider a computer network\, represented by a communication graph: each
node represents a processor and the communication is done synchronously a
long the edges. Can such a network compute its own graph's properties? E.g
.\, how hard is it to list all the triangles in the graph\, to find its sh
ortest cycle\, or to compute all-pairs shortest paths?\n\nWe will give an
introduction to the relevant computation models. Then\, we will discuss so
me recent results showing how to solve these problems faster using algebra
ic techniques (based on a joint work with Keren Censor-Hillel\, Petteri Ka
ski\, Janne H. Korhonen\, Christoph Lenzen and Jukka Suomela).\n
URL:https://www.tcs.tifr.res.in/web/events/624
DTSTART;TZID=Asia/Kolkata:20150915T160000
DTEND;TZID=Asia/Kolkata:20150915T170000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR