All Topics (May 28 through May 6)
Wednesday, March 19
- 9:30 AM On the Impossibility of Cryptography with Tamperable Randomness: Rafael Pass, Cornell.
- 11:00 AM Practical and Principled Security: Andrea Bittau, Stanford (CS Colloquium)
Friday, March 21
Monday, March 24
Wednesday, March 26
Thursday, March 27
- 3:00 PM Simple, Safe, and Efficienct Memory Management, Using Linear Pointers: Likai Liu, PhD Defense
Friday, March 28
- All Day IAP Day 2014
- 2:00 PM The Complexity of Nondeterminism: Lance Fortnow, Georgia Tech (Theory Seminar)
Monday, March 31
Thursday, April 3
- 11:00 AM Key Derivation From Noisy Sources With More Errors Than Entropy: Ben Fuller, BU (PhD Proposal)
Friday, April 4
Monday, April 7
Wednesday, April 9
- 10:00 AM Privacy-Preserving Public Information for Sequential Games: Jamie Morgensen, CMU (BUSec Seminar)
Friday, April 11
Monday, April 14
- 11:00 AM Network-aware VM Allocation for Predictable Performance: Christine Bassem, BU (NRG Seminar)
Thursday, April 17
Friday, April 18
Monday, April 21
- All Day Patriots' Day
Friday, April 25
- 11:00 AM Indexing for Interactive Exploration of Big Data Series: Kostas Zoumpatianos, University of Trento
- 2:30 PM Reducing the Sample Complexity of Private Learners: Kobbi Nissim, Ben-Gurion Univeristy (Theory Seminar)
Monday, April 28
Wednesday, April 30
- 4:00 PM Combinatorial Properties of Binary Tables with Fixed Marginals: Behzad Golshan, PhD Oral Exam
Monday, May 5
- 2:00 AM Spectral Graph Sparsification and Fast Laplacian Solvers: Yiannis Koutis, Brown (Theory Seminar)