-
09-22
2011
Limits on the Computational Power of Random Strings
Speaker: Eric Allender Rutgers, the State University of NJ Time: 2011-09-22 14:30-2011-09-22 15:30 Venue: FIT 1-222 Abstract: R, the set of Kolmogorov-random strings, is a central notion in th...
-
09-19
2011
Shortest paths among obstacles in the plane
Speaker: Haitao Wang University of Notre Dame, USA Time: 2011-09-19 15:30-2011-09-19 16:30 Venue: FIT 1-222 Abstract: Given a set of obstacles and two points s and t in the plane, a fundamenta...
-
09-16
2011
Randomized Algorithms for Discrete Load Balancing
Speaker: Thomas Sauerwald Max-Planck Institut for Informatics, Germany Time: 2011-09-16 15:00-2011-09-16 16:00 Venue: FIT 1-222 Download: Click! Abstract: Load Balancing is an important requis...
-
09-16
2011
Network Coding Theory (Tutorial)
Speaker: Raymond Yeung CUHK Time: 2011-09-16 09:30-2011-09-16 14:50 Venue: FIT 1-222 Download: Click! Abstract: In recent years, network coding has generated much interest in information theor...
-
09-15
2011
Low Randomness Rumor Spreading via Hashing
Speaker: He Sun Max-Planck Institut for Informatics, Germany Time: 2011-09-15 13:30-2011-09-15 14:30 Venue: FIT 1-222 Abstract: We consider the classical rumor spreading problem, in which a ``...
-
08-30
2011
Less Reality, More Security
Speaker: Artur Ekert National University of Singapore Time: 2011-08-30 13:30-2011-08-30 14:30 Venue: FIT 1-222 Download: Click! Abstract: Bell's inequality makes a seemingly insane scenario possibl...