Institute for Interdisciplinary Information Sciences (IIIS)

NO.	Title	Speaker	Time	Venue
149	Moser and Tardos meet Lovasz	Mario Szegedy Rutgers University	2010-10-14 14:00-15:00	FIT 1-222
148	Lower Bounds for the Independent Set Problem in the Semi-streaming Model	Mario Szegedy Rutgers University	2010-10-12 14:00-15:00	FIT 1-222
147	Communication Complexity and Applications	Joshua Brody Tsinghua University	2010-09-30 15:00-16:00	FIT 1-222
146	Applications of Shellable Complexes to Distributed Computing	Maurice Herlihy Brown University	2010-09-30 14:00-15:00	FIT 1-222
145	Constructing Optimal Restricted Phylogenetic Network for a Set of Binary Trees	David Zhang The University of Hong Kong	2010-08-20 14:00-15:00	FIT 1-222
144	Improved Guarantees for Agnostic Learning of Disjunctions	Avrim Blum Carnegie Mellon University	2010-07-01 14:00-15:00	FIT 1-222
143	A Lower Bound for Cooperative Broadcast in the Presence of Noise	Michael Saks Rutgers, The State University of New Jersey	2010-06-24 14:00-15:00	FIT 1-222
142	Mobile Social Networking without Big Brother	Monica Lam Stanford University	2010-06-10 16:00-17:00	FIT 4-603
141	Fairness and Partial Fairness in Secure Two-Party Computation	Jonathan Katz University of Maryland	2010-06-10 14:00-15:00	FIT 4-603
140	Technology on Measurement Information Processing in Wireless Sensor Networks	Xue Wang Tsinghua University	2010-05-27 14:00-15:00	FIT 4-603
139	A Theory of Cryptographic Complexity	Manoj Prabhakaran University of Illinois, Urbana-Champaign	2010-05-20 14:00-15:00	FIT 1-222
138	Massive Data and Data Intensive Super Computing	Jianzhong Li Harbin Institute of Technology	2010-04-23 14:00-15:00	FIT 4-603
137	Blackwell Approachability meets Regret Minimization in the Dual	Jacob Abernethy UC Berkeley	2010-04-23 14:00-15:00	FIT 1-222
136	60 Years of Scientific Research in Cryptography: a Reflection	Yvo Desmedt University College London	2010-04-22 14:00-15:00	FIT 1-222
135	Structural Alignment for RNAs	S.M. Yiu The University of Hong Kong	2010-04-15 14:00-15:00	FIT 1-222
134	Universal One-Way Hash Functions via Inaccessible Entropy	Hoeteck Wee Queens College, CUNY	2010-04-01 14:00-15:00	FIT 1-222
133	New Time-Space Trade-offs to Invert One-Way Functions and Break Pseudorandom Gen	Luca Trevisan Stanford University	2010-03-25 14:00-15:00	FIT 1-222
132	Network Science: Information Spread, Epidemics, Mobility, and Cascading Failures	Edmund Yeh Yale University	2009-12-28 14:00-16:00	Room 4-603, FIT Building, Tsinghua University
131	Prolonging Network Lifetime for Data Gathering in Wireless Sensor Networks	Weifa Liang School of Computer Science, Australian National University	2009-12-16 16:00-17:00	Room 1-222, FIT Building, Tsinghua University
130	An Introduction of CSAIL	Victor Zue MIT	2009-10-29 16:00-17:30	Lecture Hall (2nd Floor), FIT Building, Tsinghua University

Upcoming Events