{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:05:35Z","timestamp":1743005135487,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_4","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"43-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simple Random Sampling of\u00a0Binary Forests with\u00a0Fixed Number of\u00a0Nodes and\u00a0Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-8773-6910","authenticated-orcid":false,"given":"Stoyan","family":"Dimitrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/BF02522824","volume":"17","author":"L Alonso","year":"1997","unstructured":"Alonso, L., R\u00e9my, J.L., Schott, R.: A linear-time algorithm for the generation of trees. Algorithmica 17, 162\u2013182 (1997)","journal-title":"Algorithmica"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2017.07.009","volume":"695","author":"A Bacher","year":"2017","unstructured":"Bacher, A., Bodini, O., Jacquot, A.: Efficient random sampling of binary and unary-binary trees via holonomic equations. Theoret. Comput. Sci. 695, 42\u201353 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR3","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2022","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2022)"},{"key":"4_CR4","unstructured":"Foata, D., Zeilberger, D.: A classic proof of a recurrence for a very classical sequence. arXiv preprint math\/9805015 (1998)"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/359423.359434","volume":"20","author":"GD Knott","year":"1977","unstructured":"Knott, G.D.: A numbering system for binary trees. Commun. ACM 20(2), 113\u2013115 (1977)","journal-title":"Commun. ACM"},{"key":"4_CR6","unstructured":"Knuth, D.E.: Art of Computer Programming, Volume 4, Fascicle 4, The: Generating All Trees\u2013History of Combinatorial Generation. Addison-Wesley Professional (2013)"},{"key":"4_CR7","unstructured":"Tri Lai, Bijection between Catalan objects. https:\/\/www.math.unl.edu\/~tlai3\/Catalan%20Objects.pdf"},{"key":"4_CR8","first-page":"191","volume":"46","author":"PJ Larcombe","year":"2003","unstructured":"Larcombe, P.J., French, D.R.: The Catalan number kappa-fold self-convolution identity: the original formulation. J. Comb. Math. Comb. Comput. 46, 191\u2013204 (2003)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"4_CR9","unstructured":"Lescanne, P.: Holonomic equations and efficient random generation of binary trees (2022)"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1051\/ita\/1985190201791","volume":"19","author":"JL R\u00e9my","year":"1985","unstructured":"R\u00e9my, J.L.: Un proc\u00e9d\u00e9 it\u00e9ratif de d\u00e9nombrement d\u2019arbres binaires et son application \u00e0 leur g\u00e9n\u00e9ration al\u00e9atoire. RAIRO. Informatique th\u00e9orique 19(2), 179\u2013195 (1985)","journal-title":"RAIRO. Informatique th\u00e9orique"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/0020-0190(75)90002-2","volume":"4","author":"D Rotem","year":"1975","unstructured":"Rotem, D.: On a correspondence between binary trees and a certain type of permutation. Inf. Process. Lett. 4(3), 58\u201361 (1975)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/128749.128753","volume":"39","author":"R Sprugnoli","year":"1992","unstructured":"Sprugnoli, R.: The generation of binary trees as a numerical problem. J. ACM (JACM) 39(2), 317\u2013327 (1992)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/322169.322171","volume":"27","author":"M Solomon","year":"1980","unstructured":"Solomon, M., Finkel, R.A.: A note on enumerating binary trees. J. ACM (JACM) 27(1), 3\u20135 (1980)","journal-title":"J. ACM (JACM)"},{"key":"4_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139871495","volume-title":"Catalan Numbers","author":"RP Stanley","year":"2015","unstructured":"Stanley, R.P.: Catalan Numbers. Cambridge University Press, Cambridge (2015)"},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","volume":"10","author":"S Zaks","year":"1980","unstructured":"Zaks, S.: Lexicographic generation of ordered trees. Theoret. Comput. Sci. 10(1), 63\u201382 (1980)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1145\/3828.214141","volume":"32","author":"D Zerling","year":"1985","unstructured":"Zerling, D.: Generating binary trees using rotations. J. ACM (JACM) 32(3), 694\u2013701 (1985)","journal-title":"J. ACM (JACM)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:51Z","timestamp":1718974971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}