MENU 
Theory of Computation Seminars
Events for 2019
JAN
25
2019
Theory Seminar
On the Quantitative Hardness of the Closest Vector Problem
Huck Bennett, Postdoctoral Researcher, Northwestern University
FEB
22
2019
Theory Seminar
Revisionist Simulations: A New Technique for Proving Space Lower Bounds
Leqi (Jimmy) Zhu, University of Toronto
SEP
13
2019
Theory Seminar
Expander Decompositions: Fast Algorithms and Applications
Thatchaphol Saranurak, Research Assistant Professor, TTI-Chicago
OCT
11
2019
Theory Seminar
The polymorphic gateway between structure and algorithms: Constraint Satisfaction and Beyond
Venkatesan Guruswami, Professor, Carnegie Mellon University
OCT
18
2019
Theory Seminar
Parallelizing Greedy for Submodular Set Function Maximization
Kent Quanrud, Asst. Professor, Purdue University
NOV
01
2019
Theory Seminar
Cup Emptying Games and I/O Scheduling
Michael A. Bender , Professor, Stony Brook University
NOV
15
2019
Theory Seminar
An Adaptive Step Toward the Multiphase Conjecture
Omri Weinstein, Asst. Professor, Columbia University
NOV
22
2019
Theory Seminar
Fine-grained hardness of CVP(P)— Everything that we can prove (and nothing else)
Huck Bennett, Postdoctoral Researcher, University of Michigan
DEC
06
2019
Theory Seminar
The Complexity of Finding S-factors in Regular Graphs
Sanjana Kolisetty and Linh Le, University of Michigan