Merav Parter: Graph Algorithms for Distributed Networks

Friday, December 16, 2016 - 1:00pm to 2:30pm
Location: 
32-G631
Speaker: 
Merav Parter
Biography: 
MIT

I will describe two branches of my work related to algorithms for distributed networks. The main focus will be devoted for fault tolerant network design and fault tolerant BFS structures. The second branch concerns distributed algorithms for large-scale networks. Towards the end, we will branch out and see some connections between distributed computing and other areas such as EE and Biology.