User:Conrado Martinez Parra/sandbox
| Conrado Martinez Parra/sandbox | |
|---|---|
| Abbreviation | AofA |
| Discipline | Theoretical computer science |
| Publication details | |
| Publisher | Leibniz Center for Informatics |
| History | 2010– |
| Frequency | biannual |
| yes | |
The International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA) is an academic conference in the field of computer science. It is held every two years since 2010. It alternates with a series of events by the same acronym (and almost the same title, but these are meetings instead of conferences) tha are held in odd-numbered years. The main subject of the conference are the mathematical techniques and methods for the analysis of algorithms and data structures, as the name of the conference indicates, but contributions dealing with other applications of the techniques are also well received.
Since 2018 the proceedings are published by the 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 were published as volumes in the Discrete Mathematics and Theoretical Computer Science proceedings series (2010, 2012), in the HAL-Inria open archive (2014) and by the Jagiellonian University in Krákow (2016).
The conference is indexed by several bibliographic databases, including the DBLP, Google Scholar and The Collection of Computer Science Bibliographies.
History
[edit]The conference traces back its origins to a series of seminars celebrated in Dagstuhl in 1993 (seminar 9328), 1995 (seminar 9527) and 1997 (seminar 9728), organized by Philippe Flajolet, Rainer Kemp and Helmut Prodinger, also with Robert Sedgewick (1995) and Hosam M. Mahmoud (1997). It was decided then to continue on a yearly basis and the event was renamed International Seminar on the Average-Case Analysis of Algorithms, which was soon to be widely known under the acronym AofA. There have been a few special issues, for example those published in Random Structures and Algorithms, Algorithmica, Journal of Algorithms, and Combinatorics, Probability and Computing, dedicated to results that were presented in the AofA seminars. However, for several editions the AofA events remained informal, with no published proceeding and no formal peer-reviewed selection. Then it was decided to organize the event as an open conference International Conference on the Analysis of Algorithms, every two years, in odd-numbered years, with formal reviewing process and published proceedings (in the Discrete Mathematics and Theoretical Computer Science proceedings series). The first edition under the new format was in 2005. It was also decided that the seminar format should continue in even-numbered years, alternating with the conference editions. But then in 2008 it was decided to merge the AofA conference with another bi-annual conference, the Colloquium on Mathematics and Computer Science (MathInfo) which had started in 2000 and had a substantial intersection in scope, subjects and attendance. This merging was largely promoted by Philippe Flajolet, as a leader of the two research communities (AofA and MathInfo) and member of the respective Steering Committees. The new series of events, the International Conference on Probabilistic, Combinatorial and Asymptotic Methos for the Analysis of Algorithms and the International Meeting on Probabilistic, Combinatorial and Asymptotic Methos for the Analysis of Algorithms, would take place on alternating years; the conferences in even-numbered years, starting 2010, and the seminars in odd-numbered years starting 2009.
Philippe Flajolet Lecture Award
[edit]With the untimely death of Philippe Flajolet in March 2011, the AofA community organized a tribute event the same year, but some time later the Steering Committee of AofA proposed the creation of the Philippe Flajolet Lecture Award. The prize is awarded every two years and the awardee delivers the opening lecture in the next AofA edition. Due to the pandemics, Wojciech Szpankowski, the Flajolet Lecture awardee for 2020 will deliver his lecture in AofA 2022. Previous awardees are Donald E. Knuth (2014), Robert Sedgewick (2016) and Luc Devroye (2018). The award is choosen by an independent committee of experts.
See also
[edit]- The list of computer science conferences contains other academic conferences in computer science.
External links
[edit]- AofA main website.
- AofA at DBLP.
- Leibniz International Proceedings in Informatics home page
- Proceedings of AofA 2005*
- Proceedings of AofA 2007*
- Proceedings of AofA 2010
- Proceedings of AofA 2012
- Proceedings of AofA 2014
- Proceedings of AofA 2016
- Random Structures and Algorithms, 10(1--2), 1997
- Algorithmica 22(4), 1998
- Algorithmica 29(1--2), 2001
- Journal of Algorithms 44(1), 2002
- Combinatorics, Probability and Computing 13(4--5), 2004