MENU
Search
EECS
EECS
Computer Science and Engineering
CSE
Electrical and Computer Engineering
ECE
Search
About
Welcome to CSE
By the Numbers
Advisory Board
History
Faculty Hiring
Giving
Operations Under Covid-19
Visit
Bob and Betty Beyster Building
Emergency and Safety Info
Resources
Contact
Culture
Resources to Promote Inclusion
Student Groups and Teams
DEI and Climate ↗
Reporting Concerns and Misconduct
Academics
Graduate Programs & Admissions
Undergraduate Programs & Admissions
For Current Students
Course Information
Undergrad Research Opportunities
Research
Research Areas
Labs & Centers
Tech Transfer & Startups
Industrial Relations
Reports & Publications
People
Faculty
PhD Students
Postdocs
Staff
Alumni
Honors and Awards
Hire Our PhDs and Postdocs
News
Events
Events
All Seminars
—
Artificial Intelligence Seminars
Computer Engineering Seminars
Interactive Systems Seminars
Systems Seminars
Theory Seminars
Diversity in Computing Seminars
Michigan Institute for Data Science (MIDAS) Seminars
Other Seminars
Dissertation Defenses
Student Events
Distinguished Lectures
+
CSE Distinguished Lecture Series
William Gould Dow Distinguished Lectureship
+
About the Dow Lectureship
Other Events
College of Engineering Event Calendar
University of Michigan Event Calendar
Home
>
Events
>
All Seminars
>
Theory Seminars
Theory Seminars
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
Add to Google Calendar
JAN
14
2022
Theory Seminar
Vera Traub: TBD
Vera Traub
ETH Zurich
3:00pm – 4:00pm in 3725 Beyster Building
Add to Google Calendar
Past Seminars
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
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
FEB
19
2021
Theory Seminar
Deterministic Mincut in Almost-Linear Time
Jason Li
Carnegie Mellon University
10:00am – 11:00am
FEB
12
2021
Theory Seminar
Fooling Constant-Depth Threshold Circuits
William Hoza
UT Austin
10:00am – 11:00am
FEB
04
2021
Theory Seminar
Improved Analysis of Higher Order Random Walks
Vedat Levi Alev
University of Waterloo
10:00am – 11:00am
JAN
28
2021
Theory Seminar
New algorithms and lower bounds for all-pairs max flow
Ohad Trabelsi
Weizmann Institute
10:00am – 11:00am
JAN
22
2021
Theory Seminar
Accidental Research: Scalable Algorithms for Graph Automorphism and Canonical Labeling
Karem Sakallah
University of Michigan
10:00am – 11:00am
JAN
15
2021
Theory Seminar
Approximating the Diameter of a Graph
Nicole Wein
MIT
10:00am – 11:00am
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002