{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:23Z","timestamp":1725663383890},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_55","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:32:23Z","timestamp":1330201943000},"page":"327-351","source":"Crossref","is-referenced-by-count":0,"title":["The average size of ordered binary subgraphs"],"prefix":"10.1007","author":[{"given":"Pieter H.","family":"Hartel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"24_CR1","volume-title":"The lambda calculus, its syntax and semantics","author":"H. P. Barendregt","year":"1984","unstructured":"H. P. Barendregt, The lambda calculus, its syntax and semantics, North Holland, Amsterdam (1984)."},{"issue":"4","key":"24_CR2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P. J. Landin","year":"1964","unstructured":"P. J. Landin, \u201cThe mechanical evaluation of expressions,\u201d Computer Journal\n6(4) pp. 308\u2013320 (Jan. 1964).","journal-title":"Computer Journal"},{"key":"24_CR3","volume-title":"Semantics and pragmatics of the lambda calculus","author":"C. P. Wadsworth","year":"1971","unstructured":"C. P. Wadsworth, Semantics and pragmatics of the lambda calculus, Oxford University, U.K. (1971). PhD. Thesis"},{"key":"24_CR4","unstructured":"P. H. Hartel, \u201cA comparative study of garbage collection algorithms,\u201d PRM project internal report D-23, Computing Science Department, University of Amsterdam (Feb. 1988)."},{"issue":"3","key":"24_CR5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/356850.356854","volume":"13","author":"J. Cohen","year":"1981","unstructured":"J. Cohen, \u201cGarbage collection of linked structures\u201d, Computing Surveys\n13(3) pp. 341\u2013367 (Sep. 1981).","journal-title":"Computing Surveys"},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/B978-1-4832-3187-7.50007-6","volume-title":"Graph Theory and Computing","author":"N. G. Bruijn de","year":"1972","unstructured":"N. G. de Bruijn, D. E. Knuth, and S. O. Rice, \u201cThe average height of planted plane trees,\u201d pp. 15\u201322 in Graph Theory and Computing, ed. R.C. Read, Academic Press, London, U.K. (1972)."},{"issue":"3","key":"24_CR7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1002\/spe.4380180305","volume":"18","author":"P. H. Hartel","year":"1988","unstructured":"P. H. Hartel and A. H. Veen, \u201cStatistics on graph reduction of SASL programs,\u201d Software practice and experience\n18(3) pp. 239\u2013253 (Mar. 1988).","journal-title":"Software practice and experience"},{"key":"24_CR8","volume-title":"The art of computer programming, volume 1: Fundamental algorithms","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth, The art of computer programming, volume 1: Fundamental algorithms, Addison Wesley, Reading, Massachusetts (1973). second edition","edition":"second edition"},{"issue":"2","key":"24_CR9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0021-9800(66)80030-3","volume":"1","author":"H. W. Gould","year":"1966","unstructured":"H. W. Gould and J. Kaucky, \u201cEvaluation of a class of binomial coefficient summations,\u201d Journal of Combinatorial theory\n1(2) pp.233\u2013247 (Sep. 1966).","journal-title":"Journal of Combinatorial theory"},{"key":"24_CR10","volume-title":"The art of computer programming, volume 2: Seminumerical algorithms","author":"D. E. Knuth","year":"1980","unstructured":"D. E. Knuth, The art of computer programming, volume 2: Seminumerical algorithms, Addison Wesley, Reading, Massachusetts (1980). second edition","edition":"second edition"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50728-0_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:57:11Z","timestamp":1619571431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}