{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:56Z","timestamp":1759335956794},"reference-count":23,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1137\/s0097539701383923","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T15:12:06Z","timestamp":1055344326000},"page":"152-171","source":"Crossref","is-referenced-by-count":19,"title":["Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees"],"prefix":"10.1137","volume":"32","author":[{"given":"Luc","family":"Devroye","sequence":"first","affiliation":[]}],"member":"351","reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005936"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0047-259X(81)90128-7"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177693494"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BF00536204"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5930"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/BF00265991"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02915448"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020305"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199601)8:1<1::AID-RSA1>3.0.CO;2-1"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199710)11:3<223::AID-RSA2>3.0.CO;2-2"},{"key":"R15","volume-title":"Martingale limit theory and its application","author":"Hall P.","year":"1980"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-48-01568-3"},{"key":"R18","first-page":"134","volume":"20","author":"Ibragimov I.","year":"1975","journal-title":"Teor. Verojatnost. i Primenen."},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718"},{"key":"R20","volume-title":"The art of computer programming. Volume 3","author":"Knuth Donald","year":"1973"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90009-9"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.4.299"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1137\/0605010"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/29.1.36"},{"key":"R25","volume-title":"Evolution of random search trees","author":"Mahmoud Hosam","year":"1992"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996608"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(84)90141-0"},{"key":"R29","first-page":"151","volume":"11","author":"Robson J.","year":"1979","journal-title":"Austral. Comput. J."}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539701383923","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T16:46:13Z","timestamp":1485708373000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/S0097539701383923"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["10.1137\/S0097539701383923"],"URL":"https:\/\/doi.org\/10.1137\/s0097539701383923","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}