Participants are expected to arrive on Sunday, June 17, 2012. The conference will start properly at 9am on Monday, June 18, 2012, and end Friday afternoon, June 22, 2012. No excursion is planned.

All talks are in room 1140 of the André-Aisenstadt building, Université de Montréal. Registration can be done in room 5345 of the same building at all times except on Monday, June 18, when it is organized in room 1221 of the André-Aisenstadt building. Coffee breaks are in room 1221.

Sunday, June 17, 2012
	Participants arrive, relax and sleep.
Monday, June 18, 2012
9-9:30am	Coffee
9-9:30am	Pick up registration material in room 1221 (first floor, André-Aisenstadt building, Université de Montréal).
9:30-10:30am	Invited opening plenary lecture: Avi Wigderson (IAS, USA): Population recovery via partial identification
10:30-11am	Coffee break
11-12:30am	Frederique Bassino, Cyril Nicaud and Pascal Weil: Generic properties of random subgroups of a free group for general distributions Christine Fricker, Nicolas Gast and Hanene Mohamed: Mean field analysis for inhomogeneous bike sharing systems Dominique Bontemps, Stephane Boucheron and Elizabeth Gassiat: About adaptive coding over countable alphabets
12:30-2pm	Lunch break
2-3:30pm	Michael Fuchs, Chung-Kuei Lee and Helmut Prodinger: approximate counting via the Poisson-Laplace-Mellin method Ahmed Helmi, Jérémie Lumbroso, Conrado Martínez and Alfredo Viola: Counting distinct elements in data streams: the random permutation viewpoint Jérémie du Boisberranger, Danièle Gardy and Yann Ponty: The weighted words collector
3:30-4am	Coffee break
4-5pm	Olivier Bodini, Antoine Genitrini and Frédéric Peschanski: Enumeration and random generation of concurrent computations Olivier Roussel, Michèle Soria, Alexis Darrasse and Konstantinos Panagiotou: Biased Boltzmann samplers and generation of extended linear languages with shuffle
6:15-8:15pm	Reception off campus [Venue to be announced]
Tuesday, June 19, 2012
8:30-9am	Coffee
9-10am	Invited plenary lecture: Amin Coja-Oghlan (Warwick, UK): Phase transitions and computational complexity
10-10:30am	Coffee break
10:30-12am	Sarah Miracle, Dana Randall, Amanda Streib and Prasad Tetali: Mixing times of Markov chains on 3-orientations of planar triangulations Daria Schymura: Matching solid shapes in arbitrary dimension via random sampling Guy Fayolle and Kilian Raschel: Some exact asymptotics in the counting of walks in the quarter plan
12-1:30pm	Lunch break
1:30-3pm	Yongwook Choi, Charles Knessl and Wojciech Szpankowski: A new binomial recurrence arising in a graphical compression algorithm Jacek Cichon and Zbigniew Gobiewski: On Bernoulli sums and Bernstein polynomials John Kieffer: Asymptotics of divide-and-conquer recurrences via iterated function systems
3-3:30pm	Coffee break
3:30-5pm	Edward Bender, Rodney Canfield and Zhicheng Gao: Locally restricted compositions IV--nearly free large parts and gap-freeness Dimbinaina Ralaivaosaona: A phase transition in the distribution of the length of integer partitions Valentin Feray: Asymptotic behavior of some statistics in Ewens random permutations
6-8pm	Reception off campus [Venue to be announced]
Wednesday, June 20, 2012
8:30-9am	Coffee
9-10am	Invited plenary lecture: Svante Janson (Uppsala, Sweden): Simply generated trees, conditioned Galton--Watson trees, random allocations and condensation
10-10:30am	Coffee break
10:30-12:30am	Stephan Wagner: Additive tree functionals with small toll functions and subtrees of random trees Bernhard Gittenberger and Veronika Kraus: On the number of transversals in random trees Florian Heigl and Clemens Heuberger: Analysis of digital expansions of minimal weight Jeffrey Gaither, Yushi Homma, Mark Sellke and Mark Daniel Ward: On the number of 2-protected nodes in tries and suffix trees
Thursday, June 21, 2012
8:30-9am	Coffee
9-10am	Invited plenary lecture: Claire Mathieu (Brown, USA): Algorithms for optimization over noisy data
10-10:30am	Coffee break
10:30-12am	Brigitte Vallée: The Euclid algorithm is ''totally'' gaussian Michael Drmota, Bernhard Gittenberger and Johannes Morgenbesser: Infinite systems of functional equations and Gaussian limiting distributions
12-2pm	Lunch break
2-3:30pm	Patrick Bindjeme and James Allen Fill: Exact L^2-distance from the limit for quickSort key comparisons (extended abstract) Patrick Bindjeme and James Allen Fill: The limiting distribution for the number of symbol comparisons used by quickSort is nondegenerate (extended abstract) Yuliy Baryshnikov, Lisa Hickok, Nathan Orlow and Sarah Son: Stokes polyhedra for X- shaped polyminos [15 min] Idan Eisner and Alek Vainshtein: Domination analysis for scheduling on nonpreemptive uniformly related machines [15 min]
3:30-4am	Coffee break
4-5pm	Markus Kuba and Alois Panholzer: On death processes and urn model Basile Morcrette and Hosam M. Mahmoud: Exactly solvable balanced tenable urns with random entries via the analytic methodology
5-6pm	AofA business meeting
7 onwards	Wine, cheese and desserts, off campus
Friday, June 22, 2012
8:30-9am	Coffee
9-10am	Invited plenary lecture: Michael Drmota (TU Wien, Austria): Extremal parameters in critical and subcritical graph classes
8:30-9am	Coffee
10-10:30am	Coffee break
10:30-12am	Loick Lhote and Manuel Lladser: Toward the asymptotic count of bi-modular hidden patterns under probabilistic dynamical sources: a case study Philippe Jacquet and Wojciech Szpankowski: Joint string complexity for Markov sources Filip Zagorski and Zbigniew Golebiewski: On greedy trie execution [15 min] D. Recoskie and Joe Sawada: The taming of two alley cats [15 min]
12 noon	Closing words