{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:53Z","timestamp":1725663713585},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544586"},{"type":"electronic","value":"9783540383918"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54458-5_63","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:51:53Z","timestamp":1330210313000},"page":"190-199","source":"Crossref","is-referenced-by-count":0,"title":["Unifying binary-search trees and permutations"],"prefix":"10.1007","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[]},{"given":"Imrich","family":"Vr\u0165o","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"20_CR1","volume-title":"Probability and Measure","author":"P. Billingsley","year":"1979","unstructured":"P. Billingsley, \u201dProbability and Measure,\u201d J. Willey and Sons, New York, 1979."},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/moor.9.1.43","volume":"9","author":"G.G. Brown","year":"1984","unstructured":"G.G. Brown and B.O. Shubert, On random binary trees, Math. Op. Res. 9 (1984) 43\u201365.","journal-title":"Math. Op. Res."},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/0743-7315(91)90040-G","volume":"11","author":"B.S. Chlebus","year":"1991","unstructured":"B.S. Chlebus and I. Vr\u0165o, Parallel quicksort, J. Parallel and Distributed Computing 11 (1991) 332\u2013337.","journal-title":"J. Parallel and Distributed Computing"},{"key":"20_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"T.H. Cormen, C.E. Leiserson and R.L. Rivest, \u201dIntroduction to Algorithms\u201d, The MIT Press, Cambridge, Massachusetts, 1990."},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/5925.5930","volume":"33","author":"L. Devroye","year":"1986","unstructured":"L. Devroye, A note on the height of binary search trees, J. Assoc. Comput. Mach. 33 (1986) 489\u2013498.","journal-title":"J. Assoc. Comput. Mach."},{"key":"20_CR6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF00265991","volume":"24","author":"L. Devroye","year":"1987","unstructured":"L. Devroye, Branching processes in the analysis of the heights of trees, Acta Informatica 24 (1987) 277\u2013298.","journal-title":"Acta Informatica"},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0097-3165(90)90056-3","volume":"53","author":"P. Flajolet","year":"1990","unstructured":"P. Flajolet and M. Soria, Gaussian limiting distributions for the number of components in combinatorial structures, J. Combin. Theory Ser. A 53 (1990) 165\u2013182.","journal-title":"J. Combin. Theory Ser. A"},{"key":"20_CR8","first-page":"35","volume":"10","author":"J. Francon","year":"1976","unstructured":"J. Francon, Arbres binaires de reserche: proprietes combinatoires et applications, RAIRO Theoretical Informatics and Applications 10 (1976) 35\u201350.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(77)90034-2","volume":"4","author":"J. Francon","year":"1977","unstructured":"J. Francon, On the analysis of algorithms for trees, Theoret. Comput. Sci. 4 (1977) 155\u2013169.","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR10","volume-title":"The Art of Computer Programming, 1: Fundamental Algorithms","author":"D.E. Knuth","year":"1968","unstructured":"D.E. Knuth, \u201dThe Art of Computer Programming, 1: Fundamental Algorithms,\u201d Addison-Wesley, Reading, MA, 1968."},{"key":"20_CR11","volume-title":"The Art of Computer Programming, 3: Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth, \u201dThe Art of Computer Programming, 3: Sorting and Searching,\u201d Addison-Wesley, Reading, MA, 1973."},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1051\/ita\/1987210404791","volume":"21","author":"G. Louchard","year":"1987","unstructured":"G. Louchard, Exact and asymptotic distributions in digital and binary search trees, RAIRO Theoretical Informatics and Applications 21 (1987) 479\u2013496.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1093\/comjnl\/7.4.299","volume":"7","author":"W.C. Lynch","year":"1965","unstructured":"W.C. Lynch, More combinatorial properties of certain trees, Computer J. 7 (1965) 299\u2013302.","journal-title":"Computer J."},{"key":"20_CR14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1137\/0605010","volume":"5","author":"H. Mahmud","year":"1984","unstructured":"H. Mahmud and B. Pittel, On the most probable shape of a binary search tree grown from a random permutation, SIAM J. Algebraic Discrete Meth. 5 (1984) 69\u201381.","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"20_CR15","first-page":"151","volume":"11","author":"J. M. Robson","year":"1979","unstructured":"J. M. Robson, The height of random binary search trees, Australian Comput. J. 11 (1979) 151\u2013153.","journal-title":"Australian Comput. J."},{"key":"20_CR16","unstructured":"J. M. Robson, The asymptotic behaviour of the height of binary search trees, Aust. Comput. Sci. Commun. (1982) p.88."},{"key":"20_CR17","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"J. Vuillemin, A unifying look at data structures, Communications of the ACM 23 (1980) 229\u2013239.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54458-5_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:22:10Z","timestamp":1619572930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54458-5_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544586","9783540383918"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-54458-5_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}