{"id":433,"date":"2023-01-14T11:11:26","date_gmt":"2023-01-14T11:11:26","guid":{"rendered":"https:\/\/do.csc.knu.ua\/?page_id=433"},"modified":"2025-12-22T09:41:12","modified_gmt":"2025-12-22T09:41:12","slug":"%d0%bc%d0%b0%d1%80%d0%b8%d0%bd%d0%b8%d1%87-%d0%be-%d0%b2-%d0%b9%d0%bc%d0%be%d0%b2%d1%96%d1%80%d0%bd%d1%96%d1%81%d0%bd%d0%b8%d0%b9-%d0%b0%d0%bd%d0%b0%d0%bb%d1%96%d0%b7-%d0%b0%d0%bb%d0%b3%d0%be%d1%80","status":"publish","type":"page","link":"https:\/\/do.csc.knu.ua\/?page_id=433","title":{"rendered":"\u041c\u0430\u0440\u0438\u043d\u0438\u0447 \u041e.\u0412. \u0419\u043c\u043e\u0432\u0456\u0440\u043d\u0456\u0441\u043d\u0438\u0439 \u0430\u043d\u0430\u043b\u0456\u0437 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u0456\u0432"},"content":{"rendered":"<p><a href=\"https:\/\/do.csc.knu.ua\/marynych\/wp-content\/uploads\/sites\/2\/2023\/11\/PAA-EN.pdf\">\u041a\u043e\u043d\u0441\u043f\u0435\u043a\u0442 \u043b\u0435\u043a\u0446\u0456\u0439<\/a> \u0434\u043e\u00a0 \u0441\u043f\u0435\u0446\u043a\u0443\u0440\u0441\u0443 &#8220;\u0419\u043c\u043e\u0432\u0456\u0440\u043d\u0456\u0441\u043d\u0438\u0439 \u0430\u043d\u0430\u043b\u0456\u0437 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u0456\u0432&#8221;.<\/p>\n<p>\u041b\u0456\u0442\u0435\u0440\u0430\u0442\u0443\u0440\u0430 \u0434\u043e \u043a\u0443\u0440\u0441\u0443:<\/p>\n<ol>\n<li>P. Flajolet, R. Sedgewick (2009). \u201c<a href=\"http:\/\/algo.inria.fr\/flajolet\/Publications\/book.pdf\">Analytic Combinatorics<\/a>\u201c, Cambridge University Press, 810 p.<\/li>\n<li>G.H. Hardy (1910). \u201c<a href=\"https:\/\/do.csc.knu.ua\/wp-content\/uploads\/2023\/01\/38079-pdf.pdf\">Orders of infinity<\/a>\u201c,\u00a0Cambridge Tracts in Mathematics and Mathematical Physics, No. 12.<\/li>\n<li>R. Neininger (2012). \u201c<a href=\"https:\/\/dmg.tuwien.ac.at\/nfn\/neininger\/survey.pdf\">Probabilistic analysis of algorithms, stochastic fixed-point equations and ideal metrics<\/a>\u201c, Lecture Notes.<\/li>\n<li>Neininger, R., R\u00fcschendorf, L. (2004). <a href=\"https:\/\/projecteuclid.org\/journals\/annals-of-applied-probability\/volume-14\/issue-1\/A-general-limit-theorem-for-recursive-algorithms-and-combinatorial-structures\/10.1214\/aoap\/1075828056.full\">A general limit theorem for recursive algorithms and combinatorial structures<\/a>. <em>Ann. Appl. Probab.<\/em> 14, p. 378\u2013418.<\/li>\n<li>O. Marynych (2011). \u201c<a href=\"http:\/\/dspace.library.uu.nl\/handle\/1874\/205441\">Stochastic Recurrences and Their Applications to the Analysis of Partition-Valued Processes<\/a>\u201c, Utrecht University.<\/li>\n<li>Neininger, R., R\u00fcschendorf, L. (2004). <a href=\"https:\/\/projecteuclid.org\/journals\/annals-of-probability\/volume-32\/issue-3B\/On-the-contraction-method-with-degenerate-limit-equation\/10.1214\/009117904000000171.full\">On the contaction method with degenerate limit equation.<\/a> <em>Ann. Probab.<\/em> 32, p. 2838\u20132856.<\/li>\n<li>R\u00f6sler, U. (2001). <a href=\"https:\/\/link.springer.com\/article\/10.1007\/BF02679621\">On the analysis of divide and conquer algorithms<\/a>. <em>Algoritmica<\/em> 29, p. 238\u2013261.<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"<p>\u041a\u043e\u043d\u0441\u043f\u0435\u043a\u0442 \u043b\u0435\u043a\u0446\u0456\u0439 \u0434\u043e\u00a0 \u0441\u043f\u0435\u0446\u043a\u0443\u0440\u0441\u0443 &#8220;\u0419\u043c\u043e\u0432\u0456\u0440\u043d\u0456\u0441\u043d\u0438\u0439 \u0430\u043d\u0430\u043b\u0456\u0437 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u0456\u0432&#8221;. \u041b\u0456\u0442\u0435\u0440\u0430\u0442\u0443\u0440\u0430 \u0434\u043e \u043a\u0443\u0440\u0441\u0443: P. Flajolet, R. Sedgewick (2009). \u201cAnalytic Combinatorics\u201c, Cambridge University Press, 810 p. G.H. Hardy (1910). \u201cOrders of infinity\u201c,\u00a0Cambridge Tracts in Mathematics and Mathematical Physics, No. 12. R. Neininger (2012). \u201cProbabilistic analysis of algorithms, stochastic fixed-point equations and ideal metrics\u201c, Lecture Notes. Neininger, R., R\u00fcschendorf, L&#8230;.<\/p>\n<p class=\"more-link-wrap\"><a href=\"https:\/\/do.csc.knu.ua\/?page_id=433\" class=\"more-link\">Read More<span class=\"screen-reader-text\"> &ldquo;\u041c\u0430\u0440\u0438\u043d\u0438\u0447 \u041e.\u0412. \u0419\u043c\u043e\u0432\u0456\u0440\u043d\u0456\u0441\u043d\u0438\u0439 \u0430\u043d\u0430\u043b\u0456\u0437 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u0456\u0432&rdquo;<\/span> &raquo;<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":267,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"page-templates\/sidebar.php","meta":{"footnotes":""},"class_list":["post-433","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/do.csc.knu.ua\/index.php?rest_route=\/wp\/v2\/pages\/433","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/do.csc.knu.ua\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/do.csc.knu.ua\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/do.csc.knu.ua\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/do.csc.knu.ua\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=433"}],"version-history":[{"count":1,"href":"https:\/\/do.csc.knu.ua\/index.php?rest_route=\/wp\/v2\/pages\/433\/revisions"}],"predecessor-version":[{"id":1755,"href":"https:\/\/do.csc.knu.ua\/index.php?rest_route=\/wp\/v2\/pages\/433\/revisions\/1755"}],"up":[{"embeddable":true,"href":"https:\/\/do.csc.knu.ua\/index.php?rest_route=\/wp\/v2\/pages\/267"}],"wp:attachment":[{"href":"https:\/\/do.csc.knu.ua\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=433"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}