No. Title Speaker Time Venue
137 Advanced Topic in Computational Molecular Genomics Michael Q. Zhang
Cold Spring Harbor Laboratory, USA
2005-11-04-2005-11-29 FIT-1-101
136 Research in Voting Systems Ronald L. Rivest
MIT
2005-10-19-2005-10-19 FIT-2-201, Tsinghua University
135 Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs Adi Shamir
Weizmann Institute of Science
2006-12-14-2006-12-14 FIT-1-222
134 Solving Huge Systems of Linear Equations Adi Shamir
Weizmann Institute of Science, Israel
2006-12-14-2006-12-14 Teaching Building 6A-017
133 Spanners and emulators with sublinear distance errors Uri Zwick
Tel Aviv University
2005-09-20-2005-09-20 FIT-1-222
132 Union-find with deletions Uri Zwick
Tel Aviv University
2005-09-19-2005-09-19 FIT-1-222
131 Four All-Pairs Shortest Paths algorithms Uri Zwick
Tel Aviv University
2004-12-23-2004-12-23 FIT-1-222
130 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-2004-12-23 FIT-1-315
129 Computing the Arrow-Debreu Competitive Market Equilibrium Yinyu Ye
Stanford University
2004-12-20-2004-12-20 FIT-1-222
128 Networking Going Postal Randy Wang
Princeton University
2004-11-01-2004-11-01 FIT-1-415
127 The Analytic Techniques for MDx Hash Functions Xiaoyun Wang
Shandong University
2004-10-25-2004-10-25 FIT-1-315
126 Design by Building up and Breaking through Abstractions Yanhong Annie Liu
State University of New York at Stony Brook
2004-10-13-2004-10-13 FIT-1-415
125 Network Science: Information Spread, Epidemics, Mobility, and Cascading Failures Edmund Yeh
Yale University
2009-12-28-2009-12-28 Room 4-603, FIT Building, Tsinghua University
124 Prolonging Network Lifetime for Data Gathering in Wireless Sensor Networks Weifa Liang
School of Computer Science, Australian National University
2009-12-16-2009-12-16 Room 1-222, FIT Building, Tsinghua University
123 Spanners and emulators with sublinear distance errors Uri Zwick
Tel Aviv University
2005-09-20-2005-09-20 FIT-1-222, Tsinghua University
122 Graph Problems in the Streaming Model Sampath Kannan
University of Pennsylvania
2006-10-19-2006-10-19 FIT Building,Tsinghua University
121 Theory of Computation as a Lens on the Sciences: the Example of Computational Mo Richard Karp
University of California, Berkeley
2006-09-11-2006-09-11 FIT Building,Tsinghua University
120 Union-find with deletions Uri Zwick
Tel Aviv University
2005-09-19-2005-09-19 FIT-1-222, Tsinghua University
119 The Knuth-Yao Quadrangle Inequality Speedup is a Consequence of Total Monotonici Mordecai Golin
Hong Kong University of Science & Technology
2006-06-05-2006-06-05 FIT Building,Tsinghua University
118 How Many Founders Shall we assume for Haplotype Reconstruction? -- on Coalescenc Eric Xing
Carnegie-Mellon University
2006-04-25-2006-04-25 FIT Building,Tsinghua University