Research & Faculty Candidate Talks
-
Proof Complexity and Applications
Event Type: Faculty Candidate Talk
Speaker: Marc VinyalsLocation: Via Zoom
Event Date: Tuesday, February 23, 2021 10:30am
-
Mechanism Design for Social Good
Event Type: Faculty Candidate Talk
Speaker: Kira Goldner, Columbia UniversityLocation: Via Zoom
Event Date: Monday, February 22, 2021 10:30am - 11:45am
-
Efficient Algorithms and Hardness for Fundamental Problems in Data Science
Event Type: Faculty Candidate Talk
Speaker: Peng ZhangLocation: Via Zoom Recording
Event Date: Thursday, February 18, 2021 10:30am
-
Algorithms and Barriers for Fast Matrix Multiplication
Event Type: Faculty Candidate Talk
Speaker: Josh AlmanLocation: Via Zoom Recording
Event Date: Thursday, February 11, 2021 10:30am
-
New Arenas in Hardness of Approximation
Event Type: Faculty Candidate Talk
Speaker: Karthik SrikantaLocation: Via Zoom Recording
Event Date: Tuesday, February 09, 2021 10:30am
-
Communication Complexity, Quantum Computing and Optimization: New Connections and Insights
Event Type: Faculty Candidate Talk
Speaker: Makrand SinhaLocation: Via Zoom
Event Date: Monday, February 08, 2021 10:30am
-
Recent Lower Bounds in Algebraic Complexity Theory
Event Type: Faculty Candidate Talk
Speaker: Ben Lee VolkLocation: Via Zoom Recording
Event Date: Thursday, February 04, 2021 10:30pm - 11:45pm
Department of Computer Science