No. 讲座题目 主讲人 时间 地址
50 Discussion 小组成员
University
2010-11-01 15:30-17:00 FIT 1-222
49 The Communication Lower Bound for FORK 宋浩
University
2010-10-29 13:30-15:00 FIT 1-222
48 Recent Progress on Computation Geometry 俞玮
University
2010-10-28 16:00-17:00 FIT 1-222
47 Space-bounded Communication Complexity 马长存,宋浩
University
2010-10-28 12:00-13:30 FIT 1-222
46 Complexity in Geometric SINR; Self-synchronization Using Coupled Oscillators 王冠宇,陈锦标
University
2010-10-25 10:00-11:30 FIT 1-222
45 Rainbow Coloring 梁宏宇
University
2010-10-21 16:00-17:00 FIT 1-222
44 Competitive Digital Auctions in Mechanism Design; Approximation Analysis of Infl 贝小辉,何晶
University
2010-10-21 12:00-13:30 FIT 1-222
43 Compressive Sensing in Wireless Sensor Networks, Surface Coverage in Wireless Se 许力文,郝霄虹
University
2010-10-18 10:00-11:30 FIT 1-203
42 Monotone Circuits for S-T Connectivity require Super-Logarithmic Depth Andrew Wan
University
2010-10-15 13:30-15:00 FIT 1-222
41 Communication Complexity Lower Bound of Inner Product Modular m 王晨谷
University
2010-10-14 16:00-17:00 FIT 1-222
40 Partial Derivative Method for Arithmetic Circuit Lower Bound;Two Open Problems 乔友明,梁宏宇
University
2010-10-14 12:00-13:30 FIT 1-222
39 MobiCom 2010 Demo and Best Paper 王永才、戚啸
University
2010-10-11 10:00-11:30 FIT 1-222
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