CS Collections
Analytic Combinatorics
[Premium Videos] 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 analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The course is offered as a upper level CS elective (https://ac.cs.princeton.edu/online/)
Author: Philippe Flajolet and Robert Sedgewick, Princeton
Quiz/interview questions (on subscription)
Synchronized transcripts
Deep search
Private notes
9 modules / 44 videos
2 public modules

Analytic Combinatorics

You are in guest access. login to access all features including questions. Login

CUvids, Inc. 100 Overlook Center, 2nd Floor, Princeton, NJ 08540