No. Title Speaker Time Venue
37 Content Pipe Divide and Network Distribution Capacity Mung Chiang
Electrical Engineering Department, Princeton
2008-04-21-2008-04-21 FIT Building 4-603, Tsinghua University
36 Input-indistinguishable Computation Alon Rosen
Herzliya Interdisciplinary Center, Israel
2008-04-16-2008-04-16 FIT Building 4-603, Tsinghua University
35 Lattice Problems and Norm Embeddings Ricky Rosen
Tel Aviv University
2008-04-16-2008-04-16 FIT Building 4-603, Tsinghua University
34 Probabilistic Graphical Models --- theory, algorithm, and application:Learning Eric Xing
Carnegie Mellon University
2007-06-04-2007-06-04 FIT Building 4-603, Tsinghua University
33 Probabilistic Graphical Models --- theory, algorithm, and application:Inference Eric Xing
Carnegie Mellon University
2007-06-01-2007-06-01 FIT Building 4-603, Tsinghua University
32 Probabilistic Graphical Models --- theory, algorithm, and application:Overview o Eric Xing
Carnegie Mellon University
2007-05-31-2007-05-31 FIT Building 4-603, Tsinghua University
31 Multiple-Input-Multiple-Output Detection using Semidefinite Relaxation Wing-Kin Ma, Ken
Department of Electronic Engineering, The Chinese University of Hong Kong
2008-04-14-2008-04-14 FIT Building 4-603, Tsinghua University
30 Structure from Proximity Leonidas J. Guibas
Stanford University
2007-05-31-2007-05-31 FIT Building 4-603, Tsinghua University
29 Routing in large networks despite Byzantine failures Radia Perlman
Sun Fellow, Sun Microsystems Inc.
2008-04-03-2008-04-03 FIT Building 4-603, Tsinghua University
28 Algorithm for wireless networks Wan Pengjun
Illinois Institute of Technology
2007-06-22-2007-06-22 FIT Building 4-222, Tsinghua University
27 Data: Making it be there when you want it and go away when you want it gone Radia Perlman
Sun Fellow, Sun Microsystems Inc.
2008-04-01-2008-04-01 FIT Building 4-603, Tsinghua University
26 Quantum communication complexity of block-composed functions Yaoyun Shi
EECS, University of Michigan, Ann Arbor
2007-05-29-2007-05-29 FIT Building 4-603, Tsinghua University
25 Describing vs. proving: connecting bounded arithmetic and descriptive complexity Antonina Kolokolova
Simon Fraser University
2007-05-15-2007-05-15 FIT Building 4-603, Tsinghua University
24 Chernoff-type Direct Product Theorems Valentine Kabanets
Simon Fraser University
2007-05-15-2007-05-15 FIT Building 4-603, Tsinghua University
23 Lower Bounds for Approximating Vertex Cover in the Lovasz and Schrijver Hierarch Luca Trevisan
University of California, Berkeley
2008-03-26-2008-03-26 FIT Building 4-603, Tsinghua University
22 co-B\"uchi Rankings and omega-Automata Transformations Qiqi Yan
Shanghai Jiao Tong University
2007-04-20-2007-04-20 FIT Building,Tsinghua University
21 Dense Subsets of Pseudorandom Sets Luca Trevisan
University of California, Berkeley
2008-03-24-2008-03-24 FIT Building 4-603, Tsinghua University
20 An Appropriate Design for Trusted Computingand Digital Rights Management Clark Thomborson
The University of Auckland
2007-03-29-2007-03-29 FIT Building,Tsinghua University
19 Two zero-knowledge interactive proofs for problems in graph theory with applicat Yvo Desmedt
University College London
2007-03-28-2007-03-28 FIT Building,Tsinghua University
18 All problems in statistical zero-knowledge have a classical protocol secure agai Shengyu Zhang
California Institute of Technology
2007-03-27-2007-03-27 FIT Building, Tsinghua University