BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260412T101539Z
UID:Seminar-NESTiD-1153@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Othon Michail:MAILTO:Othon.Michail@liverpool.ac.uk
DTSTART:20221110T160000
DTEND:20221110T170000
SUMMARY:Durham-Liverpool synergy Series
DESCRIPTION:Michal Dory: Distance Computation in Massive Graphs \n\nComputing distances in a graph is one of the most fundamental problems in graph algorithms. But how can we solve it when the input graph is too large and cannot be stored in one computer? In this talk, I will discuss a recent line of work that led to extremely fast distributed algorithms for approximating shortest paths, improving exponentially over the state-of-the-art.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1153
LOCATION:
END:VEVENT
END:VCALENDAR