Category Archives: Mathemathic

Analytic Combinatorics, Part I starts Feb 8th 2013

The Analytic Combinatorics, Part I course launches on Friday Feb 8th 2013. Each lecture corresponds to a chapter in An Introduction to the Analysis of Algorithms, 2nd edition, so the instructor encourage everyone to study the corresponding chapter in conjunction with the lectures.

Summary of the Course:

Analytic Combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the scientific analysis of algorithms in computer science and for the study of scientific models in many other disciplines, including probability theory, statistical physics, computational biology and information theory. Part I of this course covers recurrence relations, generating functions, asymptotics, and fundamental structures such as trees, permutations, strings, tries, words, and mappings, in the context of applications to the analysis of algorithms.

Enjoy the course