International Conference on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms

Resumen General

Analysis of Algorithms (AofA) is a field at the boundary of computer science and mathematics. The goal is to obtain accurate estimates of the performance of algorithms. We invite you to submit an extended abstract of up to 12-15 pages, excluding the the front page, bibliography, and a brief appendix of up to 5 pages. Simultaneous submission to other conferences with published proceedings or to journals is not allowed. PC members are allowed to submit their works as well, except for PC chairs. Leibniz International Proceedings in Informatics (LIPIcs).

Clasificación de la Fuente

Mapa