MENU
Search
EECS
EECS
Computer Science and Engineering
CSE
Electrical and Computer Engineering
ECE
Search
Enter search
Home
People
Faculty
PhD Students
Staff
News
Seminars
Contact
PhD Students
Seminars
Seminars
There are no events currently scheduled.
Past Seminars
APR
12
2024
Theory Seminar
An Almost Logarithmic Approximation for Cutwidth
Nikhil Bansal
APR
05
2024
Theory Seminar
On the Existence of Seedless Condensers: Exploring the Terrain
Mohit Gurumukhani
MAR
15
2024
Theory Seminar
Exact Emulators for Planar Graphs
George Li
MAR
08
2024
Theory Seminar
Recent progresses on Correlation Clustering
Euiwoong Lee
FEB
02
2024
Theory Seminar
New techniques for convex optimization and sparsification
Arun Jambulapati
JAN
12
2024
Theory Seminar
New Approximation Bounds for Small-Set Vertex Expansion
Suprovat Ghoshal
DEC
08
2023
Theory Seminar
Gaussian Polytope Approximators
Shivam Nadimpalli
DEC
01
2023
Theory Seminar
Separating MAX 2-AND, MAX DI-CUT and MAX CUT
Aaron Potechin
NOV
15
2023
Theory Seminar
Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation
Chris Schwiegelshohn
NOV
14
2023
Theory Seminar
Are there graphs whose shortest path structure requires large edge weights?
Nicole Wein
NOV
06
2023
Division Event
20th Annual CSE Graduate Honors Competition
NOV
03
2023
Theory Seminar
Deeparnab Chakrabarty: Parallel Submodular Function Minimization
Deeparnab Chakrabarty
OCT
20
2023
Theory Seminar
Victor Reis: Optimal Online Discrepancy Minimization
Victor Reis
OCT
06
2023
Theory Seminar
Lars Rohwedder: Simpler and stronger approximation algorithms for flow time scheduling
Lars Rohwedder
JUL
27
2023
Dissertation Defense
Simulation-based Approaches for Evaluating Information Elicitation and Information Aggregation Mechanisms
Noah Burrell
APR
14
2023
Theory Seminar
Zihan Tan: Almost-Optimal Sublinear Additive Spanners
MAR
24
2023
Theory Seminar
Or Zamir: Algorithmic Applications of Hypergraph and Partition Containers
Or Zamir
MAR
17
2023
Theory Seminar
Sasha Golovnev: Polynomial formulations as a barrier for reduction-based hardness proofs
Sasha Golovnev
FEB
27
2023
Theory Seminar
Min Jae Song: Continuous LWE
Min Jae Song, New York University
FEB
24
2023
Theory Seminar
Manik Dhar: ℓ∞ linear hashing and two-sided Kakeya bounds
Manik Dhar
JAN
27
2023
Theory Seminar
Sophie Huiberts: Smoothed analysis of the simplex method
Sophie Huiberts
JAN
06
2023
Theory Seminar
Liren Shan: Higher-Order Cheeger Inequality for Partitioning with Buffers
Liren Shan
DEC
08
2022
Women in Computing | CSE Seminar
DNA Punch-Cards: Implementations and Coding-Theoretic Questions
Olgica Milenkovic, Franklin W. Woeltge Professor of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign
DEC
02
2022
Theory Seminar
William Hoza: Recent Progress on Derandomizing Space-Bounded Computation
William Hoza
NOV
18
2022
Theory Seminar
Jessica Sorrell: Replicability in Learning
Jessical Sorrell
NOV
11
2022
Theory Seminar
Yang Liu: Lessons on Algorithmic Graph Theory from Maxflow
Yang P. Liu
NOV
04
2022
Theory Seminar
Aaron Bernstein: Negative-Weight Single-Source Shortest Paths in Near-linear Time
Aaron Berstein
OCT
21
2022
Theory Seminar
Sorrachai Yingchareonthawornchai: Deterministic Small Vertex Connectivity in Almost Linear Time
Sorrachai Yingchareonthawornchai
OCT
21
2022
Theory Seminar
Vincent Cohen-Addad: Sublinear time algorithms for Euclidean clustering coresets and correlation clustering
OCT
14
2022
Theory Seminar
Haotian Jiang: Resolving Matrix Spencer Conjecture Up to Polylogarithmic Rank
Haotian Jiang
SEP
30
2022
Theory Seminar
Zeyu Guo: Fast Multivariate Multipoint Evaluation over All Finite Fields
Zeyu Guo
SEP
23
2022
Theory Seminar
Fernando Granha Jeronimo: Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
Fernando Granha Jeronimo
MAY
06
2022
Theory Seminar
Haotian Jiang: Minimizing Convex Functions with Integral/Rational Minimizers
APR
29
2022
Dissertation Defense
Dynamic Connectivity, Hopsets, and Byzantine Agreement
Shang-En Huang
APR
22
2022
Theory Seminar
Mitali Bafna: Playing Unique Games on Certifiable Small-Set Expanders and High-Dimensional Expanders
Mitali Bafna
APR
20
2022
Theory Seminar
Parth Mittal: Brooks’ Theorem in Graph Streams
Parth Mittal
APR
15
2022
Theory Seminar
Huacheng Yu: TBD
Huacheng Yu
APR
08
2022
Theory Seminar
Max Hopkins: Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments
Max Hopkins
APR
04
2022
Distinguished Lecture
Algorithms: A Random Walk
Nikhil Bansal, Patrick C. Fischer Professor of Theoretical Computer Science, University of Michigan
Video
APR
01
2022
Theory Seminar
Ryan Williams: Constructive Separations and Their Consequences
Ryan Williams, Prof., MIT
MAR
24
2022
Theory Seminar
Santhoshini Velusamy: Approximating CSPs in the streaming setting
Santhoshini Velusamy
MAR
18
2022
Theory Seminar
Robert Robere: Pseudorandom Self-Reductions for NP-Complete Problems
Robert Robere, Prof., McGill University
MAR
11
2022
Theory Seminar
Deeksha Adil: Fast Algorithms for l_p-Regression and Other Problems
Deeksha Adil
FEB
25
2022
Theory Seminar
Michael Dinitz: Faster Matchings via Learned Duals
Michael Dinitz
FEB
18
2022
Theory Seminar
Ce Jin: Fast Low-Space Algorithms for Subset Sum
Ce Jin
JAN
21
2022
Theory Seminar
Arun Jambulapati: Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers
JAN
14
2022
Theory Seminar
Vera Traub: Better-Than-2 Approximations for Weighted Tree Augmentation
Vera Traub
DEC
10
2021
Theory Seminar
A Characterization of Approximability for Biased CSPs
Suprovat Ghoshal
DEC
03
2021
Theory Seminar
APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time
Ohad Trabelsi
NOV
19
2021
Theory Seminar
Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering
William Kuszmaul
NOV
17
2021
Theory Seminar
Arnold Filtser: Clan Embeddings into Trees, and Low Treewidth Graphs
Arnold Filtser
NOV
12
2021
Theory Seminar
Optimization-friendly generic mechanisms without money.
Mark Braverman
NOV
10
2021
Student Event | Division Event
18th Annual CSE Graduate Honors Competition
NOV
05
2021
Theory Seminar
Breaking the 2^n barrier for 5-coloring and 6-coloring
Or Zamir
OCT
29
2021
Theory Seminar
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao
Yang P. Liu
OCT
22
2021
Theory Seminar
On the Complexity of Consensus-Halving and Necklace Splitting
Aris Filos-Ratsikas, University of Liverpool
OCT
15
2021
Theory Seminar
Accelerating Sampling Algorithms via Domain Sparsification
Michal Derezinski
OCT
08
2021
Theory Seminar
The Complexity of Gradient Descent: CLS = PPAD∩PLS
Alexandros Hollender
OCT
06
2021
Theory Seminar
k-Forrelation Optimally Separates Quantum and Classical Query Complexity
Makrand Sinha
OCT
01
2021
Theory Seminar
Negative probabilities: what are they for?
Yuri Gurevich
SEP
24
2021
Theory Seminar
The zero-rate threshold of adversarial bit-deletions is less than 1/2
Ray Li
SEP
10
2021
Theory Seminar
Reversing Color Coding
Karthik C. S.
APR
30
2021
Theory Seminar
Information theoretic limits of cardinality estimation: Fisher meets Shannon
Dingyu Wang
APR
23
2021
Theory Seminar
Approximation Algorithms for Fair Clustering
Ali Vakilian
APR
16
2021
Theory Seminar
Adaptive gradient descent methods for constrained optimization
Alina Ene
APR
09
2021
Theory Seminar
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
Andrew Drucker
MAR
26
2021
Theory Seminar
(a biased selection of) Recent Developments in Combinatorial Auctions
Matthew S. Weinberg
MAR
19
2021
Theory Seminar
Approximation Algorithms and Hardness for Strong Unique Games
Suprovat Ghoshal, University of Michigan
MAR
12
2021
Theory Seminar
Adversarial Streaming, Differential Privacy, and Adaptive Data Analysis
Uri Stemmer
MAR
04
2021
Theory Seminar
Prophet and Secretary Online Algorithms for Matching in General Graphs
Michal Feldman
FEB
26
2021
Theory Seminar
Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators
Samson Zhou, CMU
FEB
19
2021
Theory Seminar
Deterministic Mincut in Almost-Linear Time
Jason Li
FEB
12
2021
Theory Seminar
Fooling Constant-Depth Threshold Circuits
William Hoza
FEB
04
2021
Theory Seminar
Improved Analysis of Higher Order Random Walks
Vedat Levi Alev
JAN
28
2021
Theory Seminar
New algorithms and lower bounds for all-pairs max flow
Ohad Trabelsi
JAN
22
2021
Theory Seminar
Accidental Research: Scalable Algorithms for Graph Automorphism and Canonical Labeling
Karem Sakallah
JAN
15
2021
Theory Seminar
Approximating the Diameter of a Graph
Nicole Wein
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
DEC
04
2020
Theory Seminar
New Analysis of the Factor Refinement Algorithm with Applications
Aditya Ravi
NOV
20
2020
Theory Seminar
Impartial selection, additive approximation guarantees, and priors
Ioannis Caragiannis, Professor, Aarhus University
NOV
13
2020
Theory Seminar
A Unified and Fine-Grained Approach for Light Spanners
Hung Lee, Assistant Professor, University of Massachusetts Amherst
NOV
11
2020
Student Event
17th Annual CSE GRADUATE HONORS COMPETITION
NOV
06
2020
Dissertation Defense
Algebraic Frameworks for Cryptographic Primitives
Navid Alamati
NOV
06
2020
Theory Seminar
Edge-Weighted Online Bipartite Matching
Matthew Fahrbach
OCT
30
2020
Theory Seminar
Coloring and Maximum Weight Independent Set of Rectangles
Parinya Chalermsook, Assistant Professor, Aalto University
OCT
23
2020
Theory Seminar
Towards Optimal Separations between Quantum and Randomized Query Complexities
Avishay Tal, Assistant Professor, UC Berkeley
OCT
16
2020
Theory Seminar
Computational Hardness of Optimal Fair Computation
Hemanta K. Maji, Assistant Professor, Purdue University
OCT
09
2020
Theory Seminar
Aggregating Inconsistent Information in Ranking, Clustering and Phylogenetic Trees
Vaggos Chatziafratis, Visiting Faculty Researcher, Google Research
OCT
02
2020
Theory Seminar
New Techniques for Proving Fine-Grained Average-Case Hardness
Andrea Lincoln, Postdoc, UC Berkeley
SEP
25
2020
Theory Seminar
Hypergraph k-cut for fixed k in deterministic polynomial time
Karthik Chandrasekaran, Assistant Professor, UIUC
SEP
18
2020
Theory Seminar
Non-Adaptive Adaptive Sampling in Turnstile Streams
Sepideh Mahabadi, Research Assistant Professor, Toyota Technological Institute at Chicago (TTIC)
SEP
11
2020
Theory Seminar
The Menu-Size of Approximately Optimal Auctions
Yannai A. Gonczarowski
AUG
06
2020
Dissertation Defense
Efficiency in Machine Learning with Focus on Deep Learning and Recommender Systems
Amy Nesky
JUL
28
2020
CUOS Seminar | Dissertation Defense
Towards the First Practical Applications of Quantum Computers
Kevin Sung
JUN
30
2020
Dissertation Defense
A Parallel Tensor Network Contraction Algorithm and Its Applications in Quantum Computation
Fang Zhang
MAR
20
2020
Theory Seminar
An Algorithm for Hypergraph k-Cut
Karthik Chandrasekaran, Assistant Professor, University of Illinois, Urbana-Champaign
MAR
18
2020
Faculty Candidate Seminar
Learning from Societal Data: Theory and Practice
Ramya Vinayak, Postdoc, University of Washington
MAR
10
2020
Faculty Candidate Seminar
Algorithmic Paradigms for Dynamic Graphs
Thatchaphol Saranurak, Research Assistant Professor, Toyota Technological Institute at Chicago
MAR
06
2020
Theory Seminar
Towards a Unified Theory of Matching Sparsifiers
Aaron Bernstein, Asst. Professor, Rutgers University
FEB
07
2020
Theory Seminar
Security Games: Quasi-Regular Sequences, and a new version of TSP
David Kempe, Professor, University of Southern California
JAN
16
2020
Faculty Candidate Seminar
Sketching Graphs and Matrices
Greg Bodwin, Postdoc, Georgia Tech
JAN
14
2020
Faculty Candidate Seminar
On Sunflowers and Its Friends in Computer Science and Mathematics
Jiapeng Zhang, Postdoc, Harvard University
JAN
09
2020
Faculty Candidate Seminar
Data Structures Meet Circuits and Cryptography
Sasha Golovnev, Postdoc, Harvard University
DEC
06
2019
Theory Seminar
The Complexity of Finding S-factors in Regular Graphs
Sanjana Kolisetty and Linh Le
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
NOV
15
2019
Theory Seminar
An Adaptive Step Toward the Multiphase Conjecture
Omri Weinstein, Asst. Professor, Columbia University
NOV
01
2019
Theory Seminar
Cup Emptying Games and I/O Scheduling
Michael A. Bender , Professor, Stony Brook University
OCT
18
2019
Theory Seminar
Parallelizing Greedy for Submodular Set Function Maximization
Kent Quanrud, Asst. Professor, Purdue University
OCT
11
2019
Theory Seminar
The polymorphic gateway between structure and algorithms: Constraint Satisfaction and Beyond
Venkatesan Guruswami, Professor, Carnegie Mellon University
SEP
13
2019
Theory Seminar
Expander Decompositions: Fast Algorithms and Applications
Thatchaphol Saranurak, Research Assistant Professor, TTI-Chicago
2024
2023
2022
2021
2020
Home
People
Faculty
PhD Students
Staff
News
Seminars
Contact
PhD Students