{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T14:22:34Z","timestamp":1762957354507,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T00:00:00Z","timestamp":1703030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T00:00:00Z","timestamp":1703030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R &D Program of China","doi-asserted-by":"crossref","award":["2022ZD0116406"],"award-info":[{"award-number":["2022ZD0116406"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s00607-023-01242-1","type":"journal-article","created":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T03:02:22Z","timestamp":1703041342000},"page":"741-758","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the average time complexity of computation with random partition"],"prefix":"10.1007","volume":"106","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6928-6885","authenticated-orcid":false,"given":"Mingxue","family":"Liao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pin","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,20]]},"reference":[{"key":"1242_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2021.11.018","volume":"900","author":"M Chakraborty","year":"2022","unstructured":"Chakraborty M, Mehera R, Pal RK (2022) Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph. Theor Comput Sci 900:35\u201352","journal-title":"Theor Comput Sci"},{"key":"1242_CR2","doi-asserted-by":"publisher","first-page":"102743","DOI":"10.1016\/j.scico.2021.102743","volume":"215","author":"H Rubing","year":"2022","unstructured":"Rubing H, Weifeng S, Haibo C, Chenhui C, Ning Y (2022) A nearest-neighbor divide-and-conquer approach for adaptive random testing. Sci Comput Program 215:102743","journal-title":"Sci Comput Program"},{"key":"1242_CR3","doi-asserted-by":"publisher","first-page":"103195","DOI":"10.1016\/j.mtcomm.2022.103195","volume":"30","author":"Y Feng","year":"2022","unstructured":"Feng Y, Kai S, Liang G, Wei X (2022) DCLF: a divide-and-conquer learning framework for the predictions of steel hardness using multiple alloy datasets. Mater Today Commun 30:103195","journal-title":"Mater Today Commun"},{"key":"1242_CR4","doi-asserted-by":"publisher","first-page":"106166","DOI":"10.1016\/j.ipl.2021.106166","volume":"173","author":"Shubham","year":"2022","unstructured":"Shubham, Prakash S, Ganapathi P (2022) An algorithm for the sequence alignment with gap penalty problem using multiway divide-and-conquer and matrix transposition. Inf Process Lett 173:106166","journal-title":"Inf Process Lett"},{"key":"1242_CR5","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s00607-022-01132-y","volume":"105","author":"Z Ying","year":"2023","unstructured":"Ying Z, Chenze H, Qingbiao Z (2023) HaSGP: an effective graph partition method for heterogeneous-aware. Computing 105:455\u2013481","journal-title":"Computing"},{"key":"1242_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0097-3165(83)90007-9","volume":"35","author":"HS Wilf","year":"1983","unstructured":"Wilf HS (1983) Three problems in combinatorial asymptotics. J Combin Theory Ser A 35:199\u2013207","journal-title":"J Combin Theory Ser A"},{"issue":"2","key":"1242_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/(SICI)1098-2418(199903)14:2<185::AID-RSA4>3.0.CO;2-F","volume":"35","author":"S Corteel","year":"1999","unstructured":"Corteel S, Pittel B, Savage CD, Wilf HS (1999) On the multiplicity of parts in a random partition. Random Struct Algorithms 35(2):185\u2013197","journal-title":"Random Struct Algorithms"},{"issue":"4","key":"1242_CR8","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1002\/rsa.20191","volume":"32","author":"WMY Goh","year":"2008","unstructured":"Goh WMY, Hitczenko P (2008) Random partitions with restricted part sizes. Random Struct Algorithms 32(4):440\u2013462","journal-title":"Random Struct Algorithms"},{"key":"1242_CR9","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s10955-021-02756-8","volume":"183","author":"I Fatkullin","year":"2021","unstructured":"Fatkullin I, Xue J (2021) Limit shapes for Gibbs partitions of sets. J Stat Phys 183:22","journal-title":"J Stat Phys"},{"key":"1242_CR10","doi-asserted-by":"publisher","first-page":"405","DOI":"10.14232\/actasm-020-126-7","volume":"86","author":"G Cz\u00e9dli","year":"2020","unstructured":"Cz\u00e9dli G, Oluoch L (2020) Four-element generating sets of partition lattices and their direct products. Acta Sci Math 86:405\u2013448","journal-title":"Acta Sci Math"},{"key":"1242_CR11","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s00026-021-00543-6","volume":"25","author":"AJ Dalal","year":"2021","unstructured":"Dalal AJ, Lohss A, Parry D (2021) Statistical structure of concave compositions. Ann Comb 25:729\u2013756","journal-title":"Ann Comb"},{"key":"1242_CR12","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-94-010-2196-8","volume-title":"Advanced combinatorics: the art of finite and infinite expansions","author":"L Comtet","year":"1974","unstructured":"Comtet L (1974) Advanced combinatorics: the art of finite and infinite expansions. Springer, Dordrecht, pp 15\u201316"},{"key":"1242_CR13","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.disc.2005.11.013","volume":"306","author":"D Branson","year":"2006","unstructured":"Branson D (2006) Stirling number representations. Discrete Math 306:478\u2013494","journal-title":"Discrete Math"},{"key":"1242_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0096-3003(03)00328-X","volume":"151","author":"MEA El-Mikkawy","year":"2004","unstructured":"El-Mikkawy MEA (2004) A note on the Stirling matrix of the second kind. Appl Math Comput 151:147\u2013151","journal-title":"Appl Math Comput"},{"key":"1242_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0024-3795(01)00234-8","volume":"329","author":"G-S Cheon","year":"2001","unstructured":"Cheon G-S, Kim J-S (2001) Stirling matrix via pascal matrix. Linear Algebra Appl 329:49\u201359","journal-title":"Linear Algebra Appl"},{"key":"1242_CR16","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1016\/j.camwa.2004.03.005","volume":"48","author":"AH Manob","year":"2004","unstructured":"Manob AH, Islam TM, Parvez MT, Kaykobad M (2004) Search trees and Stirling numbers. Comput Math Appl 48:747\u2013754","journal-title":"Comput Math Appl"},{"key":"1242_CR17","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/s10959-020-01050-9","volume":"35","author":"JA Adell","year":"2022","unstructured":"Adell JA (2022) Probabilistic Stirling numbers of the second kind and applications. J Theor Probab 35:636\u2013652","journal-title":"J Theor Probab"},{"key":"1242_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00009-018-1130-z","volume":"15","author":"H Belbachir","year":"2018","unstructured":"Belbachir H, Boutiche MA, Medjerredine A (2018) Enumerating some stable partitions involving Stirling and r-Stirling numbers of the second kind. Mediterr J Math 15:87","journal-title":"Mediterr J Math"},{"key":"1242_CR19","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00454-021-00326-z","volume":"68","author":"T Godland","year":"2021","unstructured":"Godland T, Kabluchko Z (2021) Angle sums of schl\u00e4fli orthoschemes. Discrete Comput Geom 68:125\u2013164","journal-title":"Discrete Comput Geom"},{"key":"1242_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00009-022-02026-1","volume":"19","author":"L Karg\u0131n","year":"2022","unstructured":"Karg\u0131n L, \u00c7ay E (2022) Semiorthogonality of geometric polynomials. Mediterr J Math 19:129","journal-title":"Mediterr J Math"},{"unstructured":"ESRI Shapefile Technical Description (1998) Environmental Systems Research Institute, Inc. https:\/\/www.esri.com\/content\/dam\/esrisites\/sitecore-archive\/Files\/Pdfs\/library\/whitepapers\/pdfs\/shapefile.pdf","key":"1242_CR21"},{"issue":"1","key":"1242_CR22","first-page":"245","volume":"28","author":"MX Liao","year":"2008","unstructured":"Liao MX, Fan ZH, Xin HX (2008) Quick algorithm for reconstructing line object adjacency. Comput Appl 28(1):245\u2013247 (in Chinese)","journal-title":"Comput Appl"},{"unstructured":"He J, Liao MX, Hu XH, He XX (2010) Multi-level spatial hashing approach for conflict detection in air traffic management. In: The proceeding of the 2010 IRAST international congress on computer applications and computational science, pp 794\u2013798","key":"1242_CR23"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01242-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-023-01242-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01242-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T11:32:44Z","timestamp":1730892764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-023-01242-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,20]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1242"],"URL":"https:\/\/doi.org\/10.1007\/s00607-023-01242-1","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2023,12,20]]},"assertion":[{"value":"21 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of data and materials"}},{"value":"Not applicable.","order":7,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}