Seminars

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 3725 Beyster Building

Add to Google Calendar

Past Seminars

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

Santhoshini Velusamy: Approximating CSPs in the streaming setting

Santhoshini Velusamy

3:00pm – 4:00pm

Robert Robere: Pseudorandom Self-Reductions for NP-Complete Problems

Robert Robere, Prof., McGill University

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

Deeksha Adil: Fast Algorithms for l_p-Regression and Other Problems

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

Michael Dinitz: Faster Matchings via Learned Duals

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

Ce Jin: Fast Low-Space Algorithms for Subset Sum

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

Arun Jambulapati: Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers

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

Vera Traub: Better-Than-2 Approximations for Weighted Tree Augmentation

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

A Characterization of Approximability for Biased CSPs

Suprovat Ghoshal

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

Show All Past Events