MENU
Search
EECS
EECS
Computer Science and Engineering
CSE
Electrical and Computer Engineering
ECE
Search
Enter search
Home
People
Faculty
Staff
News
Seminars
Contact
Seminars
Seminars
JAN
21
2022
Theory Seminar
Arun Jambulapati: Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers
3:00pm – 4:00pm in 3725 Beyster Building
Add to Google Calendar
MAR
11
2022
Theory Seminar
Deeksha Adil
Deeksha Adil
University of Toronto
3:00pm – 4:00pm in 3725 Beyster Building
Add to Google Calendar
APR
15
2022
Theory Seminar
Huacheng Yu: TBD
Huacheng Yu
Princeton University
3:00pm – 4:00pm in 3725 Beyster Building
Add to Google Calendar
Past Seminars
JAN
14
2022
Theory Seminar
Vera Traub: Better-Than-2 Approximations for Weighted Tree Augmentation
Vera Traub
ETH Zurich
3:00pm – 4:00pm in 3725 Beyster Building
DEC
10
2021
Theory Seminar
A Characterization of Approximability for Biased CSPs
Suprovat Ghoshal
University of Michigan
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
University of Michigan
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
MIT
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
Bar-Ilan University
12:30pm – 1:30pm
NOV
12
2021
Theory Seminar
Optimization-friendly generic mechanisms without money.
Mark Braverman
Princeton University
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
Institute for Advanced Studies
3:00pm – 4:00pm
OCT
29
2021
Theory Seminar
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao
Yang P. Liu
Stanford University
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
University of Michigan
3:00pm – 4:00pm in 3725 Beyster Building
OCT
08
2021
Theory Seminar
The Complexity of Gradient Descent: CLS = PPAD∩PLS
Alexandros Hollender
University of Oxford
3:00pm – 4:00pm
OCT
06
2021
Theory Seminar
k-Forrelation Optimally Separates Quantum and Classical Query Complexity
Makrand Sinha
UC Berkeley
12:30pm – 1:30pm in 3901 Beyster Building
OCT
01
2021
Theory Seminar
Negative probabilities: what are they for?
Yuri Gurevich
University of Michigan
3:00pm – 4:00pm
SEP
24
2021
Theory Seminar
The zero-rate threshold of adversarial bit-deletions is less than 1/2
Ray Li
Stanford University
3:00pm – 4:00pm
SEP
10
2021
Theory Seminar
Reversing Color Coding
Karthik C. S.
Rutgers University
3:00pm – 4:00pm
APR
30
2021
Theory Seminar
Information theoretic limits of cardinality estimation: Fisher meets Shannon
Dingyu Wang
University of Michigan
10:00am – 11:00am
APR
23
2021
Theory Seminar
Approximation Algorithms for Fair Clustering
Ali Vakilian
TTIC
10:00am – 11:00am
APR
16
2021
Theory Seminar
Adaptive gradient descent methods for constrained optimization
Alina Ene
Boston University
10:00am – 11:00am
APR
09
2021
Theory Seminar
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
Andrew Drucker
University of Chicago
10:00am – 11:00am
MAR
26
2021
Theory Seminar
(a biased selection of) Recent Developments in Combinatorial Auctions
Matthew S. Weinberg
Princeton University
10:00am – 11:00am
MAR
19
2021
Theory Seminar
Approximation Algorithms and Hardness for Strong Unique Games
Suprovat Ghoshal
,
University of Michigan
10:00am – 11:00am
MAR
12
2021
Theory Seminar
Adversarial Streaming, Differential Privacy, and Adaptive Data Analysis
Uri Stemmer
Ben-Gurion University
10:00am – 11:00am
MAR
04
2021
Theory Seminar
Prophet and Secretary Online Algorithms for Matching in General Graphs
Michal Feldman
Tel Aviv University
10:00am – 11:00am
FEB
26
2021
Theory Seminar
Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators
Samson Zhou
,
CMU
10:00am – 11:00am
Show All Past Events