No. Title Speaker Time Venue
16 Algorithms Group Henry Lin
Tsinghua university
2010-04-27-2010-04-27 FIT 1-222
15 The Communication Lower Bound for Boolean Hidden Matching Problem Wei Yu
Tsinghua university
2010-04-22-2010-04-22 FIT1-222
14 Pattern Matrix Method (Part 2 of 2) Chengu Wang
Tsinghua university
2010-04-28-2010-04-28 FIT 1-222
13 Learning Juntas Kevin Matulef
Tsinghua university
2010-05-05-2010-05-05 FIT 1-222
12 Two-hop Connected Dominating Set(2hop-CDS) Problem on Unit Disk Graph(UDG) Wei Hu, Kai Jin, Xiang Zhang
Tsinghua university
2010-05-06-2010-05-06 FIT 1-222
11 Some Results Related to Truthful Mechanism without Money Jialin Zhang
Tsinghua university
2010-05-06-2010-05-06 FIT1-222
10 Triangulation Graph Random Walk Problem Xiang Zhang,Hao Song
Tsinghua university
2010-05-13-2010-05-13 FIT 1-222
9 Random Walks on Triangulation Graphs of Arbitrary Planar Point Sets Hao Song
Tsinghua university
2010-05-13-2010-05-13 FIT1-222
8 Learning Monotone Decision Trees in Polynomial Time Elad Verbin
Tsinghua university
2010-05-12-2010-05-12 FIT 1-222
7 Presentation Wei Yu, Bangsheng Tang, Shiteng,Chen
Tsinghua university
2010-05-20-2010-05-20 FIT 1-222
6 Discussion Group members
Tsinghua university
2010-05-26-2010-05-26 FIT 1-222
5 Some New Results to the Simple Stochastic Games Decheng Dai
Tsinghua university
2010-05-27-2010-05-27 FIT1-222
4 Matrix Rigidity and Communication Complexity Jayalal Sarmaon
Tsinghua University
2010-06-02-2010-06-02 FIT 1-222
3 Which Problems Have Strongly Exponential Complexity Shiteng Chen
Tsinghua university
2010-06-09-2010-06-09 FIT 1-222
2 Mechanism Design without Money Chengu Wang,Chenye Wu
Tsinghua university
2010-06-10-2010-06-10 FIT 1-222
1 Constructing a Smallest Refining Galled Phylogenetic Network Tiancheng Lou
Tsinghua University
2010-06-10-2010-06-10 FIT1-222