Seminars

There are no events currently scheduled.

Past Seminars

MAY
06
2022
Theory Seminar
Haotian Jiang: Minimizing Convex Functions with Integral/Rational Minimizers
3:00pm – 4:00pm in 3725 Beyster Building
APR
29
2022
Dissertation Defense
Dynamic Connectivity, Hopsets, and Byzantine Agreement
Shang-En Huang
9:30am – 11:30am in 4941 Beyster Building
APR
22
2022
Theory Seminar
Mitali Bafna: Playing Unique Games on Certifiable Small-Set Expanders and High-Dimensional Expanders
Mitali Bafna
3:00pm – 4:00pm in 3725 Beyster Building
APR
20
2022
Theory Seminar
Parth Mittal: Brooks’ Theorem in Graph Streams
Parth Mittal
3:00pm – 4:00pm
APR
15
2022
Theory Seminar
Huacheng Yu: TBD
Huacheng Yu
3:00pm – 4:00pm in 3725 Beyster Building
APR
08
2022
Theory Seminar
Max Hopkins: Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments
Max Hopkins
3:00pm – 4:00pm in 3725 Beyster Building
APR
04
2022
Distinguished Lecture
Algorithms: A Random Walk
Nikhil Bansal, Patrick C. Fischer Professor of Theoretical Computer Science, University of Michigan
3:30pm – 5:30pm in Johnson Rooms, Lurie Engineering Center (3rd floor)
APR
01
2022
Theory Seminar
Ryan Williams: Constructive Separations and Their Consequences
Ryan Williams, Prof., MIT
3:00pm – 4:00pm in 3725 Beyster Building
MAR
24
2022
Theory Seminar
Santhoshini Velusamy: Approximating CSPs in the streaming setting
Santhoshini Velusamy
3:00pm – 4:00pm
MAR
18
2022
Theory Seminar
Robert Robere: Pseudorandom Self-Reductions for NP-Complete Problems
Robert Robere, Prof., McGill University
3:00pm – 4:00pm in 3725 Beyster Building
MAR
11
2022
Theory Seminar
Deeksha Adil: Fast Algorithms for l_p-Regression and Other Problems
Deeksha Adil
3:00pm – 4:00pm in 3725 Beyster Building
FEB
25
2022
Theory Seminar
Michael Dinitz: Faster Matchings via Learned Duals
Michael Dinitz
3:00pm – 4:00pm in 3725 Beyster Building
FEB
18
2022
Theory Seminar
Ce Jin: Fast Low-Space Algorithms for Subset Sum
Ce Jin
3:00pm – 4:00pm in 3725 Beyster Building
JAN
21
2022
Theory Seminar
Arun Jambulapati: Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers
3:00pm – 4:00pm in 3725 Beyster Building
JAN
14
2022
Theory Seminar
Vera Traub: Better-Than-2 Approximations for Weighted Tree Augmentation
Vera Traub
3:00pm – 4:00pm in 3725 Beyster Building
DEC
10
2021
Theory Seminar
A Characterization of Approximability for Biased CSPs
Suprovat Ghoshal
3:00pm – 4:00pm in 3725 Beyster Building
DEC
03
2021
Theory Seminar
APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time
Ohad Trabelsi
3:00pm – 4:00pm in 3725 Beyster Building
NOV
19
2021
Theory Seminar
Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering
William Kuszmaul
3:00pm – 4:00pm in 3725 Beyster Building
NOV
17
2021
Theory Seminar
Arnold Filtser: Clan Embeddings into Trees, and Low Treewidth Graphs
Arnold Filtser
12:30pm – 1:30pm
NOV
12
2021
Theory Seminar
Optimization-friendly generic mechanisms without money.
Mark Braverman
3:00pm – 4:00pm
NOV
10
2021
Student Event | Division Event
18th Annual CSE Graduate Honors Competition
4:00pm – 6:00pm in Remote/Virtual
NOV
05
2021
Theory Seminar
Breaking the 2^n barrier for 5-coloring and 6-coloring
Or Zamir
3:00pm – 4:00pm
OCT
29
2021
Theory Seminar
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao
Yang P. Liu
3:00pm – 4:00pm
OCT
22
2021
Theory Seminar
On the Complexity of Consensus-Halving and Necklace Splitting
Aris Filos-Ratsikas, University of Liverpool
3:00pm – 4:00pm
OCT
15
2021
Theory Seminar
Accelerating Sampling Algorithms via Domain Sparsification
Michal Derezinski
3:00pm – 4:00pm in 3725 Beyster Building
Show All Past Events