-
Dec 3-4
ARC Colloquium: Venkat Guruswami (CMU)
Klaus 1116 East
The polymorphic gateway between structure and algorithms: Beyond CSPs - Klaus 1116E at 11 am
-
Nov 26-27
ARC-TRIAD Colloquium: Michael Mitzenmacher (Harvard)
Klaus 1116 East
Bloom Filters, Cuckoo Hashing, Cuckoo Filters, Adaptive Cuckoo Filters, and Learned Bloom Filters - Klaus 1116E at 11 am
-
Nov 5-6
ARC Colloquium: Will Perkins (UIC)
Klaus 1116 East
Algorithmic Pirogov-Sinai theory - Klaus 1116 East at 11 am
-
Oct 29-30
ARC Colloquium: Sampath Kannan (UPenn)
Klaus 1116 East
Fairness in Algorithmic Decision Making - Klaus 1116 East at 11 am
-
Oct 22-23
ARC-TRIAD Colloquium: Leslie Valiant (Harvard)
Klaus 1116 East & West
Where Computer Science Meets Neuroscience - Klaus 1116 E & W at 11 am
-
Oct 15-16
ARC Colloquium: Lap Chi Lau (Waterloo)
Klaus 1116 East
The Paulsen problem, continuous operator scaling, and smoothed analysis - Klaus 1116E at 11 am
-
Oct 1-2
ARC-TRIAD Colloquium: Mary Wootters (Stanford)
MiRC Pettit 102 A&B
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes - MiRC Pettit 102 A&B at 11 am
-
Sep 24-25
ARC Colloquium: Tselil Schramm (Harvard/MIT)
MiRC Pettit 102 A&B
(Nearly) Efficient Algorithms for the Graph Matching Problem in Correlated Random Graphs - MiRC Pettit 102 A&B at 11 am
-
Sep 10-11
ARC Colloquium: Anand Louis (Indian Inst. of Science)
Klaus 1116 East
On the complexity of clustering problems - Klaus 1116E at 11 am
-
Apr 30 to May 1
ARC Colloquium: Nima Anari (Stanford)
Klaus 1116 East
Entropy, Log-Concavity, and a Deterministic Approximation Algorithm for Counting Bases of Matroids - Klaus 1116E at 11 am
-
Apr 23-24
ARC Colloquium: Alexandre Stauffer (Bath)
Klaus 1116E
Competition in randomly growing processes - Klaus 1116E at 11am
-
Mar 16-17
ARC Colloquium: Yin Tat Lee (UW)
MiRC Pettit 102A&B
l_p regression beyond self-concordance - MiRC Pettit Rm 102A&B at 11:00am
-
Mar 12-13
ARC Colloquium: Xiaorui Sun (Microsoft)
Klaus 1116E
The Query Complexity of Graph Isomorphism: Bypassing Distribution Testing Lower Bounds- Klaus 1116E at 11am
-
Mar 5-6
ARC-TRIAD Colloquium: Piotr Indyk (MIT)
Klaus 1116E
"Below P vs. NP: Conditional Quadratic-Time Hardness for Big Data Problems" - Klaus 1116E at 11am
-
Feb 23-24
ARC Colloquium: Sanjeev Arora (Princeton/IAS)
Klaus 2447 (classroom side of Klaus)
Toward theoretical understanding of deep learning - Klaus 2447 (classroom) at 11am
-
Feb 19-20
ARC Colloquium: Vivek Madan (UIUC)
Klaus 1116 East
Approximating Multicut and the Demand Graph - Klaus 1116 East at 11:00am
-
Feb 12-13
ARC Colloquium: Aaron Schild (Berkeley)
Klaus 1116 East
An almost-linear time algorithm for uniform random spanning tree generation - Klaus 1116 East at 11am
-
Feb 9-10
ARC Colloquium: Greg Bodwin (MIT)
Skiles 005
The Distance Oracle Hierarchy - Skiles 005 at 1pm
-
Feb 5-6
ARC Colloquium: Di Wang (Berkeley/GaTech)
Klaus 1116 East
Capacity Releasing Diffusion for Speed and Locality - Klaus 1116E at 11am
-
Jan 22-23
ARC-TRIAD Seminar - Yan Shuo Tan (Michigan)
Pettit Microelectronics Bldg - Pettit Rm 102A
Efficient algorithms for phase retrieval in high dimensions
-
Jan 17-18
ARC-TRIAD Seminar - Cong Han Lim (Wisconsin)
Groseclose 402
Towards Large-Scale Nonconvex/Stochastic Discrete Optimization