Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms

Analysis of algorithms (AofA) 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 predict precisely 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. This topical collection in La Matematica includes full versions of the abstracts from the AofA 2022 international conference, as well as other significant contributions to research in AofA subject areas.