CS 7822 - Special Topics in Algorithms

Spring. 1 credit. S/U grades only.

Prerequisite: CS 6820. Enrollment limited to: MS and Ph.D. students. Undergrad and M.Eng. by permission of instructor.

R. Kleinberg.

This is an advanced Ph.D.-level seminar on special topics in algorithms. Recent papers in a selected research area will be read and presented. Topic for Spring 2020: the geometry of polynomials and its algorithmic applications. Sub-topics include the method of interlacing families and its applications to the Kadison-Singer problem and to constructing Ramanujan graphs; completely log-concave polynomials and their applications to sampling and counting problems.

Print this Page