Welcome to Combinatorics and Optimization
Spring 2018 Undergraduate Research Assistantship Program (URA). Applications for the Spring 2018 program are now closed.
The very successful Tutte's 100th Distinguished Lecture Series has now completed. That success has led to a Tutte Distinguished Lecture once per term. The next lecture is:
Sergey Norin - November 2
*Recordings of occurred talks are all available on C&O's YouTube Channel.
New Deadline: February 1, '19
- Oct. 30, 2018
Ahmad Abdi was a University Finalist for the Alumni Gold Medal awarded to a Ph.D. student at the Fall 2018 convocation ceremonies.
- Oct. 26, 2018
Five C&O graduate students received their degrees at the Fall 2018 convocation ceremony.
- Oct. 18, 2018
Written by Institute for Quantum Computing staff
Quantum computers can solve a linear algebra problem faster than classical computers, according to a new study published in Science. The finding proves that constant-depth quantum circuits are more powerful than their classical counterparts, and provides a new sense of how quantum technology will be a key to more powerful computing.
- Nov. 14, 2018
Title: Why Random Reshuffling Beats Stochastic Gradient Descent
Speaker: Julian Romero Affiliation: University of Waterloo Room: MC 5479
Abstract: Over the first few lectures in the seminar we studied the Stochastic Gradient Descent (SGD) method
- Nov. 15, 2018
Title: A Short Proof of the Containers Theorem for Hypergraphs
Speaker: Michelle Delcourt Affiliation: University of Waterloo Room: MC 6486
Abstract: A modern trend in extremal combinatorics is extending classical results from the dense setting (e.g. Szemerédi's theorem)
- Nov. 16, 2018
Title: Stability Yields a PTAS for k-Median and k-Means Clustering
Speaker: Adam Brown Affiliation: University of Waterloo Room: MC 5479
Abstract: Previously, we have seen a variety of approximation methods for k-median, and last week we saw