LEARNING OUTCOMES
In this course, students will get familiar with combinatorics through selected exciting ideas in theoretical computer science (in particular, algorithms and complexity). You will obtain a basic understanding of various types of combinatorial objects and their relationships. Upon completing the course you are able to apply basic combinatorial analysis and proof techniques.
Credits: 5
Schedule: 19.04.2022 - 25.05.2022
Teacher in charge (valid for whole curriculum period):
Teacher in charge (applies in this implementation): Parinya Chalermsook
Contact information for the course (applies in this implementation):
CEFR level (valid for whole curriculum period):
Language of instruction and studies (applies in this implementation):
Teaching language: English. Languages of study attainment: English
CONTENT, ASSESSMENT AND WORKLOAD
Content
valid for whole curriculum period:
- Forbidden Structures, Geometry, and Data structures: Davenport-Schinzel Sequences, Zarankiewitz problems
- Algorithms through Ramsey-type results: Independent set and graph coloring
- Concentration Inequalities: Chernoff bound and Martingale, applications in algorithms design.
- Lovasz Local Lemma: Algorithmic Proofs and applications in routing.
- Set systems, VC-dimension, epsilon-nets, and discrepancies: Applications in computational geometry.
Assessment Methods and Criteria
valid for whole curriculum period:
Contribution to the course wiki. Exercises. Independent project.
Workload
valid for whole curriculum period:
Lectures. Exercise sessions. Independent work.
DETAILS
Substitutes for Courses
valid for whole curriculum period:
Prerequisites
valid for whole curriculum period:
FURTHER INFORMATION
Further Information
valid for whole curriculum period:
Teaching Language : English
Teaching Period : 2022-2023 No teaching
2023-2024 No teachingEnrollment :
Registration for Courses: In the academic year 2021-2022, registration for courses will take place on Sisu (sisu.aalto.fi) instead of WebOodi.