{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T16:24:46Z","timestamp":1776356686192,"version":"3.51.2"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11247,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1982,10]]},"DOI":"10.1016\/0022-0000(82)90004-6","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"171-213","source":"Crossref","is-referenced-by-count":161,"title":["The average height of binary trees and other simple trees"],"prefix":"10.1016","volume":"25","author":[{"given":"Philippe","family":"Flajolet","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Odlyzko","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90004-6_BIB1","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/1016082","article-title":"Asymptotic methods in enumeration","volume":"16","author":"Bender","year":"1974","journal-title":"SIAM Rev."},{"key":"10.1016\/0022-0000(82)90004-6_BIB2","series-title":"Asymptotic Methods in Analysis","author":"de Bruijn","year":"1961"},{"key":"10.1016\/0022-0000(82)90004-6_BIB3","series-title":"Graph Theory and Computing","first-page":"15","article-title":"The average height of planted plane trees","author":"de Bruijn","year":"1972"},{"key":"10.1016\/0022-0000(82)90004-6_BIB4","unstructured":"P. Flajolet, \u201cOn the Performance Evaluation of Extendible Hashing and Tree Searching,\u201d to be published."},{"key":"10.1016\/0022-0000(82)90004-6_BIB5","series-title":"Proceedings of 21st IEEE Found. Computer Sci. Symposium","first-page":"207","article-title":"Exploring binary trees and other simple trees","author":"Flajolet","year":"1980"},{"key":"10.1016\/0022-0000(82)90004-6_BIB6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(79)90009-4","article-title":"The number of registers required to evaluate arithmetic expressions","volume":"9","author":"Flajolet","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(82)90004-6_BIB7","series-title":"Proceedings, 7th ICALP Conf.","article-title":"On the analysis of tree matching algorithms","author":"Flajolet","year":"1980"},{"key":"10.1016\/0022-0000(82)90004-6_BIB8","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00289094","article-title":"The average number of registers needed to evaluate a binary tree optimally","volume":"11","author":"Kemp","year":"1979","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(82)90004-6_BIB9","article-title":"The Average Height of a Derivation Tree Generated by a Linear Grammar in a Special Chomsky Normal Form","author":"Kemp","year":"1978","journal-title":"Saarbrucken University Report A 78\/01"},{"key":"10.1016\/0022-0000(82)90004-6_BIB10","series-title":"Proceedings, 6th ICALP Conf.","article-title":"On the stack size of regularly distributed binary trees","author":"Kemp","year":"1979"},{"key":"10.1016\/0022-0000(82)90004-6_BIB11","series-title":"The Art of Computer Programming: Fundamental Algorithms","author":"Knuth","year":"1968"},{"key":"10.1016\/0022-0000(82)90004-6_BIB12","series-title":"The Art of Computer Programming: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0022-0000(82)90004-6_BIB13","doi-asserted-by":"crossref","first-page":"997","DOI":"10.4153\/CJM-1978-085-0","article-title":"On the altitude of nodes in random trees","volume":"30","author":"Meir","year":"1978","journal-title":"Canad. J. Math"},{"key":"10.1016\/0022-0000(82)90004-6_BIB14","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0601005","article-title":"On the order of random channel networks","volume":"1","author":"Meir","year":"1980","journal-title":"SIAM J. Algebraic Discrete Math."},{"key":"10.1016\/0022-0000(82)90004-6_BIB15","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/0001-8708(82)90005-6","article-title":"Periodic oscillations of coefficients of power series that satisfy functional equations","volume":"44","author":"Odlyzko","year":"1982","journal-title":"Adv. in Math."},{"key":"10.1016\/0022-0000(82)90004-6_BIB16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02546665","article-title":"Kombinatorische Anzahlbestimmungen f\u00fcr Graphen, Gruppen, und Chemische Verbindungen","volume":"68","author":"Polya","year":"1937","journal-title":"Acta Math."},{"key":"10.1016\/0022-0000(82)90004-6_BIB17","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1017\/S1446788700004432","article-title":"On the height of trees","volume":"7","author":"Renyi","year":"1967","journal-title":"Austral. J. Math."},{"key":"10.1016\/0022-0000(82)90004-6_BIB18","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1147\/rd.45.0473","article-title":"The enumeration of trees by height and diameter","volume":"4","author":"Riordan","year":"1960","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/0022-0000(82)90004-6_BIB19","first-page":"151","article-title":"The height of binary search trees","volume":"11","author":"Robson","year":"1979","journal-title":"Austral. Comput. J."},{"key":"10.1016\/0022-0000(82)90004-6_BIB20","unstructured":"J. M. Ronson, \u201cThe Asymptotic Behaviour of the Height of Binary Search Trees,\u201d to be published."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900046?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900046?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:50:16Z","timestamp":1550325016000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000082900046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["0022000082900046"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90004-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,10]]}}}