No. Title Speaker Speaker Venue
6 On the Complexity of Finding Shortest Paths in a Two-Dimensional Domain Ker-I Ko
State University of New York at Stony Brook
2004-12-23 14:30-08:00 FIT-1-315
5 Four All-Pairs Shortest Paths algorithms Uri Zwick
Tel Aviv University
2004-12-23 14:30-08:00 FIT-1-222
4 Computing the Arrow-Debreu Competitive Market Equilibrium Yinyu Ye
Stanford University
2004-12-20 14:30-08:00 FIT-1-222
3 Networking Going Postal Randy Wang
Princeton University
2004-11-01 14:30-08:00 FIT-1-415
2 The Analytic Techniques for MDx Hash Functions Xiaoyun Wang
Shandong University
2004-10-25 14:30-08:00 FIT-1-315
1 Design by Building up and Breaking through Abstractions Yanhong Annie Liu
State University of New York at Stony Brook
2004-10-13 14:30-08:00 FIT-1-415