Mercredi 2 Décembre


Retour à la vue des calendrier
Jour Semaine Mois Année
Mercredi 2 Décembre
Heure: 14:00 - 17:00
Lieu: Salle B107, bâtiment B, Université de Villetaneuse
Résumé: An overview of an analytic approach for branching processes (Colloquium : Les mercredis du LIPN)
Description: Mark Ward One approach to solving some questions in probability theory--especially questions about asymptotic properties of algorithms anddata structures--is to take an analytic approach, i.e., to utilizecomplex-valued methods of attack. These methods are especially useful withseveral types of branching processes, leader election algorithms, patternmatching in trees, data compression, etc. This talk will focus on some ofthe highlights of this approach. I endeavor to keep it at a level that isaccessible for graduate students.
Heure: 14:00 - 15:00
Lieu: Salle B107, bâtiment B, Université de Villetaneuse
Résumé: An Overview of an Analytic Approach for Branching Processes
Description: Mark Ward 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.
Heure: 15:00 - 18:00
Lieu: Salle B107, bâtiment B, Université de Villetaneuse
Résumé: An overview of an analytic approach for branching processes (Colloquium : Les mercredis du LIPN)
Description: Mark Ward One approach to solving some questions in probability theory--especially questions about asymptotic properties of algorithms anddata structures--is to take an analytic approach, i.e., to utilizecomplex-valued methods of attack. These methods are especially useful withseveral types of branching processes, leader election algorithms, patternmatching in trees, data compression, etc. This talk will focus on some ofthe highlights of this approach. I endeavor to keep it at a level that isaccessible for graduate students.