BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Monday Seminar : "Communication Bottlenecks in Computation"
DTSTART:20110328T161500
DTSTAMP:20260509T114832Z
UID:32283f51d697de7bf28605808368db346aed45473639110694e21857
CATEGORIES:Conferences - Seminars
DESCRIPTION:Dr. Arkadev Chattopadhyay\, University of Toronto\, IC Faculty
  Candidate\nAbstract: Many central problems of computation\, arising in di
 verse domains\, do not apparently have any link to communication. Yet\, th
 e difficulty of performing some of these varied computational tasks involv
 e the difficulty of overcoming certain communication bottlenecks among dis
 tributed parties. How can one measure the hardness of such bottlenecks? In
  a classical paper from 1979\, Yao introduced the model of communication b
 etween two collaborating parties\, Alice and Bob\, who have 'unbounded com
 putational power'. Communication complexity has grown into a fascinating a
 nd 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 randomne
 ss and non-determinism in the setting of multi-party communication protoco
 ls. These lead to applications on some key problems of computation. The ap
 plications come in two flavour: one where our analysis of communication co
 mplexity resolves directly questions from computation. Second\, insights g
 ained from understanding communication bottlenecks are ported to computati
 on to make progress on major problems. Bio: Arkadev Chattopadhyay is a pos
 t-doctoral fellow in the Theory group of the Department of Computer Scienc
 e at the University of Toronto since September 2009. He was a member of th
 e School of Mathematics at the Institute for Advanced Study in Princeton f
 or the academic year 2008-2009. He obtained his Ph.D in Computer Science f
 rom McGill University\, Montreal in 2008 and a Bachelor of Technology in E
 lectronics and Electrical Communication engineering from the Indian Instit
 ute of Technology\, Kharagpur\, India in 1994. He has seven years of indus
 trial experience in software and product development for telecommunication
  systems. His current research interests are in the theory of computation\
 , especially circuit and communication complexity.
LOCATION:INM 202
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR