No. Title Speaker Speaker Venue
15 Priority sampling to estimating arbitrary subset sums Mikkel Thorup
AT&T Labs--Research, Shannon Laboratory
2007-06-07 10:40-08:00 Room 6A - 201, Tsinghua University
14 Automatic Generation and Analysis of Attack Graphs Jeannette M. Wing
Carnegie Mellon University
2007-06-05 15:30-08:00 FIT Building 4-603, Tsinghua University
13 Probabilistic Graphical Models --- theory, algorithm, and application:Learning Eric Xing
Carnegie Mellon University
2007-06-04 14:00-08:00 FIT Building 4-603, Tsinghua University
12 Probabilistic Graphical Models --- theory, algorithm, and application:Inference Eric Xing
Carnegie Mellon University
2007-06-01 14:00-08:00 FIT Building 4-603, Tsinghua University
11 Probabilistic Graphical Models --- theory, algorithm, and application:Overview o Eric Xing
Carnegie Mellon University
2007-05-31 16:00-08:00 FIT Building 4-603, Tsinghua University
10 Structure from Proximity Leonidas J. Guibas
Stanford University
2007-05-31 14:30-08:00 FIT Building 4-603, Tsinghua University
9 Quantum communication complexity of block-composed functions Yaoyun Shi
EECS, University of Michigan, Ann Arbor
2007-05-29 14:00-08:00 FIT Building 4-603, Tsinghua University
8 Describing vs. proving: connecting bounded arithmetic and descriptive complexity Antonina Kolokolova
Simon Fraser University
2007-05-15 15:00-08:00 FIT Building 4-603, Tsinghua University
7 Chernoff-type Direct Product Theorems Valentine Kabanets
Simon Fraser University
2007-05-15 14:00-08:00 FIT Building 4-603, Tsinghua University
6 co-B\"uchi Rankings and omega-Automata Transformations Qiqi Yan
Shanghai Jiao Tong University
2007-04-20 15:30-08:00 FIT Building,Tsinghua University
5 An Appropriate Design for Trusted Computingand Digital Rights Management Clark Thomborson
The University of Auckland
2007-03-29 15:30-08:00 FIT Building,Tsinghua University
4 Two zero-knowledge interactive proofs for problems in graph theory with applicat Yvo Desmedt
University College London
2007-03-28 16:30-08:00 FIT Building,Tsinghua University
3 All problems in statistical zero-knowledge have a classical protocol secure agai Shengyu Zhang
California Institute of Technology
2007-03-27 14:00-08:00 FIT Building, Tsinghua University
2 Post Quantum Signatures Johannes buchmann
Technische Universität Darmstadt
2007-03-14 14:30-08:00 FIT Building,Tsinghua University
1 Hamiltonicity of Regular Graphs and Blocks of Consecutive Ones in Symmetric Matr Francis Lau
The University of Hong Kong
2007-03-13 14:30-08:00 FIT Building, Tsinghua University