No. Title Speaker Time Venue
126 Network coding----A paradigm shift in data transport Bob Li
The Chinese University of Hong Kong
2009-06-11 15:00-16:00 FIT Building 4-603, Tsinghua University
125 List error-correction algorithms and applications: A survey Venkatesan Guruswami
Carnegie Mellon University
2009-06-08 14:00-15:00 FIT Building 4-603, Tsinghua University
124 Computational Complexity of Rigidity-like functions -- Survey and Open Problems Satya Lokam
Microsoft Research India
2009-05-21 16:00-17:00 FIT Building 4-603, Tsinghua University
123 Soundness amplification in probabilistically checkable proofs (with an eye towar Andrej Bogdanov
The Chinese University of Hong Kong
2009-05-19 10:00-11:30 FIT Building 1-222, Tsinghua University
122 The Confluence of Sparse Representation and Computer Vision Yi Ma
UIUC and Microsoft Research Asia
2009-05-14 16:00-17:00 FIT Building 4-603, Tsinghua University
121 Authentication protocols based on human interaction in security pervasive comput Long Hoang Nguyen
Oxford University
2009-05-14 15:00-16:00 FIT Building 4-603, Tsinghua University
120 How Fast Can We Solve Problems Without Using Any Extra Array? Constant Working S Tetsuo Asano
Japan Advanced Institute of Science and Technology
2009-05-11 15:00-16:00 FIT Building 4-603, Tsinghua University
119 Testing Non-uniform $k$-wise Independent Distributions over Product Spaces Ning Xie
MIT
2009-05-07 16:00-17:00 FIT Building 4-603, Tsinghua University
118 Behavioral Games on Networks Michael Kearns
University of Pennsylvania
2009-05-07 15:00-16:00 FIT Building 4-603, Tsinghua University
117 Soundness amplification in probabilistically checkable proofs (with an eye towar Andrej Bogdanov
The Chinese University of Hong Kong
2009-04-24 10:00-11:30 FIT Building 1-222, Tsinghua University
116 Lift-and-project integrality gaps from local-global metrics Moses Charikar
Princeton University
2009-04-16 16:00-17:00 FIT Building 4-603, Tsinghua University
115 Soft heaps simplified Prof. Uri Zwick
Tel Aviv University
2009-04-16 15:00-16:00 FIT Building 4-603, Tsinghua University
114 Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2) Ning Xie
MIT
2009-04-09 16:00-17:00 FIT Building 4-603, Tsinghua University
113 Chosen Ciphertext Security via Correlated Products Alon Rosen
IDC Herzliya
2009-04-09 15:00-16:00 FIT Building 4-603, Tsinghua University
112 Geometry and expansion: A survey Sanjeev Arora
Princeton University
2009-03-06 14:00-15:00 Lecture Hall, FIT Building, Tsinghua University
111 Message Passing Algorithms and Improved LP decoding Sanjeev Arora
Princeton University
2009-03-02 16:00-17:00 FIT Building 4-603, Tsinghua University
110 Reductions from directed maximum flow to undirected maximum flow and to bipartit Henry Lin
UC Berkeley
2009-02-26 15:00-16:00 FIT Building 4-603, Tsinghua University
109 Approximability and fixed parameter tractability of minmax values Peter Miltersen
University of Aarhus
2008-12-15 16:00-17:00 FIT Building 4-603, Tsinghua University
108 Sampling From Exponential Random Graphs Allan Sly
U.C. Berkeley
2008-12-04 16:00-17:00 FIT Building 4-603, Tsinghua University
107 Khintchine-Type Inequalities and Their Applications in Optimization Anthony So
The Chinese University of Hong Kong
2008-11-19 14:00-15:00 FIT Building 4-603, Tsinghua University