Title: Cooperative Information Exchange over Networks Tom Courtade, UCLA Abstract: The explosion of data networks over the previous two decades has created many challenges in terms of data storage and network communications. In this talk, we discuss the problem of optimal information exchange when data is distributed over a network. In particular, we study the minimum number of communications required to achieve universal recovery, that is, for all nodes in the network to recover all data initially distributed across the network. This problem has applications in the areas of distributed storage and peer-to-peer networks, among others. If time permits, I will discuss some recent work on one-helper problems. Biography: Thomas Courtade received the B.S. degree in Electrical Engineering from Michigan Technological University in 2007, his M.S. degree in Electrical Engineering from UCLA in 2008, and is currently pursuing his Ph.D. there. While at UCLA, he has been the recipient of the UCLA Dean's fellowship and the UCLA University fellowship. His research activities are presently in the area of multiuser information theory, with a particular emphasis on distributed source coding and information exchange. He has authored or coauthored several technical publications and holds 2 U.S. patents. He is a Graduate Student Member of IEEE and SIAM.