No. 讲座题目 主讲人 时间 地址
38 Basics of Communication Complexity Joshua Brody
University
2010-10-08 13:30-15:00 FIT 1-222
37 Maximum Weighted Independent Set of Links under Physical Interference Model, Int 张晨,许晔堃
University
2010-09-27 10:00-11:30 FIT 1-222
36 Paper Presentation 顾钊铨,吕曰洲
University
2010-09-20 10:00-11:30 FIT 1-222
35 Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and M Anke van Zuylen
University
2010-07-13 14:00-15:00 FIT 1-222
34 Constructive Proofs of Concentration Bounds 俞玮
清华大学
2010-06-23 15:30-17:00 FIT1-222
33 Constructing a Smallest Refining Galled Phylogenetic Network 楼天城
清华大学
2010-06-10 16:00-17:00 FIT1-222
32 Mechanism Design without Money 吴辰晔,王晨谷
清华大学
2010-06-10 12:00-13:30 FIT 1-222
31 Which Problems Have Strongly Exponential Complexity 陈世腾
清华大学
2010-06-09 15:30-17:00 FIT 1-222
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