Time+Place: Thursday 05/01/2017 10:30 Room 337 Taub Bld.
Title: Graph Algorithms for Distributed Networks
Speaker: Merav Parter - CS-Lecture - NOTE UNUSUAL HOUR http://people.csail.mit.edu/parter/
Affiliation: MIT - EE and CS Dept.


I will describe two branches of my work related to algorithms for 
distributed networks.
The main focus will be devoted for Fault-Tolerant (FT) Network 
The undisrupted operation of structures and services is a crucial 
requirement in modern day communication networks. As the vertices and 
edges of the network may occasionally fail or malfunction, it is 
desirable to make those structures robust against failures.
FT Network Structures are low cost highly resilient structures, 
constructed on top of a given network, that satisfy certain desirable 
performance requirements concerning, e.g., connectivity, distance or 
capacity. We will overview some results on fault tolerant graph 
structures with a special focus on FT Breadth-First-Search.

The second part of the talk will discuss distributed models and 
algorithms for large-scale networks. Towards the end, we will see some 
connections between distributed computing and other areas such as EE and 

Short Bio:
Merav Parter is a Postdoctoral Fellow at MIT hosted by Prof. Nancy 
Lynch. She received a Ph.D. degree in Computer Science from the Weizmann 
Institute of Science under the guidance of Prof. David Peleg. Her thesis 
''The Topology of Wireless Communication and Applications'' won the 
first place Feder prize award for best student work in communication 
technology. Parter is a Rothschild Fellow.  In the past, she was a 
Google European Fellow in Distributed Computing, 2012. Her research 
interests includes fault tolerant graph structures and distributed 
algorithms for large networks. She is also particularly intrigued with 
bridging the gap between Theoretical Computer Science and applied areas 
such as EE and Biology.