AofA : Méthodes probabolistes, combinatoires et asymptotiques pour l'analyse d'algorithmes — AofA: Probabilistic, Combinatorial and Asymptotic M

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. This discipline is often traced back to Donald E. Knuth, whose fundamental books, “The Art of Computer Programming”, established ties between areas of study that include discrete mathematics, combinatorics, probability theory, analytic number theory, asymptotic analysis, and complexity theory. Starting in 1993, notably thanks to the efforts of Philippe Flajolet, a series of international workshops and conferences entirely devoted to the Analysis of Algorithms has been established. These are attended by the major actors of the field. Nowadays, these yearly conferences take place on a biennial schedule: conferences with submissions of articles in even-numbered years and more informal workshops by invitation in odd-numbered years as this 2019 meeting. The purpose of the workshop is to stimulate research in the field by providing a regular forum for researchers to come and exchange ideas and by attracting prominent people from related areas to the field.