清华大学交叉信息研究院

NO.	讲座题目	主讲人	时间	地址
24	Stochastic Optimization is (almost) as Easy as Deterministic Optimization	David Shmoys Cornell University	2006-03-20 14:00-15:00	FIT Building, Tsinghua University
23	Approximation Algorithms for the k-Facility Location Problem	Peng Zhang Institute of Software, Chinese Academy of Sciences	2006-03-17 14:00-15:00	FIT Building,Tsinghua University
22	I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis	Ke Yi Duke University (now at AT & T Research Labs)	2006-03-08 14:00-15:00	FIT Building, Tsinghua University
21	Network Games and the Price of Anarchy or Stability	Eva Tardos Cornell University	2006-02-24 13:00-14:00	FIT-1-222
20	The Mathematical Theory of Resource Allocation in Communication Networks: Part I	Edmund Yeh Yale University, USA	2005-11-23 14:00-14:00	FIT-1-204
19	MEET THE MASTER—Prof John Hopcroft, Turing Winner	John Hopcroft Cornell University	2005-11-18 15:30-16:30	FIT-1-222
18	Quadratic Lower Bounds on Matrix Rigidity	Satya Lokam Microsoft Research	2005-11-16 10:30-11:30	FIT-1-222
17	Advanced Topic in Computational Molecular Genomics	Michael Q. Zhang Cold Spring Harbor Laboratory, USA	2005-11-04 09:30-11:30	FIT-1-101
16	The Mathematical Theory of Resource Allocation in Communication Networks: Part I	Edmund Yeh Yale University, USA	2005-11-01 14:00-14:00	FIT楼1-204
15	Research in Voting Systems	Ronald L. Rivest MIT	2005-10-19 16:00-17:00	FIT-2-201, Tsinghua University
14	Spanners and emulators with sublinear distance errors	Uri Zwick Tel Aviv University	2005-09-20 15:30-16:30	FIT-1-222, Tsinghua University
13	Spanners and emulators with sublinear distance errors	Uri Zwick Tel Aviv University	2005-09-20 14:00-15:00	FIT-1-222
12	Union-find with deletions	Uri Zwick Tel Aviv University	2005-09-19 13:30-13:30	FIT-1-222, Tsinghua University
11	From Quantum Computers to Identification of Molecules	Tal Mor Computer Science Department,Technion, Haifa, Israel	2005-09-06 14:30-15:30	FIT-1-222, Tsinghua University
10	Perspectives in Computer Science	Leslie G. Valiant Computer Science and Applied mathematics at Harvard University	2005-08-30 09:30-10:30	FIT-1-222, Tsinghua University
9	Defending against Large-scale Internet DDoS Attacks	Adrian Perrig Carnegie Mellon University	2005-05-24 09:00-09:00	FIT-1-222, Tsinghua University
8	Sting: an Automatic Defense System against Zero-day Worm Attacks	Dawn Song Carnegie Mellon University	2005-05-23 14:30-15:30	FIT-1-222,Tsinghua University
7	Games that computers (and computer scientists) play	Avi Wigderson School of mathematics, Institute for Advanced Study, Princeton University	2005-04-29 10:30-11:30	Institute Meeting Room, Level 3, Administration Building, Institute of Software, Software Park, CAS
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-15:30	FIT-1-315
5	Four All-Pairs Shortest Paths algorithms	Uri Zwick Tel Aviv University	2004-12-23 14:30-15:30	FIT-1-222

>
末页

学术报告