Institute for Interdisciplinary Information Sciences (IIIS)

NO.	Title	Speaker	Time	Venue
87	A substate theorem in classical and quantum information theory with some applica	Pranab Sen Tata Institute of Fundamental Research, India	2008-05-07 15:30-16:30	FIT Building 4-603, Tsinghua University
86	Expander graphs - a survey (I)	Eyal Rozenman California Institute of Technology	2008-04-25 11:00-12:00	FIT Building 4-603, Tsinghua University
85	Quantum walk based search algorithms	Miklos Santha Universite Paris Sud, Laboratoire de Recherche en Informatique, France	2008-04-23 16:30-17:30	FIT Building 4-603, Tsinghua University
84	The communication complexity of correlation	Jaikumar Radhakrishnan Tata Institute of Fundamental Research, India	2008-04-23 15:30-16:30	FIT Building 4-603, Tsinghua University
83	Content Pipe Divide and Network Distribution Capacity	Mung Chiang Electrical Engineering Department, Princeton	2008-04-21 12:00-14:00	FIT Building 4-603, Tsinghua University
82	Lattice Problems and Norm Embeddings	Ricky Rosen Tel Aviv University	2008-04-16 16:30-17:30	FIT Building 4-603, Tsinghua University
81	Input-indistinguishable Computation	Alon Rosen Herzliya Interdisciplinary Center, Israel	2008-04-16 14:00-16:30	FIT Building 4-603, Tsinghua University
80	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 17:00-17:00	FIT Building 4-603, Tsinghua University
79	Routing in large networks despite Byzantine failures	Radia Perlman Sun Fellow, Sun Microsystems Inc.	2008-04-03 11:00-12:00	FIT Building 4-603, Tsinghua University
78	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 11:00-12:00	FIT Building 4-603, Tsinghua University
77	Lower Bounds for Approximating Vertex Cover in the Lovasz and Schrijver Hierarch	Luca Trevisan University of California, Berkeley	2008-03-26 15:30-16:30	FIT Building 4-603, Tsinghua University
76	Dense Subsets of Pseudorandom Sets	Luca Trevisan University of California, Berkeley	2008-03-24 14:00-15:00	FIT Building 4-603, Tsinghua University
75	Matrix Rank, Rigidity and Complexity	Jayalal Sarma M.N The Institute of Mathematical Sciences, Chennai, India	2008-03-05 13:00-14:00	FIT Building 4-603, Tsinghua University
74	Broadcast Stream Authentication	Christophe Tartary ITCS, Tsinghua University	2007-12-04 16:00-17:30	FIT Building 4-603, Tsinghua University
73	Critical Percolation on Finite Graphs	Asaf Nachmias UC Berkeley	2007-12-03 11:00-12:00	FIT Building 4-603, Tsinghua University
72	Finding Motifs Computationally	Francis Chin, The University of Hong Kong (HKU)	2007-11-13 10:30-10:30	FIT Building 4-603, Tsinghua University
71	Online Frequency Assignment in Wireless Communication Networks	Francis Chin The University of Hong Kong (HKU)	2007-11-12 15:30-16:50	FIT Building 4-603, Tsinghua University
70	Guassian tools in hardness of approximation, social choice and combinatorics	Elchanan Mossel UC Berkeley	2007-11-09 16:00-17:00	FIT Building 4-603, Tsinghua University
69	Playing Games With Probability	Elchanan Mossel UC Berkeley	2007-11-07 16:00-17:00	FIT Building 4-603, Tsinghua University
68	DNSSEC: From Cryptographic Design to Real Deployment	Lixia Zhang Computer Science Department,UCLA	2007-10-19 11:00-12:00	FIT Building 4-603, Tsinghua University

Upcoming Events