Course Class Schedule Exam Date Class Course

Course Remarks
Coordinator Venue* & Time Size AU
MAS712 Prof Xing Monday 1:30pm to 24-NOV- 30 4
Algebraic Chaoping 5:30pm 2017 (Fri)
Methods MAS Executive 9:00AM-
[Class Group Classroom 1 12:00PM
1]
Commence Date: 14-
AUG-2017
MAS714 Asst Prof Bei Monday 10:30am 27-NOV- 30 4 Continuous
Algorithms & Xiaohui to 12:30pm 2017 Assessments: 40%
Theory Of SPMS-TR+17 (Mon) Examination: 60%
Computing 9:00AM-
[Class Group Tuesday 9:30am to 12:00PM
1] 11:30am
SPMS-TR+17

Commence Date:
14-AUG-2017
MAS711 Assoc Prof Tuesday 1:30pm to 28-NOV- 30 4
Discrete Frederique 3:30pm 2017 (Tue)
Methods Elise Oggier SPMS-TR+17 9:00AM-
[Class Group 12:00PM
1] Wednesday 9:30am to
11:30am
SPMS-TR+17

Commence Date: 14-

AUG-2017
MAS790 Asst Prof Friday 10:30am to Not 30 4 - No formal exam
Graduate Peyrin 12:30pm Applicable
Seminar - Thomas SPMS-TR+11
Discrete
Mathematics Commence Date: 14-
I AUG-2017
[Class Group
1]

MAS712 Algebraic Methods

This class will not go very deep into a particular algebra topic, but instead cover several basic concepts from
scratch, including :
- Group theory: quotient group, group action, Sylow Theorems
- Commutative ring theory: ideals, principal ideal domain, unique factorization domain, Euclidean domain
- Field and Galois theory: field extension, finite fields, normality, separability, Galois correspondance .

MAS 714 Algorithms and Theory of Computing

• Models of Computation
• Basic Algorithms (Sorting and Searching)
• Algorithm Design (greedy, divide and conquer, dynamic programming)
• Graph Algorithms
• Time Complexity
• NP Completeness
• Computability
• Space Complexity
• Formal Languages and Automata
• Circuits
Textbooks
• T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to Algorithms (any edition), MIT Press.
• M. Sipser: Introduction to the Theory of Computation (any edition).
References
- S. Arora, B. Barak: Computational Complexity,
- A Modern Approach. Cambridge University Press, 2009.

MAS 711- Discrete Methods

Enumeration, graph and network algorithms, finite fields and applications, Boolean algebras, polyhedra and
Linear Programming, algorithmic complexity

Recommended Textbook & Reference

J.H. Van Lint & R.M. Wilson “A Course in Combinatorics”, Cambridge.

MAS 790 Graduate Seminar – Discrete Mathematics I

Topics will be chosen to cover new developments in research in Discrete Mathematics and according to the
interests of students.
Course Outline
The objective of this course is to study some combinatorial techniques as well as their ingenious applications,
a focus will be on the design theory and its applications to cryptography. Some selected topics include:
• Constructions of authentication codes from orthogonal arrays.
• Constructions of secret sharing from orthogonal arrays and cumulative arrays.
• Constructions of Group Testing from BIBDs.
• Orthogonal arrays and two-point sampling.
• Perfect hash families and broadcast encryption.
Recommended Reading:
Stinson, Douglas R. Combinatorial designs : constructions and analysis, Springer, 2004.