Master of Mathematics in Computer Science - Algorithms and Complexity

The study of the design, analysis and implementation of algorithms is at the heart of computer science. It is difficult to envision any large-scale computer application, such as an operating system, compiler, large-scale database system or computer graphics package that does not rely on the use of effective algorithms and data structures. Researchers in our group explore a variety of algorithm types and areas of application. Applications include computational geometry, graph theory (including graph drawing), bioinformatics, learning theory, network routing, search engines, database systems, quantum computing, number theory and formal languages. Approaches include the study of randomized algorithms, adaptive techniques, approximation algorithms, fixed-parameter tractable algorithms and the mathematical analysis of the performance of algorithms, as well as issues of implementation. The organization and structuring of data, fundamental to the performance of most algorithms, is a major area of study.

An Honours Bachelor degree in Computer Science or Engineering (or equivalent degree) with at least a 78% standing.ResumeSupplementary information form (SIF)The SIF contains questions specific to your program, typically about why you want to enrol and your experience in that field. Review the application documents web page for more information about this requirementIf a statement or letter is required by your program, review the writing your personal statement resources for helpful tips and tricks on completionTranscript(s)ReferencesThree references are required; at least two academic