Campus Event Calendar: Cyril Banderier (11/14/2001 in 46.1

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

What and Who

Analytic combinatorics: a surveychen

Cyril Banderier

Algorithms Project INRIA (France)

AG1 Mittagsseminar (others' work)

AG 1

AG Audience

English

Note: We use this to send email in the morning.

Date, Time and Location

Wednesday, 14 November 2001

13:30

30 Minutes

46.1 - MPII

024

Saarbrücken

Abstract

Generating functions are a powerful tool which allows to enumerate combinatorial structures (words, trees, graphs, maps, factorization into primes, random walks, permutations, partitions ...)

In combination with complex analysis, they give exact asymptotics and even the limit laws which are hidden behind these combinatorial structures.

I will illustrate these 2 assertions with examples from number theory, language theory, probability theory, analysis of algorithms, random generation, computational biology...

Contact

Hannah Bast

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Imprint / Impressum | Data Protection / Datenschutzhinweis