{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:02Z","timestamp":1725664682896},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616801"},{"type":"electronic","value":"9783540706670"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61680-2_57","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:10:51Z","timestamp":1330276251000},"page":"208-220","source":"Crossref","is-referenced-by-count":7,"title":["On the depth of randomly generated circuits"],"prefix":"10.1007","author":[{"given":"Tatsuie","family":"Tsukiji","sequence":"first","affiliation":[]},{"given":"Fatos","family":"Xhafa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Balc\u00e1zar, J.L., D\u00edaz, J. and Gabarr\u00f3, J.: Structural Complexity I. Springer Verlag (1995)","DOI":"10.1007\/978-3-642-79235-9"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Codenotti, B., Gemmell, P., and Simon, J.: Average Circuit Depth and Average Communication Complexity. In Third European Symposium on Algorithms, Lecture Notes in Comp. Sc. Springer-Verlag (1995) 102\u2013112","DOI":"10.1007\/3-540-60313-1_137"},{"key":"16_CR3","unstructured":"D\u00edaz, J., Serna, M.J., Spirakis, P., Tor\u00e1n, J. and Tsukiji, T.: On the expected depth of Boolean circuits. Technical Report LSI-94-7-R Univ. Polit\u00e8c. de Catalunya Dept. LSI (1994)"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1214\/aop\/1176996266","volume":"3","author":"J. Kingman","year":"1975","unstructured":"Kingman, J.: The first birth problem for an edge-dependent branching process. Ann. Prob.\n3 (1975) 790\u2013801","journal-title":"Ann. Prob."},{"key":"16_CR5","unstructured":"Lindvall, T.: Lectures on the Coupling Method. Wiley Interscience Pub., (1992)"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1017\/S0269964800001881","volume":"5","author":"H. Mahmoud","year":"1991","unstructured":"Mahmoud, H.: Limiting distributions for path lengths in recursive trees. Prob. in the Eng. and Inf. Sc.\n5 (1991) 53\u201359","journal-title":"Prob. in the Eng. and Inf. Sc."},{"issue":"3","key":"16_CR7","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1214\/aoap\/1177005874","volume":"1","author":"H.M. Mahmoud","year":"1991","unstructured":"Mahmoud, H.M. and Smythe, R.T.: On the Distribution of Leaves in Rooted Subtrees of Recursive Trees. The Ann. of Appl. Prob.\n1 (3) (1991) 406\u2013418","journal-title":"The Ann. of Appl. Prob."},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/rsa.3240050207","volume":"5","author":"B. Pittel","year":"1994","unstructured":"Pittel, B.: Note on the Heights of Random Recuresive Trees and Random m-ary Search Trees. Random Struct. and Alg.\n5 (1994) 337\u2013347","journal-title":"Random Struct. and Alg."},{"key":"16_CR9","first-page":"1","volume":"51","author":"R.T. Smythe","year":"1994","unstructured":"Smythe, R.T. and Mahmoud, H.M.: A Survey of Recursive Trees. Teorya Imovirnosty ta Mat. Stat. (in Ukrainian)\n51 (1994) 1\u201329","journal-title":"Teorya Imovirnosty ta Mat. Stat. (in Ukrainian)"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1214\/aoms\/1177700153","volume":"36","author":"V. Strassen","year":"1965","unstructured":"Strassen, V.: The existence of probability measures with given marginals. Ann. Math. Stat.\n36 (1965) 423\u2013439","journal-title":"Ann. Math. Stat."},{"key":"16_CR11","volume-title":"On the maximum degree and height of a random recursive tree","author":"J. Szymanski","year":"1990","unstructured":"Szymanski, J.: On the maximum degree and height of a random recursive tree. Wiley New York (1990)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61680-2_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:35:23Z","timestamp":1619559323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61680-2_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616801","9783540706670"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61680-2_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}