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.
The area of Analysis of Algorithms is frequently traced to 27 July 1963, when Donald E. Knuth wrote "Notes on Open Addressing". His fundamental books, The Art of Computer Programming, established ties between areas on study that include discrete mathematics, combinatorics, probability theory, analytic number theory, asymptotic analysis, and complexity theory.
Thirty years after Knuth's pioneering paper, the first seminar entirely devoted to the Analysis of Algorihtms was held at Dagstuhl, Germany, in 1993. Since 1993, several series of seminars related to analysis of algorithms have been established. These take place on an annual or biennial schedule; see the Meetings page for links to some of these meetings.
This website is dedicated to promoting the Analysis of Algorithms. All visitors are welcome. The bulletin board and webpages below are intended to be a forum of resources to assist both new and experienced scholars in their research and applications.
Bob Sedgewick, Chair (until AofA'18)
Nicolas Broutin (until AofA'18)
Hsien-Kuei Hwang (until AofA'22)
Conrado Martinez (until AofA'20)
Ralph Neininger (until AofA'22)
Michèle Soria (until AofA'20)
Click here for Proposed Bylaws
2018 Flajolet Lecture Prize Call for Nominations
The Philippe Flajolet Lecture Prize for outstanding contributions to analytic combinatorics and analysis of algorithms is awarded every two years by the Analysis of Algorithms (AofA) community that owes its existence to Philippe Flajolet.
(Nominations are now closed, since February 28th, 2017.)
Please see this PDF file
for more information.
delivered the Flajolet lecture at the meeting on
Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of
Algorithms (AofA'16), to be held in Krakow, Poland in July 4-8, 2016.
The Flajolet lecture was established in honor of the late Philippe
the prodigious and much-loved French computer scientist who died in
The first Flajolet lecture was delivered by Don Knuth, Professor
of the Art of Computer Programming at Stanford, at the AofA meeting
in Paris in 2014.
Philippe Jacquet and
Wojciech Szpankowski have just published a new book,
called Analytic Pattern Matching: From DNA to Twitter.
It is available for purchase from
The meetings page gives a listing of upcoming and recent meetings related to the Analysis of Algorithms. Whenever possible, links are provided to the homepages for the meetings.
Site link, speakers, registration, submission deadlines, etc. will be
posted as they become available.
The Books, Journals, and Links page is a starting point for launching into the study of the Analysis of Algorithms. In particular, there are descriptions of several fundamental books related to AofA. The conference proceedings from several meetings are also listed, including citations and links. There is also a list of websites that are relevant to the Analysis of Algorithms.
Any additions, corrections, or other suggestions would be appreciated. Please contact email@example.com
Monday, March 13, 2017