{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T03:44:35Z","timestamp":1759117475872},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0020-0190(97)00184-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"41-46","source":"Crossref","is-referenced-by-count":17,"title":["On rotations in fringe-balanced binary trees"],"prefix":"10.1016","volume":"65","author":[{"given":"Hosam M.","family":"Mahmoud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00184-1_BIB1_1","first-page":"263","article-title":"An algorithm for the organization of information","volume":"146","author":"Adel'son-Vel'skii","year":"1962","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/S0020-0190(97)00184-1_BIB1_2","first-page":"1259","volume":"3","author":"Adel'son-Vel'skii","year":"1962","journal-title":"Soviet. Math. Dokl."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1017\/S026996480000084X","article-title":"Two applications of urn processes; the fringe analysis of search trees and the simulation of quasi-stationary distributions of Markov chains","volume":"2","author":"Aldous","year":"1988","journal-title":"Probab. Engineering Inform. Sci."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB3","doi-asserted-by":"crossref","first-page":"1801","DOI":"10.1214\/aoms\/1177698013","article-title":"Embedding of urn schemes into continuous time Markov branching process and related limit theorem","volume":"39","author":"Athreya","year":"1968","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB4","series-title":"Branching Processes","author":"Athreya","year":"1972"},{"key":"10.1016\/S0020-0190(97)00184-1_BIB5","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1137\/0606041","article-title":"Asymptotic normality in the generalized P\u00f3lya-Eggenberger urn model, with applications to computer data structures","volume":"6","author":"Bagchi","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0020-0190(97)00184-1_BIB6","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF00263296","article-title":"Improving time and space efficiency in generalized binary search trees","volume":"24","author":"Cunto","year":"1987","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB7","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/rsa.3240020305","article-title":"Limit laws for local counters in random binary search trees","volume":"2","author":"Devroye","year":"1991","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/S0020-0190(97)00184-1_BIB8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(82)90534-4","article-title":"The theory of fringe analysis and its application to 2\u20133 trees and B-trees","volume":"55","author":"Eisenbarth","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0020-0190(97)00184-1_BIB9","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/opre.32.3.527","article-title":"Two probability models of pyramids or chain letter schemes demonstrating that their promotional claims are unreliable","volume":"32","author":"Gastwirth","year":"1984","journal-title":"Oper. Res."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0167-7152(89)90126-0","article-title":"A martingale approach to strong convergence in a generalized P\u00f3lya-Eggenberger urn model","volume":"8","author":"Gouet","year":"1989","journal-title":"Statist. Probab. Lett."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB11","doi-asserted-by":"crossref","first-page":"1624","DOI":"10.1214\/aop\/1176989134","article-title":"Martingale functional central limit theorems for a generalized P\u00f3lya urn","volume":"21","author":"Gouet","year":"1993","journal-title":"Ann. Probab."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB12","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/S0020-0190(97)00184-1_BIB13","series-title":"Evolution of Random Search Trees","author":"Mahmoud","year":"1992"},{"key":"10.1016\/S0020-0190(97)00184-1_BIB14","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1214\/aoap\/1177005874","article-title":"On the distribution of leaves in rooted subtrees of recursive trees","volume":"1","author":"Mahmoud","year":"1991","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/rsa.3240030305","article-title":"Asymptotic joint normality of outdegrees of nodes in random recursive trees","volume":"3","author":"Mahmoud","year":"1992","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/S0020-0190(97)00184-1_BIB16","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(94)00308-6","article-title":"Probabilistic Analysis of bucket recursive trees","volume":"144","author":"Mahmoud","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB17","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/rsa.3240040204","article-title":"On the structure of random plane-oriented recursive trees and their branches","volume":"4","author":"Mahmoud","year":"1993","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/S0020-0190(97)00184-1_BIB18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0202005","article-title":"Binary search trees of bounded balance","volume":"2","author":"Nievergelt","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB19","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0196-6774(85)90003-3","article-title":"The analysis of a fringe heuristic for binary search trees","volume":"6","author":"Poblete","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(97)00184-1_BIB20","series-title":"Analysis of Algorithms","author":"Sedgewick","year":"1996"},{"key":"10.1016\/S0020-0190(97)00184-1_BIB21","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0304-4149(96)00094-4","article-title":"Central limit theorems for urn models","volume":"65","author":"Smythe","year":"1996","journal-title":"Stochastic Processes Appl."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB22","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1093\/comjnl\/19.4.322","article-title":"Locally balanced binary search trees","volume":"19","author":"Walker","year":"1976","journal-title":"Comput. J."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB23","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00289075","article-title":"On random 2\u20133 trees","volume":"9","author":"Yao","year":"1978","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB24","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0020-0190(87)90215-8","article-title":"Some average measures in m-ary search trees","volume":"25","author":"Yates","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00184-1_BIB25","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1109\/69.87964","article-title":"Performance of B+-trees with partial expansions","volume":"1","author":"Yates","year":"1989","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"10.1016\/S0020-0190(97)00184-1_BIB26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0129054195000020","article-title":"Higher order analysis of 2\u20133 trees","volume":"6","author":"Yates","year":"1995","journal-title":"Internat. J. Foundations Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001841?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001841?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:04Z","timestamp":1556058424000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097001841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0020019097001841"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00184-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}