No. 讲座题目 主讲人 时间 地址
55 Probabilistic Graphical Models --- theory, algorithm, and application:Applicatio Eric Xing
Carnegie Mellon University
2007-06-07 15:30-17:00 FIT Building 4-603, Tsinghua University
54 Optimal Bounds for Predecessor Search and the First Separation between Linear an Mikkel Thorup
University
2007-06-07 14:00-15:00 AT&T Labs--Research, Shannon Laboratory
53 Priority sampling to estimating arbitrary subset sums Mikkel Thorup
AT&T Labs--Research, Shannon Laboratory
2007-06-07 10:40-11:25 Room 6A - 201, Tsinghua University
52 Automatic Generation and Analysis of Attack Graphs Jeannette M. Wing
Carnegie Mellon University
2007-06-05 15:30-17:00 FIT Building 4-603, Tsinghua University
51 Probabilistic Graphical Models --- theory, algorithm, and application:Learning Eric Xing
Carnegie Mellon University
2007-06-04 14:00-15:30 FIT Building 4-603, Tsinghua University
50 Probabilistic Graphical Models --- theory, algorithm, and application:Inference Eric Xing
Carnegie Mellon University
2007-06-01 14:00-15:30 FIT Building 4-603, Tsinghua University
49 Probabilistic Graphical Models --- theory, algorithm, and application:Overview o Eric Xing
Carnegie Mellon University
2007-05-31 16:00-17:00 FIT Building 4-603, Tsinghua University
48 Structure from Proximity Leonidas J. Guibas
Stanford University
2007-05-31 14:30-15:30 FIT Building 4-603, Tsinghua University
47 Quantum communication complexity of block-composed functions Yaoyun Shi
EECS, University of Michigan, Ann Arbor
2007-05-29 14:00-15:00 FIT Building 4-603, Tsinghua University
46 Describing vs. proving: connecting bounded arithmetic and descriptive complexity Antonina Kolokolova
Simon Fraser University
2007-05-15 15:00-16:00 FIT Building 4-603, Tsinghua University
45 Chernoff-type Direct Product Theorems Valentine Kabanets
Simon Fraser University
2007-05-15 14:00-15:00 FIT Building 4-603, Tsinghua University
44 co-B\"uchi Rankings and omega-Automata Transformations Qiqi Yan
Shanghai Jiao Tong University
2007-04-20 15:30-16:30 FIT Building,Tsinghua University
43 An Appropriate Design for Trusted Computingand Digital Rights Management Clark Thomborson
The University of Auckland
2007-03-29 15:30-15:30 FIT Building,Tsinghua University
42 Two zero-knowledge interactive proofs for problems in graph theory with applicat Yvo Desmedt
University College London
2007-03-28 16:30-17:30 FIT Building,Tsinghua University
41 All problems in statistical zero-knowledge have a classical protocol secure agai Shengyu Zhang
California Institute of Technology
2007-03-27 14:00-15:30 FIT Building, Tsinghua University
40 Post Quantum Signatures Johannes buchmann
Technische Universität Darmstadt
2007-03-14 14:30-15:30 FIT Building,Tsinghua University
39 Hamiltonicity of Regular Graphs and Blocks of Consecutive Ones in Symmetric Matr Francis Lau
The University of Hong Kong
2007-03-13 14:30-15:30 FIT Building, Tsinghua University
38 Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs Adi Shamir
Weizmann Institute of Science
2006-12-14 14:00-15:00 FIT-1-222
37 Solving Huge Systems of Linear Equations Adi Shamir
Weizmann Institute of Science, Israel
2006-12-14 10:20-11:25 Teaching Building 6A-017
36 Graph Problems in the Streaming Model Sampath Kannan
University of Pennsylvania
2006-10-19 14:00-15:00 FIT Building,Tsinghua University