|Professor :||Lucia Moura|
||Course Description and Outline
Office hours with Professor during December:
Wednesdays 2:00-4:00 (Dec 4, 11, 18) or by appointment.
References and resources
Lecture schedule(sorry schedule not complete)
Assignments: A1 (ps,pdf) (sorry A2 and A3 not available online)
|Brief Description:||The main theme of the course is algorithms for the generation, enumeration
and search of combinatorial objects.
Combinatorial objects/structures include: sets, lists, strings, permutations, graphs and set systems.
D. Kreher and D. Stinson, "Combinatorial Algorithms: generation, enumeration and search", CRC Press, 1998.
Advanced topics will be complemented with papers/book chapters.
|Focus of the course:||Combinatorial problems arise in all areas of computer science, engineering and mathematics. Students will learn fundamental and advanced techniques for search and generation problems and choose a topic of their interest for a project. Ideally the project will be on the use of these techniques to solve problems on the student's area of research/interest. A typical project will involve reading research papers, and designing/implementing algorithms.|
Any questions about the course contents or the use of these techniques in specific problems/areas? Please, contact the instructor: firstname.lastname@example.org.