{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:56Z","timestamp":1740109316365,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T00:00:00Z","timestamp":1627344000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T00:00:00Z","timestamp":1627344000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00453-021-00859-y","type":"journal-article","created":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T07:02:56Z","timestamp":1627369376000},"page":"3363-3378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Class of Random Recursive Tree Algorithms with Deletion"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8376-3211","authenticated-orcid":false,"suffix":"Jr.","given":"Arnold T.","family":"Saunders","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,27]]},"reference":[{"key":"859_CR1","doi-asserted-by":"publisher","first-page":"8607","DOI":"10.1088\/1751-8113\/40\/30\/001","volume":"40","author":"E Ben-Naim","year":"2007","unstructured":"Ben-Naim, E., Krapivsky P.L.: Addition-deletion networks. The Journal of Physics A: Mathematical and Theoretical 40, 8607\u20138619 (2007)","journal-title":"J. Phys. A: Math. Theor."},{"key":"859_CR2","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.ipl.2006.12.009","volume":"102","author":"N Deo","year":"2007","unstructured":"Deo, N., Cami, A.: Preferential deletion in dynamic models of web-like networks. Information Processing Letters 102, 156\u2013162 (2007)","journal-title":"Inform. Process. Lett."},{"key":"859_CR3","first-page":"205","volume":"30","author":"M Dondajewski","year":"1982","unstructured":"Dondajewski, M., Szymanski, J.: On the distribution of vertex-degress in a strata of a random recursive tree. Bulletin de l\u2019Acad\u00e9mie Polonaise des Sciences: S\u00e9rie des Sciences Math\u00e9matiques 30, 205\u2013209 (1982)","journal-title":"Bulletin de l\u2019Acad\u00e9mie Polonaise des Sciences: S\u00e9rie des Sciences Math\u00e9matiques"},{"key":"859_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)"},{"key":"859_CR5","doi-asserted-by":"publisher","first-page":"2920","DOI":"10.1038\/srep02920","volume":"3","author":"G Ghosal","year":"2013","unstructured":"Ghosal, G., Chi, L., Barab\u00e1si, A.L.: Uncovering the role of elementary processes in networking evolution. Scientific Reports 3, 2920 (2013)","journal-title":"Sci. Rep."},{"key":"859_CR6","doi-asserted-by":"publisher","DOI":"10.1201\/9781315368306","volume-title":"Algorithms of Nonuniformity: Tools and Paradigms","author":"M Hofri","year":"2018","unstructured":"Hofri, M., Mahmoud, H.: Algorithms of Nonuniformity: Tools and Paradigms. CRC Press, Boca Raton (2018)"},{"key":"859_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/rsa.20046","volume":"26","author":"S Janson","year":"2005","unstructured":"Janson, S.: Asymptotic degree distribution in random recursive trees. Random Structures and Algorithms 26, 69\u201383 (2005)","journal-title":"Random Struct. Algorith."},{"key":"859_CR8","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0022-0000(78)90020-X","volume":"16","author":"AR Jonassen","year":"1978","unstructured":"Jonassen, A.R., Knuth, D.E.: A trivial algorithm whose analysis isn\u2019t. Journal of Computer and System Sciences 16, 301\u2013322 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"859_CR9","doi-asserted-by":"publisher","first-page":"675","DOI":"10.2307\/3213526","volume":"19","author":"D Najock","year":"1982","unstructured":"Najock, D., Heyde, C.C.: On the number of terminal vertices in certain random trees with an application to stemma construction in philology. Journal of Applied Probability 19, 675\u2013680 (1982)","journal-title":"J. Appl. Prob."},{"key":"859_CR10","doi-asserted-by":"publisher","first-page":"2335","DOI":"10.1016\/j.jspi.2010.01.028","volume":"140","author":"W Panny","year":"2010","unstructured":"Panny, W.: Deletions in random binary search trees: a story of errors. Journal of Statistical Planning and Inference 140, 2335\u20132345 (2010)","journal-title":"J. Stat. Plan. Inference"},{"key":"859_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/rsa.3240050207","volume":"5","author":"B Pittel","year":"1994","unstructured":"Pittel, B.: Note on the height of random recursive trees and m-ary search trees. Random Structures and Algorithms 5, 337\u2013347 (1994)","journal-title":"Random Struct. Algorith."},{"key":"859_CR12","unstructured":"Prodinger, H.: The kernel method: a collection of examples. S\u00e9minarie Lotharingien de Combinatoire 50, Article B50f (2003)"},{"key":"859_CR13","first-page":"1","volume":"51","author":"RT Smythe","year":"1995","unstructured":"Smythe R.T., Mahmoud, H.M.: A survey of recursive trees. Theory of probability and mathematical statistics 51, 1\u201327 (1995)","journal-title":"Theory Prob. Math. Stat."},{"key":"859_CR14","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1007\/s10955-016-1447-6","volume":"162","author":"X Zhang","year":"2016","unstructured":"Zhang, X., He, Z., Rayman-Bacchus, L.: Random birth-and-death networks. Journal of Statistical Physics 162, 842\u2013854 (2016)","journal-title":"J. Stat. Phys."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00859-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00859-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00859-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T12:03:15Z","timestamp":1635336195000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00859-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,27]]},"references-count":14,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["859"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00859-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2021,7,27]]},"assertion":[{"value":"15 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}