Notice：
-
10-20
2011
All-Pairs Shortest Paths in O(n2) Expected Time
Speaker: Uri Zwick Tel Aviv University Time: 2011-10-20 14:00-2011-10-20 15:00 Venue: FIT 1-222 Download: Click! Abstract: We present an All-Pairs Shortest Paths (APSP) algorithm whose expecte...
-
10-13
2011
Algorithms for (Realistic Models of) Wireless Networks
Speaker: Magnus M. Halldorsson Reykjavik University Time: 2011-10-13 14:00-2011-10-13 15:00 Venue: FIT 1-222 Download: Click! Abstract: The world is becoming increasingly more interconnected, ...
-
09-29
2011
Turing Lecture: Enabling a Sustainable Energy Infrastructure - a role for Inform
Speaker: David E. Culler UC Berkeley Time: 2011-09-29 14:30-2011-09-29 15:30 Venue: Lecture Hall, FIT Building Download: Click! Abstract: From our vantage point of 150 years industrial (r)evolution...
-
09-28
2011
An Introduction to Distributed Algorithms
Speaker: Roger Wattenhofer ETH Zurich Time: 2011-09-28 15:30-2011-09-28 16:30 Venue: FIT 1-222 Abstract: In my talk we discuss the fundamentals of distributed algorithms, also known as message...
-
09-27
2011
How wireless networks scale: Architecture and Capacity
Speaker: P. R. Kumar Texas A&M University Time: 2011-09-27 14:00-2011-09-27 15:00 Venue: FIT 1-222 Download: Click! Abstract: We will address the problem of how to model, design and analyze wi...
-
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...