The 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, or simply AofA 2012, is the third joint meeting of two conferences, Mathematics and Computer Science (MathInfo) and Analysis of Algorithms (AofA). It is the 18th meeting in the AofA series---five separate MathInfo meetings were held, for a total of 23. Its main purpose is to exchange ideas and foster collaboration around the themes of analytic, combinatorial and probabilistic methods, randomized algorithms, and theoretical aspects of trees, graphs, networks, strings and other mathematical structures. Topics include

• Properties of large randomly formed data structures
• Probabilistic methods for the analysis of algorithms
• Combinatorial methods for the analysis of algorithms
• Analytic tools for the analysis of algorithms
• New results concerning average case analysis of classical or new algorithms
• Analytical and enumerative combinatorics
• Random trees and graphs
• Branching processes
• Stochastic processes in relation with random discrete structures
• Random walks
• Discrete probabilities
• Random generation of combinatorial structures
• Data compression and language-modeling methods.
• Performance evaluation

The meeting is dedicated to the memory of Philippe Flajolet.