Skip to main content
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
Theory of Distributed Systems
Parallel Computing
Applied Computing
Supertech Research
Quantum Information Science
Computation & Biology
Computational Connectomics
Cryptography and Information Security
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
Theory Reading Group
Courses
Course Calendar
Course Descriptions
Who Is Teaching What (Spring 2025)
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
Friday, February 21, 2025
« Prev
Next »
Time
10:30 am
to
12:00 pm
2:00 pm
to
3:00 pm
2:30 pm
to
4:00 pm
All day
10:30
am
10:30 am
to
12:00 pm
Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations
Kiril Bangachev (MIT EECS)
2:00
pm
2:00 pm
to
3:00 pm
18.200 Principles of Discrete Applied Mathematics
Peter Shor
2:30
pm
2:30 pm
to
4:00 pm
6.4500 Design for the Web: Languages & User Interfaces
David Karger
