|Time+Place:||Sunday 14/06/2015 13:30 Room Class 4, Floor 1, Taub Bld.|
|Title:||Fast Approximate Max Flow Computation|
|Speaker:|| Christoph Lenzen - SPECIAL LECTURE - Note unusual time and place
|| Affiliation: || MPI for Informatics in Saarbruecken, Germany
|| Host: || Keren Censor-Hillel
The max flow problem is one of the most fundamental and well-studied network problems. In this talk, I will revisit it from the perspective of distributed algorithms. For decades, the million-dollar question here has been whether there *is* a fast distributed algorithm or one should rather collect all information at a single location and apply an old school centralized algorithm. On the way to answering this question, we will get to see several of the brilliant ideas that have come up recently on this evergreen among the classic graph problems. The talk is tailored to a general CS audience; don't worry if you're not familiar with the topic - come to enjoy the show! Short Bio: Christoph Lenzen completed his Ph.D. studies at ETH Zurich in December 2010 and was awarded the ETH medal for his thesis. Subsequently, he was postdoctoral fellow at HUJI (2011), Weizmann (2012), and MIT (2013-2014). In July 2014, he moved to his present position as group leader at MPI for Informatics in Saarbruecken, Germany. His research interests cover all kinds of distributed systems, with a current focus on fault-tolerant hardware and distributed network algorithms.