BIU theory seminar- May 31 : Michal Dory (Haifa) - Distance Computation in Massive Graphs

[Arnold Filtser]

Hello all,

This week (Wed May 31, at 12) we will meet for our theory seminar.

Note that the seminar continues regardless of the strike.

Location: Building 605 room 14.

See you there,

Arnold

https://theory.cs.biu.ac.il/

Speaker: Michal Dory (Haifa)

Title: Distance Computation in Massive Graphs  
Abstract: Computing 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.

The talk is based on joint works with Orr Fischer, Seri Khoury, Dean Leitersdorf and Merav Parter.

[Arnold Filtser]

The seminar starts in one hour!