Welcome to Combinatorics and Optimization
The Department of Combinatorics and Optimization at the University of Waterloo invites applications for two tenure-track faculty positions at the rank of Assistant Professor.
Spring 2018 Undergraduate Research Assistantship Program (URA). Applications for the Spring 2018 program are now closed.
University of Waterloo, May 5 - August 18, '17
*Recordings of occurred talks are all available on C&O's YouTube Channel.
Deadline: February 1, '18
- Jan. 11, 2018
Professor William Cook delivered an MAA invited address entitled "Information, Computation, Optimization: Connecting the Dots in the Traveling Salesman Problem" a the Joint Mathematics Meeting in San Diego.
- Nov. 3, 2017
Professor Karen Yeats has been awarded a Tier 2 Canada Research Chair (CRC) in Combinatorics of Quantum Field Theory.
- Oct. 23, 2017
Professor Fan Chung Graham was awarded an honorary doctorate in mathematics (D.Math.) at the October 20 convocation ceremony at the University of Waterloo.
- Jan. 17, 2018
Title: Stochastic algorithms for distributed optimization and machine learning
Speaker: Yi Zhou Affiliation: Georgia Institute of Technology Room: MC 5501
In the big data era, machine learning acts as a powerful tool to transform data into knowledge that helps us make predictions and decisions. It has strong ties to the field of optimization, in the way the latter provides methods and theory.
- Jan. 18, 2018
Title: Quantum Latin Squares and Magic Unitaries
Speaker: Chris Godsil Affiliation: University of Waterloo Room: MC 6486
A quantum Latin square is an n x n array of vectors such that vectors in any row or any column form an orthonormal basis for Cn. A magic unitary matrix is an n x n array of projections such that each row and column sums to I.
- Jan. 22, 2018
Title: Are cryptosystems based on ideal lattices quantum-safe ?
Speaker Jean-Francois Biasse Affiliation: University of South Florida Room: QNC 1501
Shor's algorithm factors RSA integers and solves the Discrete Logarithm Problem (DLP) in quantum polynomial time. Therefore, alternatives to these cryptosystems must be developed to replace the current cryptographic schemes. One of the most interesting family of schemes that have been proposed for the replacement of RSA-based and DLP-based primitives relies on the hardness of finding short vectors in Euclidean lattices.