2017/2018 Semester 1: CS6234 Advanced Algorithms

Course Description

This module is aimed at graduate students who are doing or intend to do advanced research in algorithms design and analysis in all areas of computer science. The module covers advanced material on combinatorial algorithms, with emphasis on efficient algorithms, and explores their use in a variety of application areas. Topics covered include, but are not restricted to, linear programming, graph matching and network congestion, approximation algorithms, randomized algorithms, online algorithms, and learning algorithms. The module will be a seminar-based module that will expose students to current research in these areas. By the end of the course students will be able to:

  • Independently explore and understand advanced topics in algorithms.
  • Understand and write formal mathematical proofs.
  • Employ fundamental concepts from theoretical computer science in their own research.

See the course IVLE website.

2016/2017 Semester 2: CS6283 Topics in Computational Social Choice

Course Description

Recent years have seen a dramatic rise in the use of algorithms for solving problems involving strategic decision makers. Deployed algorithms now assist in a variety of economic interactions, from kidney exchange and airport security, to allocating computational resources and dividing rent. We will explore foundational topics in computational social choice. Our exploration will begin from seemingly simple group decision making problems: selling items at an auction, dividing rent among roommates, allocating computational resources and more. These problems all require an interdisciplinary approach, combining ideas from economics, game theory and algorithmic analysis.

See the course IVLE website.