Fall 2018

CSC 2421H Topics in Algorithms : Graphs, Matrices, and Optimization

This course will focus on research topics in modern algorithm design, including tools, techniques, and their applications to the design of algorithms for fundamental problems in theoretical computer science. In this offering, the focus will be on studying properties of graphs, and designing algorithms for graph problems using numerical algorithms, and methods from continuous optimization and analysis.

Winter 2018

CSC 263H5 Data Structures and Analysis

This course covers standard abstract data types, such as graphs, dictionaries, priority queues and disjoint sets, and a variety of data structures for implementing these abstract data types, such as balanced search trees, hashing, heaps and disjoint forests.

Fall 2017

CSC 2421H Topics in Algorithms : Fast Algorithms via Continuous Methods

This course will focus on research topics in modern algorithm design, including tools, techniques, and their applications to the design of algorithms for fundamental problems in theoretical computer science. In this offering, the focus will be on methods from continuous optimization and analysis, and their applications to the design of fast algorithms for fundamental problems in theoretical computer science and numerical linear algebra.

Spring 2015

CPSC 665 : An Algorithmist's Toolkit

This course focussed on tools and techniques in modern algorithm design (mostly from optimization and analysis), and their applications to the design of fast algorithms for fundamental problems in theoretical computer science, and numerical linear algebra.