IC Monday Seminar : "Communication Bottlenecks in Computation"
Event details
| Date | 28.03.2011 |
| Hour | 16:15 |
| Speaker | Dr. Arkadev Chattopadhyay, University of Toronto, IC Faculty Candidate |
| Location |
INM 202
|
| Category | Conferences - Seminars |
Abstract: Many central problems of computation, arising in diverse domains, do not apparently have any link to communication. Yet, the difficulty of performing some of these varied computational tasks involve the difficulty of overcoming certain communication bottlenecks among distributed parties. How can one measure the hardness of such bottlenecks? In a classical paper from 1979, Yao introduced the model of communication between two collaborating parties, Alice and Bob, who have 'unbounded computational power'. Communication complexity has grown into a fascinating and vibrant subject. I will talk about my work on extensions of Yao's basic model to multiple parties. We will also investigate the power of randomness and non-determinism in the setting of multi-party communication protocols. These lead to applications on some key problems of computation. The applications come in two flavour: one where our analysis of communication complexity resolves directly questions from computation. Second, insights gained from understanding communication bottlenecks are ported to computation to make progress on major problems. Bio: Arkadev Chattopadhyay is a post-doctoral fellow in the Theory group of the Department of Computer Science at the University of Toronto since September 2009. He was a member of the School of Mathematics at the Institute for Advanced Study in Princeton for the academic year 2008-2009. He obtained his Ph.D in Computer Science from McGill University, Montreal in 2008 and a Bachelor of Technology in Electronics and Electrical Communication engineering from the Indian Institute of Technology, Kharagpur, India in 1994. He has seven years of industrial experience in software and product development for telecommunication systems. His current research interests are in the theory of computation, especially circuit and communication complexity.
Links
Practical information
- General public
- Free
Contact
- Christine Moscioni