{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T01:11:17Z","timestamp":1768439477437,"version":"3.49.0"},"reference-count":9,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4666,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1994,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A random recursive forest is defined as a union of random recursive trees. We find the expected number of trees in the uniform random recursive forest as well as the number of vertices of given degree, the maximum degree, the height of vertices, the order of branches, the root of the component containing a given vertex, and the last root of such forests. \u00a9 1994 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/rsa.3240050103","type":"journal-article","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T15:54:42Z","timestamp":1180626882000},"page":"3-12","source":"Crossref","is-referenced-by-count":11,"title":["Random recursive forests"],"prefix":"10.1002","volume":"5","author":[{"given":"Krystyna T.","family":"Bali\u0144ska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis V.","family":"Quintas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy","family":"Szyma\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02915448"},{"key":"e_1_2_1_3_2","first-page":"3","volume":"8","author":"Gontcharov V. L.","year":"1944","journal-title":"Izv. AN USSR Ser. Math."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1978-085-0"},{"key":"e_1_2_1_5_2","first-page":"125","volume-title":"Proc. of the British Combinatorial Conf. 1978","author":"Moon J. W.","year":"1978"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(70)90071-4"},{"key":"e_1_2_1_7_2","unstructured":"V. N.Sachkov Probabilistic methods in combinatorial analysis Izd. Nauka Moskva(1978). [in Russian]"},{"key":"e_1_2_1_8_2","first-page":"297","article-title":"On a nonuniform random recursive tree","volume":"33","author":"Szyma\u0144ski J.","year":"1987","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_9_2","first-page":"313","volume-title":"Random Graphs '87","author":"Szyma\u0144ski J.","year":"1990"},{"key":"e_1_2_1_10_2","unstructured":"J.Szyma\u0144ski Branches in recursive trees(to appear)."}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240050103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240050103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T22:30:01Z","timestamp":1697409001000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240050103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["10.1002\/rsa.3240050103"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240050103","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}