Skip to main content
MIT CSAIL Theory of Computation MIT CSAIL
  • Accessibility
  • login
  • home
    • About
    • TOC Calendar
    • Contact
  • People
    • Faculty
    • Research Scientists
    • lecturers
    • Postdocs
    • Students
    • Visitors
    • Support Staff
    • Alumni
  • Research Groups
    • Algorithms
    • Complexity Theory
      • Complexity Theory Courses
    • Computation and Economics
    • Cryptography and Information Security
    • Theory of Distributed Systems
    • Parallel Computing
      • Applied Computing
      • Supertech Research
    • Quantum Information Science
    • Computation & Biology
    • Computational Connectomics
    • Learning-Augmented Algorithms
    • Multicore Algorithmics
    • Sublinear Algorithms
    • Theory of Machine Learning
  • Seminars
    • Theory of Computation Colloquium
    • Algorithms and Complexity Seminars
    • Theory of Distributed Systems (TDS)
    • CRYPTOGRAPHY AND INFORMATION SECURITY (CIS) SEMINARS
    • Bioinformatics Seminars
    • TCS+
    • Theory Reading Group
  • Courses
    • Course Calendar
    • Course Descriptions
    • Who Is Teaching What (Fall 2024)
  • Miscellaneous
    • New Student Blog: Not so Great Ideas in Theoretical Computer Science
    • TOC People in the News: 2009-2012
    • Awards
    • Algorithms Office Hours
  • TOC in Pictures
    • People
    • Celebrations
    • Retreats
    • Corn Fest

Thesis Defenses

2020

July 22, 2020:  Katerina Sotiraki:  New hardness results for total search problems and non-interactive lattice protocols

 

2019

November 25, 2019: Srinivasan Raghuraman: Infrastructures for Secure Multiparty Computation

September 5, 2019: William Leiserson: Defining Scalable High Performance Programming with DEF

August 15, 2019: John Peebles: Thesis Defense: Fast Spectral Primitives for Directed Graphs

August 9, 2019: Adam Sealfon: Keep it Secret, Keep it Safe: Privacy, Security and Robustness in an Adversariel World

August 6, 2019: Daniel Grier: Complexity Classification Questions at the Quantum/Classical Boundary

August 5, 2019: Luke Schaeffer: Models of Computation Inspired by Near-Term Quantum Devices

 

2018

July 16, 2018:  Prashant Vasudevan: Fine-Grained Cryptography

May 16, 2018:  Justin Holmgren: Securing Computation on Untrusted Platforms

May 7, 2018: Sunoo Park: Cryptography for Societal Benefit

2017

June 28, 2017:  Alex Arkhipov:  Quantum Computation with Identical Bosons

June 29, 2017:  Shalev Ben-David:  Quantum Speedups in Query Complexity

June 30, 2017:  Adam Bouland:  The space around BQP