No. 讲座题目 主讲人 时间 地址
18 Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs Adi Shamir
Weizmann Institute of Science
2006-12-14 14:00-15:00 FIT-1-222
17 Solving Huge Systems of Linear Equations Adi Shamir
Weizmann Institute of Science, Israel
2006-12-14 10:20-11:25 Teaching Building 6A-017
16 Graph Problems in the Streaming Model Sampath Kannan
University of Pennsylvania
2006-10-19 14:00-15:00 FIT Building,Tsinghua University
15 Theory of Computation as a Lens on the Sciences: the Example of Computational Mo Richard Karp
University of California, Berkeley
2006-09-11 14:00-15:00 FIT Building,Tsinghua University
14 The Knuth-Yao Quadrangle Inequality Speedup is a Consequence of Total Monotonici Mordecai Golin
Hong Kong University of Science & Technology
2006-06-05 14:00-15:00 FIT Building,Tsinghua University
13 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
12 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
11 Probabilistic Proof Systems: Part II Oded Goldreich
Weizmann Institute of Science, Israel
2006-04-14 14:00-15:00 FIT Building,Tsinghua University
10 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
9 Probabilistic Proof Systems: Part I Oded Goldreich
Weizmann Institute of Science, Israel
2006-04-12 14:00-15:00 FIT Building,Tsinghua University
8 Exclusive Set Systems and Applications David Woodruff
MIT
2006-04-07 10:00-11:00 FIT Building,Tsinghua University
7 Gowers Uniformity, Influence of Variables and Probabilistically Checkable Proofs Luca Trevisan
UC Berkeley
2006-03-31 14:00-15:00 FIT Building, Tsinghua University
6 Pseudo randomness and Combinatorial Constructions Luca Trevisan
UC Berkeley
2006-03-29 14:00-15:00 FIT Building, Tsinghua University
5 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
4 Stochastic Optimization is (almost) as Easy as Deterministic Optimization David Shmoys
Cornell University
2006-03-20 14:00-15:00 FIT Building, Tsinghua University
3 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
2 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
1 Network Games and the Price of Anarchy or Stability Eva Tardos
Cornell University
2006-02-24 13:00-14:00 FIT-1-222