Algorithms and Complexity Seminar 2019-2020


Or Zamir, Tel Aviv University
Faster k-SAT Algorithms Using Biased-PPSZ
Speaker(s): Or Zamir
Date: Wednesday, September 18, 2019
Time: 4:00 PM to 5:00 PM
Location:
Contact: Rebecca Yadegar, ryadegar@csail.mit.edu

Or Zamir, Tel Aviv University
Faster k-SAT Algorithms Using Biased-PPSZ
Speaker(s): Or Zamir
Date: Wednesday, September 18, 2019
Time: 4:00 PM to 5:00 PM
Location: 32-G575
Contact: Rebecca Yadegar, ryadegar@csail.mit.edu

Kira Goldner,
Mechanism Design under Interdependent Valuations
Speaker(s): Kira Goldner
Date: Thursday, October 31, 2019
Time: 3:00 PM to 4:00 PM
Location: 32-D463
Contact: Rebecca Yadegar, ryadegar@csail.mit.edu

Piotr Sankowski, University of Warsaw
Walking Randomly, Massively, and Efficiently
Speaker(s): Piotr Sankowski
Date: Monday, November 04, 2019
Time: 1:30 PM to 2:30 PM
Location: 32-G882
Contact: Rebecca Yadegar, ryadegar@csail.mit.edu

Talya Eden,
Approximately counting and sampling edges uniformly, parameterized by the arboricity
Speaker(s): Talya Eden
Date: Wednesday, November 13, 2019
Time: 4:00 PM to 5:00 PM
Location: 32-G575
Contact: Rebecca Yadegar, ryadegar@csail.mit.edu

Michael Kapralov, EPFL
Dynamic Streaming Spectral Sparsification in Nearly Linear Time and Space
Speaker(s): Michael Kapralov
Date: Thursday, November 14, 2019
Time: 4:00 PM to 5:00 PM
Location: 32-G882
Contact: Rebecca Yadegar, ryadegar@csail.mit.edu

Audra McMillan, BU
The Structure of Optimal Private Tests for Simple Hypotheses
Speaker(s): Audra McMillan
Date: Wednesday, November 20, 2019
Time: 4:00 PM to 5:00 PM
Location: 32-G575
Contact: Rebecca Yadegar, ryadegar@csail.mit.edu

Manuel Sabin , Berkeley, Dpt. Computer Science
Discriminatory and Liberatory Algorithms: Restructuring Algorithmic “Fairness”
Speaker(s): Manuel Sabin
Date: Wednesday, December 04, 2019
Time: 4:00 PM to 5:00 PM
Location: 32-G575
Contact: Rebecca Yadegar, ryadegar@csail.mit.edu

Noah Stephens-Davidowitz, MIT CSAIL
Seth-Hardness of Coding Problems
Speaker(s): Noah Stephens-Davidowitz
Date: Thursday, December 05, 2019
Time: 4:00 PM to 5:00 PM
Location: 32-D463 (Star)
Contact: Rebecca Yadegar, ryadegar@csail.mit.edu

Christian Sohler,
Property Testing in Planar Graphs: Bipartiteness and Subgraph Freeness
Speaker(s): Christian Sohler
Date: Wednesday, February 05, 2020
Time: 3:00 PM to 4:00 PM
Location: Seminar Room G575
Contact: Quanquan Liu, quanquan@csail.mit.edu

Jason Li, Carnegie Mellon University (CMU)
The Karger-Stein Algorithm is Optimal for $k$-cut
Speaker(s): Jason Li
Date: Tuesday, February 11, 2020
Time: 4:00 PM to 5:00 PM
Location: 32-G575
Contact: Rebecca Yadegar, ryadegar@csail.mit.edu

Mark Sellke, Stanford
Chasing Convex Bodies
Speaker(s): Mark Sellke
Date: Wednesday, February 12, 2020
Time: 4:00 PM to 5:00 PM
Location: 32-G575
Contact: Rebecca Yadegar, ryadegar@csail.mit.edu

Shweta Jain,
Counting cliques in real-world graphs
Speaker(s): Shweta Jain
Date: Wednesday, April 01, 2020
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/561242870
Contact: Quanquan Liu, quanquan@csail.mit.edu