CompSci 269S, Winter 2022: Theory Seminar

The Theory Group normally meets Fridays at 1:00pm; this quarter we are in DBH 1300 but online over zoom for now.

Below is this quarter's schedule.

Jan 14: Thorben Tröbst; Online Matching with High Probability
Jan 21: Sherif Abdelkarim; Prophet Inequalities and its Implications to Pricing Mechanisms and Online Algorithms; Freddy Reiber; In Congestion Games, Taxes Achieve Optimal Approximation
Jan 28: Nitya Raju; The General Graph Matching Game: Approximate Core
Feb 4: Ofek Gila; Algorithms Using Local Graph Features to Predict Epidemics; Ryuto Kitagawa; Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set
Feb 11: Shion Fukuzawa; Geometry Processing with Intrinsic Triangulations
Feb 18: Evrim Ozel; Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees
Feb 25: No seminar
March 4: No seminar
March 11: Ramtin Afshar; Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm; Daniel Frishberg; Rapidly Mixing Gibbs Sampling for a Class of Factor Graphs Using Hierarchy Width

See also the ACO seminar (Thursdays 2-3).