Конспект лекцій до спецкурсу “Ймовірнісний аналіз алгоритмів”.
Література до курсу:
- P. Flajolet, R. Sedgewick (2009). “Analytic Combinatorics“, Cambridge University Press, 810 p.
- G.H. Hardy (1910). “Orders of infinity“, Cambridge Tracts in Mathematics and Mathematical Physics, No. 12.
- R. Neininger (2012). “Probabilistic analysis of algorithms, stochastic fixed-point equations and ideal metrics“, Lecture Notes.
- Neininger, R., Rüschendorf, L. (2004). A general limit theorem for recursive algorithms and combinatorial structures. Ann. Appl. Probab. 14, p. 378–418.
- O. Marynych (2011). “Stochastic Recurrences and Their Applications to the Analysis of Partition-Valued Processes“, Utrecht University.
- Neininger, R., Rüschendorf, L. (2004). On the contaction method with degenerate limit equation. Ann. Probab. 32, p. 2838–2856.
- Rösler, U. (2001). On the analysis of divide and conquer algorithms. Algoritmica 29, p. 238–261.