Résumé : One approach to solving some questions in probability theory--especially questions about asymptotic properties of algorithms and data structures--is to take an analytic approach, i.e., to utilize complex-valued methods of attack. These methods are especially useful with several types of branching processes, leader election algorithms, pattern matching in trees, data compression, etc. This talk will focus on some of the highlights of this approach. I endeavor to keep it at a level that is accessible for graduate students.
|Dernière modification : mercredi 28 octobre 2015||Contact : Cyril.Banderier at lipn.univ-paris13.fr|