| No. | 讲座题目 | 主讲人 | 时间 | 地址 |
|---|---|---|---|---|
| 30 | Matrix Rigidity and Communication Complexity |
Jayalal Sarmaon Tsinghua University |
2010-06-02 15:30-17:00 | FIT 1-222 |
| 29 | Some New Results to the Simple Stochastic Games |
戴德承 清华大学 |
2010-05-27 16:00-17:00 | FIT1-222 |
| 28 | Discussion |
小组成员 清华大学 |
2010-05-26 15:30-17:00 | FIT 1-222 |
| 27 | Presentation |
俞玮，唐邦晟，陈世腾 清华大学 |
2010-05-20 12:00-13:30 | FIT 1-222 |
| 26 | Random Walks on Triangulation Graphs of Arbitrary Planar Point Sets |
宋浩 清华大学 |
2010-05-13 16:00-17:00 | FIT1-222 |
| 25 | Triangulation Graph Random Walk Problem |
张翔，宋浩 清华大学 |
2010-05-13 14:00-13:30 | FIT 1-222 |
| 24 | Learning Monotone Decision Trees in Polynomial Time |
Elad Verbin 清华大学 |
2010-05-12 15:30-17:00 | FIT 1-222 |
| 23 | Some Results Related to Truthful Mechanism without Money |
张家琳 清华大学 |
2010-05-06 16:00-17:00 | FIT1-222 |
| 22 | Two-hop Connected Dominating Set(2hop-CDS) Problem on Unit Disk Graph(UDG) |
胡巍，金恺，张翔 清华大学 |
2010-05-06 12:00-13:30 | FIT 1-222 |
| 21 | Learning Juntas |
Kevin Matulef 清华大学 |
2010-05-05 15:30-17:00 | FIT 1-222 |
| 20 | Pattern Matrix Method (Part 2 of 2) |
王晨谷 清华大学 |
2010-04-28 15:30-17:00 | FIT 1-222 |
| 19 | Algorithms Group |
Henry Lin Tsinghua university |
2010-04-27 14:00-14:00 | FIT 1-222 |
| 18 | Online Stochastic Matching: Beating 1-1/e (Feldman, Mehta, Mirrokni, Muthukrish |
Henry Lin University |
2010-04-27 14:00-15:00 | FIT 1-222 |
| 17 | The Communication Lower Bound for Boolean Hidden Matching Problem |
俞玮 清华大学 |
2010-04-22 16:00-17:00 | FIT1-222 |
| 16 | Communication Complexity Lower Bound of Determinant,Minimum rOuting Cost Connect |
吴辰晔，王晨谷，张家琳 清华大学 |
2010-04-22 12:00-13:30 | FIT 1-222 |
| 15 | Pattern Matrix Method (Part 1 of 2) |
唐邦晟 清华大学 |
2010-04-21 15:30-17:00 | FIT 1-222 |
| 14 | 量子网络组 |
姚期智 清华大学 |
2010-04-20 12:30-14:00 | FIT 1-222 |
| 13 | The Constructive Proof of the Lovasz Local Lemma |
王晨谷 清华大学 |
2010-04-15 16:00-17:00 | FIT 1-222 |
| 12 | Distance Oracle; Analog Adversary for Wireless Communication;Extreme Figures Ins |
楼天城,姚泓毅,金恺 清华大学 |
2010-04-15 12:00-13:30 | FIT 1-222 |
| 11 | The Coin Problem,and Pseudorandomness for Branching Programs |
Elad Verbin 清华大学 |
2010-04-14 14:00-15:00 | FIT1-222 |
