Notice：
-
12-23
2004
Four All-Pairs Shortest Paths algorithms
Speaker: Uri Zwick Tel Aviv University Time: 2004-12-23 14:30-2004-12-23 15:30 Venue: FIT-1-222 Abstract: Four recent algorithms for various versions of the celebrated All-Pairs Shortest Paths prob...
-
12-23
2004
On the Complexity of Finding Shortest Paths in a Two-Dimensional Domain
Speaker: Ker-I Ko State University of New York at Stony Brook Time: 2004-12-23 14:30-2004-12-23 15:30 Venue: FIT-1-315 Abstract: This talk consists of two parts. In the first part, we present an ov...
-
12-20
2004
Computing the Arrow-Debreu Competitive Market Equilibrium
Speaker: Yinyu Ye Stanford University Time: 2004-12-20 14:30-2004-12-20 15:30 Venue: FIT-1-222 Abstract: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu...
-
11-01
2004
Networking Going Postal
Speaker: Randy Wang Princeton University Time: 2004-11-01 14:30-2004-11-01 15:30 Venue: FIT-1-415 Abstract: Making high-bandwidth Internet access pervasively available to a large world-wide audienc...
-
10-25
2004
The Analytic Techniques for MDx Hash Functions
Speaker: Xiaoyun Wang Shandong University Time: 2004-10-25 14:30-2004-10-25 15:30 Venue: FIT-1-315 Abstract: The talk describe the main analytic techniques for the broken hash functions-MD4,RIPEMD,...
-
10-13
2004
Design by Building up and Breaking through Abstractions
Speaker: Yanhong Annie Liu State University of New York at Stony Brook Time: 2004-10-13 14:30-2004-10-13 16:00 Venue: FIT-1-415 Abstract: Software design must resolve the conflict between clarity a...