ANALCO is a forum for original research in algorithm analysis, specifically techniques and methods to analyze the resource requirements of algorithms. This includes, but is not limited to, average-case analysis of algorithms, probabilistic analysis of randomized algorithms, analytic information theory, space -efficient data structures, and amortized analyses. We also consider combinatorial topics to be within the scope of this event, such as the analytic and enumerative combinatorics of structures that arise incomputational applications (eg. permutations, trees, strings, tries, words , mappings, hash tables and graphs).

Submissions that present significant new information about classic algorithms are welcome, as are analyses of new algorithms that present unique analytic challenges.

The scientific program will include invited talks, contributed research papers, and ample time for discussion and debate of topics in this area.

ANALCO is co-located with the ACM-SIAM Symposium on Discrete Algorithms (SODA19), Algorithm Engineering and Experiments (ALENEX), and Symposium on Simplicity in Algorithms. Since researchers in all fields are approaching the problem of learning detailed information about the performance of particular algorithms, we expect that interesting synergies will develop.

ANALCO is supported by SIAM (Society for Industrial and Applied Mathematics).