Computer Science Theory Seminar - Fall 2019

Usually meets Wednesday at 4:00 pm in SEO 1325.
DateSpeakerTitle
August 28
(4:15 pm; 1325 SEO)
Youming Qiao
University of Technology Sydney
Matrix spaces as a linear algebraic analogue of graphs
September 4
(4:15 pm; 1325 SEO)
Arturs Backurs
TTI Chicago
Efficient Density Evaluation for Smooth Kernels
September 11
(4:15 pm; 1325 SEO)
Anastasios Sidiropoulos
UIC
Algorithms for metric learning via contrastive embeddings
September 18
September 25
(4:15 pm; 1325 SEO)
Akash Kumar
Purdue
Finding minors in sublinear time in bounded-degree graphs with (almost) optimal one-sided query complexity
October 2
October 9
(4:15 pm; 612 SEO)
Vishesh Jain
MIT
TBA
October 16
October 22
(4:15 pm; 1325 SEO)
Karthik Chandrasekaran
University of Illinois
Improving the smoothed complexity of FLIP for max cut problems
October 23
October 30
November 6
November 13
November 20
November 27
December 4
Web Privacy Notice HTML 5 CSS FAE
UIC LAS MSCS > persisting_utilities > seminars > schedule by topic