Last uodate: June 19th, 2013

Invited Lectures

• Joachim M. Buhmann: What is the information content of an algorithm?
• Rudolf Grübel: Combinatorial Markov Chains (+ animation)
• Mihyun Kang: Phase transition in random discrete structures
• Gábor Lugosi: Concentration inequalities and the entropy method
• Cyril Nicaud: Analysis of Algorithms and Language Theory
• Konstantinos Panagiotou: Going After the k-SAT Threshold (Powerpoint)
• Michèle Soria: Combinatorial Systems and Newton iteration
• Alfredo Viola: 50 years of Linear Probing Hashing

Contributed Talks

• Yuliy Baryshnikov: Persistence Homology for Brownian Bridges (your browser must support MathJax)
• Miklós Bóna: Algorithms helping Enumeration in Pattern Avoiding Permutations
• Jérémie Bouttier: Counting irreducible maps via substitution and bijections
• Milan Bradonjic: Bootstrap Percolation on Periodic Trees
• Marie-Louise Bruner: Label patterns in mappings
• Michael Drmota: Coefficients of positive algebraic functions
• Amalia Duch: Quad-K-d Trees
• Jim Fill: Partitions with Distinct Multiplicities of Parts: On an "Unsolved Problem" Posed by Herbert Wilf
• Jason Gao: Part Sizes of Smooth Supercritical Compositional Structures
• Daniele Gardy: Statistics on restricted lambda-terms
• Bernhard Gittenberger: Associative and commutative tree representations for Boolean functions
• Alexander Gnedin: Generalized Erdős-Turán laws for the order of random permutation
• Clemens Heuberger: Analysis of the binary asymmetric joint sparse form
• Cecilia Holmgren: Bootstrap percolation on Galton-Watson trees
• Hsien-Kuei Hwang: Periodic oscillations of the variance of trie statistics and related structures
• Philippe Jacquet: Green Leader Election
• Svante Janson: Weighted random staircase tableaux
• Marcos Kiwi: Towards the distribution of the size of the largest non-crossing matchings in random bipartite graphs
• Markus Kuba: Analysis of urn models with multiple drawings
• Guy Louchard: Sum of positions of records in random permutations: A precise analysis
• Jérémie Lumbroso: Some Fast Buffon Machines
• Hosam M. Mahmoud: Some Node Degree Properties of Series-Parallel Graphs Evolving Under a Stochastic Growth Model
• Cecile Mailler: Smoothing Equations for Large Pólya Urns
• Lucas Mercier: The height of the Lyndon tree
• Basile Morcrette: On unbalanced Pólya urns: Analytic Combinatorics strikes again
• Markus E. Nebel: Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort
• Ralph Neininger: Pólya urns via the contraction method
• Pierre Nicodème: Why Clump Analysis helps understanding DNA evolution?
• Elie de Panafieu: Phase Transition of Symmetric Inhomogeneous Random Graphs
• Robin Pemantle: Analytic Combinatorics in Several Variables
• Vlady Ravelomanana: On the probability of planarity of a random graph near the critical point
• Bruno Salvy: Implicit Species at the Basis of Analytic Combinatorics
• Mike Steele: When Means Bound Variances: Concentration for Recursively Determined Random Values
• Wojciech Szpankowski: Average Redundancy of the Shannon Code for Markov Sources
• Brigitte Vallée: Typical depth of a Digital Search Tree built on a general source
• Stephan Wagner: Compositions, canonical trees, acyclic digraphs and their common structural properties
• Mark D. Ward: Resolution of Thomas Ward's Question and Steven Finch's Conjecture. Precise Asymptotic Analysis of an Integer Sequence Motivated by the Dynamical Mertens' Theorem for Quasihyperbolic Toral Automorphisms
• Sebastian Wild: Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm
• Mark C. Wilson: Diagonal asymptotics for products of combinatorial classes

Special Session

Robert Sedgewick: Taking Education Online A Unique Opportunity for the New Millenium. The talk is an update of Analytic Combinatorics for the Masses.