Seminars

There are no events currently scheduled.

Past Seminars

3:00pm – 4:00pm in 3725 Beyster Building

Or Zamir: Algorithmic Applications of Hypergraph and Partition Containers

3:00pm – 4:00pm in 3725 Beyster Building

Sasha Golovnev: Polynomial formulations as a barrier for reduction-based hardness proofs

3:00pm – 4:00pm in 3725 Beyster Building

Min Jae Song: Continuous LWE

Min Jae Song, New York University

2:00pm – 3:00pm

Manik Dhar: ℓ∞ linear hashing and two-sided Kakeya bounds

3:00pm – 4:00pm in 3725 Beyster Building

Sophie Huiberts: Smoothed analysis of the simplex method

Sophie Huiberts

3:00pm – 4:00pm in 3725 Beyster Building

Liren Shan: Higher-Order Cheeger Inequality for Partitioning with Buffers

3:00pm – 4:00pm in 3725 Beyster Building

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

2:00pm – 3:00pm in Remote/Virtual

William Hoza: Recent Progress on Derandomizing Space-Bounded Computation

3:00pm – 4:00pm in 3725 Beyster Building

Jessica Sorrell: Replicability in Learning

Jessical Sorrell

3:00pm – 4:00pm in 3725 Beyster Building

Yang Liu: Lessons on Algorithmic Graph Theory from Maxflow

3:00pm – 4:00pm in 3725 Beyster Building

Aaron Bernstein: Negative-Weight Single-Source Shortest Paths in Near-linear Time

3:00pm – 4:00pm in 3725 Beyster Building

Sorrachai Yingchareonthawornchai: Deterministic Small Vertex Connectivity in Almost Linear Time

Sorrachai Yingchareonthawornchai

3:00pm – 4:00pm in 3725 Beyster Building

Vincent Cohen-Addad: Sublinear time algorithms for Euclidean clustering coresets and correlation clustering

12:00pm – 1:00pm in 4941 Beyster Building

Haotian Jiang: Resolving Matrix Spencer Conjecture Up to Polylogarithmic Rank

3:00pm – 4:00pm in 3725 Beyster Building

Zeyu Guo: Fast Multivariate Multipoint Evaluation over All Finite Fields

3:00pm – 4:00pm in 3725 Beyster Building

Fernando Granha Jeronimo: Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification

Fernando Granha Jeronimo

3:00pm – 4:00pm in 3725 Beyster Building

Haotian Jiang: Minimizing Convex Functions with Integral/Rational Minimizers

3:00pm – 4:00pm in 3725 Beyster Building

Dissertation Defense

Dynamic Connectivity, Hopsets, and Byzantine Agreement

9:30am – 11:30am in 4941 Beyster Building

Mitali Bafna: Playing Unique Games on Certifiable Small-Set Expanders and High-Dimensional Expanders

3:00pm – 4:00pm in 3725 Beyster Building

Parth Mittal: Brooks’ Theorem in Graph Streams

3:00pm – 4:00pm

Huacheng Yu: TBD

3:00pm – 4:00pm in 3725 Beyster Building

Max Hopkins: Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments

3:00pm – 4:00pm in 3725 Beyster Building

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)

Ryan Williams: Constructive Separations and Their Consequences

Ryan Williams, Prof., MIT

3:00pm – 4:00pm in 3725 Beyster Building

Show All Past Events