AofA—International Meeting on Combinatorial, Probabilistic, and Asymptotic Methods in the Analysis of Algorithms

From Wikipedia, the free encyclopedia

AofA, the International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms is an academic meeting that has been held regularly since 1993 in the field of computer science, focusing on mathematical methods from analytic combinatorics and probability for the study of properties of algorithms and large combinatorial structures. In early years, different formal names were used, but the meeting and associated community of researchers has always been known as AofA.[1]


The tradition is a weeklong meeting, alternating between invited workshops and open refereed conferences with contributed papers chosen by a program committee. The meetings feature invited presentations from senior researchers, about half from within the community and half from related research areas. Since 2014, the inaugural lecture at each conference has been delivered by the winner of the Flajolet Lecture Prize.[2][3]


The proceedings of the conferences are now published by the Schloss Dagstuhl Leibniz Center for Informatics in the open access series Leibniz International Proceedings in Informatics. The proceedings are freely available from the conference website and also from DROPS, the Dagstuhl Research Online Publication Server. The proceedings of prior editions have been published in several venues, and special issues of several journals have been devoted to papers from AofA conferences.

Related meetings[edit]

From 2002 to 2008, the community organized a second meeting each even-numbered year, the Colloquium on Mathematics and Computer Science (MathInfo).[4] Due to overlap among participants and content, the community decided to merge the two meetings to the present format. From 2003 to 2019, the AofA community also organized the one-day ANALCO meetings at the SODA conference.[5]

The community has also organized symposia and special journal issues to celebrate Donald Knuth’s 1,000,0002 birthday,[6] to celebrate Philippe Flajolet’s 60th birthday,[7] to honor the memory of Phillipe Flajolet,[8][9] and to celebrate Don Knuth’s 80th birthday.[10]

AofA conferences are indexed by several bibliographic databases, including the DBLP, Google Scholar and The Collection of Computer Science Bibliographies.


AofA meetings have been held regularly since 1993 in Europe and North America, usually in the summer. Refereed conferences are in bold.[1]


  1. ^ a b "Analysis of Algorithms".
  2. ^ "Flajolet Prize".
  3. ^ "Problems That Phillipe Would Have Loved - AofA 2014 Lecture by Don Knuth" (PDF).
  4. ^ "Discrete Mathematics & Theoretical Computer Science - DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science".
  5. ^ "The First Workshop on Analytic Algorithmics and Combinatorics".
  6. ^ Flajolet, Philippe (January 25, 2001). "D⋅e⋅k=(1000)8". Random Structures & Algorithms. 19 (3–4): 150–162. doi:10.1002/rsa.10022. S2CID 209833638 – via Wiley Online Library.
  7. ^ "pf60".
  8. ^ "Philippe Flajolet and Analytic Combinatorics Conference in the memory of Philippe Flajolet Paris-Jussieu, 14-15-16 December 2011".
  9. ^ "Combinatorics, Probability and Computing: Volume 23 - Honouring the Memory of Philippe Flajolet - Part 1 | Cambridge Core". Cambridge Core.
  10. ^ "Home".

External links[edit]