Call for Papers

Important Dates

Submission server: EasyChair

PDF version


Analysis of algorithms is a scientific basis for computation, providing a link between abstract algorithms and the performance characteristics of their implementations in the real world. The general effort to precisely predict the performance of algorithms has come to involve research in analytic combinatorics, the analysis of random discrete structures, asymptotic analysis, exact and limiting distributions, and other fields of inquiry in computer science, probability theory, and enumerative combinatorics. See

We invite papers in

We also welcome papers addressing problems such as: combinatorial algorithms, string searching and pattern matching, sublinear algorithms on massive data sets, network algorithms, graph algorithms, caching and memory hierarchies, indexing, data mining, data compression, coding and information theory, and computational finance. Papers are also welcome that address bridges to research in related fields such as statistical physics, computational biology, computational geometry, and simulation.


We invite you to submit an extended abstract of up to 12 pages, excluding references. Appendices can be included in addition to that. They will be read at the Program Committee’s discretion, but will not be included in the conference proceedings.

Authors are encouraged to use the LIPIcs style for also initial submissions. If you are using Overleaf, there is a template to clone here.

The submissions server is open:

Program Committee

See committees page.