Theory seminar meets weekly on Mondays, 10-11 a.m. Central Daylight/Standard Time, via Zoom.

To receive updates, including the Zoom meeting link, subscribe to the theorycs mailing list. If you are interested in giving a talk, please email Ian Ludden (iludden2 [at] illinois [dot] edu).

Schedule

August 31. Xinyu Wu
Explicit near-fully X-Ramanujan graphs

September 7. No talk. (Labor Day)

September 14. Shant Boodaghians
The Pandora’s Box Problem with Order Constraints

September 21. Calvin Beideman
Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs

September 28. Patrick Lin
How to Morph Graphs on the Torus

October 5. Vasilis Livanos
An Introduction to Prophet Inequalities

October 12. Sariel Har-Peled
Reliable Spanners for Metric Spaces

October 19. Sagnik Mukhopadhyay
Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms

October 26. Parinya Chalermsook
Coloring and Maximum Weight Independent Set of Rectangles

November 2. Karthik Chandrasekaran
Hypergraph k-cut for fixed k in deterministic polynomial time

November 9. Ruta Jawale
SNARGs and PPAD Hardness from Sub-exponential LWE

November 16. No talk. (FOCS 2020)

November 23. No talk. (Fall Break)

November 30. Samson Zhou
Near Optimal Linear Algebra in the Online and Sliding Window Models

December 7. Zhengcheng Huang
Improved Upper and Lower Bounds for LR Binary Tree Drawings

December 14. Manuel Torres
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems