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
OCT
01
2021
Theory Seminar
Negative probabilities: what are they for?
Yuri Gurevich
University of Michigan
3:00pm – 4:00pm
Add to Google Calendar
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
Add to Google Calendar
OCT
08
2021
Theory Seminar
The Complexity of Gradient Descent: CLS = PPAD∩PLS
Alexandros Hollender
University of Oxford
3:00pm – 4:00pm
Add to Google Calendar
OCT
15
2021
Theory Seminar
Theory seminar: TBD
Michal Derezenski
University of Michigan
3:00pm – 4:00pm
Add to Google Calendar
OCT
29
2021
Theory Seminar
Yang P. Liu: TBD
Yang P. Liu
Stanford University
3:00pm – 4:00pm
Add to Google Calendar
NOV
03
2021
Theory Seminar
Arnold Filtser: Clan Embeddings into Trees, and Low Treewidth Graphs
Arnold Filtser
Columbia University
11:00am – 12:00pm
Add to Google Calendar
NOV
12
2021
Theory Seminar
Optimization-friendly generic mechanisms without money.
Mark Braverman
Princeton University
3:00pm – 4:00pm
Add to Google Calendar
Past Seminars
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
DEC
11
2020
Theory Seminar
Fast algorithms for linear programs and bipartite matching via new data structures and interior-point methods
Jan van den Brand
KTH Royal Institute of Technology
10:00am – 11:00am
DEC
04
2020
Theory Seminar
New Analysis of the Factor Refinement Algorithm with Applications
Aditya Ravi
University of Micghian
10:00am – 11:00am
NOV
20
2020
Theory Seminar
Impartial selection, additive approximation guarantees, and priors
Ioannis Caragiannis
,
Professor
Aarhus University
10:00am – 11:00am
NOV
13
2020
Theory Seminar
A Unified and Fine-Grained Approach for Light Spanners
Hung Lee
,
Assistant Professor
University of Massachusetts Amherst
10:00am – 11:00am
NOV
11
2020
Student Event
17th Annual CSE GRADUATE HONORS COMPETITION
4:00pm – 6:00pm in Remote/Virtual
NOV
06
2020
Dissertation Defense
Algebraic Frameworks for Cryptographic Primitives
Navid Alamati
3:00pm – 5:00pm in Remote/Virtual
NOV
06
2020
Theory Seminar
Edge-Weighted Online Bipartite Matching
Matthew Fahrbach
Google Research
10:00am – 11:00am
OCT
30
2020
Theory Seminar
Coloring and Maximum Weight Independent Set of Rectangles
Parinya Chalermsook
,
Assistant Professor
Aalto University
10:00am – 11:00am
OCT
23
2020
Theory Seminar
Towards Optimal Separations between Quantum and Randomized Query Complexities
Avishay Tal
,
Assistant Professor
UC Berkeley
2:00pm – 3:00pm
OCT
16
2020
Theory Seminar
Computational Hardness of Optimal Fair Computation
Hemanta K. Maji
,
Assistant Professor
Purdue University
10:00am – 11:00am
OCT
09
2020
Theory Seminar
Aggregating Inconsistent Information in Ranking, Clustering and Phylogenetic Trees
Vaggos Chatziafratis
,
Visiting Faculty Researcher
Google Research
10:00am – 11:00am
OCT
02
2020
Theory Seminar
New Techniques for Proving Fine-Grained Average-Case Hardness
Andrea Lincoln
,
Postdoc
UC Berkeley
10:00am – 11:00am
SEP
25
2020
Theory Seminar
Hypergraph k-cut for fixed k in deterministic polynomial time
Karthik Chandrasekaran
,
Assistant Professor
UIUC
10:00am – 11:00am
SEP
18
2020
Theory Seminar
Non-Adaptive Adaptive Sampling in Turnstile Streams
Sepideh Mahabadi
,
Research Assistant Professor
Toyota Technological Institute at Chicago (TTIC)
10:00am – 11:00am
SEP
11
2020
Theory Seminar
The Menu-Size of Approximately Optimal Auctions
Yannai A. Gonczarowski
10:00am – 11:00am
AUG
06
2020
Dissertation Defense
Efficiency in Machine Learning with Focus on Deep Learning and Recommender Systems
Amy Nesky
10:00am – 12:00pm
JUL
28
2020
CUOS Seminar | Dissertation Defense
Towards the First Practical Applications of Quantum Computers
Kevin Sung
3:00pm – 5:00pm
JUN
30
2020
Dissertation Defense
A Parallel Tensor Network Contraction Algorithm and Its Applications in Quantum Computation
Fang Zhang
3:00pm – 5:00pm
MAR
20
2020
Theory Seminar
An Algorithm for Hypergraph k-Cut
Karthik Chandrasekaran
,
Assistant Professor
University of Illinois, Urbana-Champaign
10:30am – 11:30pm in 3725 Beyster Building
MAR
18
2020
Faculty Candidate Seminar
Learning from Societal Data: Theory and Practice
Ramya Vinayak
,
Postdoc
University of Washington
10:30am – 11:30am in Remote/Virtual
MAR
10
2020
Faculty Candidate Seminar
Algorithmic Paradigms for Dynamic Graphs
Thatchaphol Saranurak
,
Research Assistant Professor
Toyota Technological Institute at Chicago
10:30am – 11:30am in 3725 Beyster Building
MAR
06
2020
Theory Seminar
Towards a Unified Theory of Matching Sparsifiers
Aaron Bernstein
,
Asst. Professor
Rutgers University
10:30am – 11:30pm in 3725 Beyster Building
FEB
07
2020
Theory Seminar
Security Games: Quasi-Regular Sequences, and a new version of TSP
David Kempe
,
Professor
University of Southern California
10:30am – 11:30pm in 3725 Beyster Building
JAN
16
2020
Faculty Candidate Seminar
Sketching Graphs and Matrices
Greg Bodwin
,
Postdoc
Georgia Tech
10:30am – 11:30am in 3725 Beyster Building
JAN
14
2020
Faculty Candidate Seminar
On Sunflowers and Its Friends in Computer Science and Mathematics
Jiapeng Zhang
,
Postdoc
Harvard University
10:30am – 11:30am in 3725 Beyster Building
JAN
09
2020
Faculty Candidate Seminar
Data Structures Meet Circuits and Cryptography
Sasha Golovnev
,
Postdoc
Harvard University
10:30am – 11:30am in 3725 Beyster Building
DEC
06
2019
Theory Seminar
The Complexity of Finding S-factors in Regular Graphs
Sanjana Kolisetty and Linh Le
University of Michigan
10:30am – 11:30am in 3725 Beyster Building
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
10:30am – 11:30am
NOV
15
2019
Theory Seminar
An Adaptive Step Toward the Multiphase Conjecture
Omri Weinstein
,
Asst. Professor
Columbia University
10:30am – 11:30am
NOV
01
2019
Theory Seminar
Cup Emptying Games and I/O Scheduling
Michael A. Bender
,
Professor
Stony Brook University
10:30am – 11:30am
OCT
18
2019
Theory Seminar
Parallelizing Greedy for Submodular Set Function Maximization
Kent Quanrud
,
Asst. Professor
Purdue University
10:30am – 11:30am
OCT
11
2019
Theory Seminar
The polymorphic gateway between structure and algorithms: Constraint Satisfaction and Beyond
Venkatesan Guruswami
,
Professor
Carnegie Mellon University
10:30am – 11:30am in 3725 Beyster Building
SEP
13
2019
Theory Seminar
Expander Decompositions: Fast Algorithms and Applications
Thatchaphol Saranurak
,
Research Assistant Professor
TTI-Chicago
10:30am – 11:30am in 3725 Beyster Building