| No. | 讲座题目 | 主讲人 | 时间 | 地址 |
|---|---|---|---|---|
| 33 | How Many Founders Shall we assume for Haplotype Reconstruction? -- on Coalescenc |
Eric Xing Carnegie-Mellon University |
2006-04-25 14:00-15:00 | FIT Building,Tsinghua University |
| 32 | A Short Introduction to Combinatorial Property Testing: Part II |
Dana Ron Tel Aviv University, Israel |
2006-04-14 15:00-16:00 | FIT Building,Tsinghua University |
| 31 | Probabilistic Proof Systems: Part II |
Oded Goldreich Weizmann Institute of Science, Israel |
2006-04-14 14:00-15:00 | FIT Building,Tsinghua University |
| 30 | A Short Introduction to Combinatorial Property Testing: Part I |
Dana Ron Tel Aviv University, Israel |
2006-04-12 15:00-16:00 | FIT Building,Tsinghua University |
| 29 | Probabilistic Proof Systems: Part I |
Oded Goldreich Weizmann Institute of Science, Israel |
2006-04-12 14:00-15:00 | FIT Building,Tsinghua University |
| 28 | Exclusive Set Systems and Applications |
David Woodruff MIT |
2006-04-07 10:00-11:00 | FIT Building,Tsinghua University |
| 27 | Gowers Uniformity, Influence of Variables and Probabilistically Checkable Proofs |
Luca Trevisan UC Berkeley |
2006-03-31 14:00-15:00 | FIT Building, Tsinghua University |
| 26 | Pseudo randomness and Combinatorial Constructions |
Luca Trevisan UC Berkeley |
2006-03-29 14:00-15:00 | FIT Building, Tsinghua University |
| 25 | Search via Quantum Walks |
Ashwin Nayak University of Waterloo, and Perimeter Institute for Theoretical Physics |
2006-03-21 14:30-14:30 | FIT-1-222 |
| 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 |
