International Conference on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms

Speakers: Sourav Chatterjee; Michael Fuchs; Cecilia Holmgren; Marni Mishna; Dan Romik; Bruno Salvy; Neil J. A. Sloane; Perla Sousi

Analysis of Algorithms (AofA) is a field at the boundary of computer science and mathematics. The goal is to obtain a precise understanding of the asymptotic, average-case characteristics of algorithms and data structures. A unifying theme is the use of probabilistic, combinatorial, and analytic methods. The objects to be studied include random branching processes, graphs, permutations, trees, and strings.