{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:55:14Z","timestamp":1725897314288},"publisher-location":"Wiesbaden","reference-count":8,"publisher":"Vieweg+Teubner Verlag","isbn-type":[{"type":"print","value":"9783815420331"},{"type":"electronic","value":"9783322952332"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-3-322-95233-2_16","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T05:17:04Z","timestamp":1366175824000},"page":"269-282","source":"Crossref","is-referenced-by-count":2,"title":["On the Stack Size of a Class of Backtrack Trees"],"prefix":"10.1007","author":[{"given":"Rainer","family":"Kemp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01933188","volume":"20","author":"R Kemp","year":"1980","unstructured":"Kemp, R.: A note on the stack size of regularly distributed binary trees, BIT\n                20 (1980), 157\u2013163.","journal-title":"BIT"},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02579315","volume":"2","author":"R Kemp","year":"1982","unstructured":"Kemp, R.: On the average oscillation of a stack, COMBINATORICA\n                2(2) (1982), 157\u2013176.","journal-title":"COMBINATORICA"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/BF00289158","volume":"26","author":"R Kemp","year":"1989","unstructured":"Kemp, R.: The expected additive weight of trees, Acta Informatica\n                26 (1989), 711\u2013740.","journal-title":"Acta Informatica"},{"key":"16_CR4","volume-title":"The analysis of a special class of backtrack trees","author":"R Kemp","year":"1991","unstructured":"Kemp, R.: The analysis of a special class of backtrack trees, preprint Johann Wolfgang Goethe-Universit\u00e4t Frankfurt a.M., 1991."},{"key":"16_CR5","volume-title":"The Art of Computer Programming, Vol. 1, 2nd ed","author":"DE Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, Vol. 1, 2nd ed. Addison-Wesley, Reading, Mass. 1973."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"997","DOI":"10.4153\/CJM-1978-085-0","volume":"30","author":"A Meir","year":"1978","unstructured":"Meir, A., Moon, J.W.: On the altitude of nodes in random trees, Can. J, Math\n                . 30 (1978), 997\u20131015.","journal-title":"Can. J, Math."},{"issue":"4","key":"16_CR7","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1137\/0207038","volume":"4","author":"PW Purdom","year":"1978","unstructured":"Purdom, P.W.: Tree size by partial backtracking, SIAM J. Comput. 4(4) (1978), 481\u2013491.","journal-title":"SIAM J. Comput."},{"key":"16_CR8","volume-title":"Additive weights of a special class of nonuniformly distributed backtrack trees","author":"U Trier","year":"1991","unstructured":"Trier, U.: Additive weights of a special class of nonuniformly distributed backtrack trees, preprint Johann Wolfgang Goethe-Universit\u00e4t Frankfurt a.M., 1991."}],"container-title":["TEUBNER-TEXTE zur Informatik","Informatik"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-322-95233-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T10:30:24Z","timestamp":1557657024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-322-95233-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783815420331","9783322952332"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-322-95233-2_16","relation":{},"ISSN":["1615-4584"],"issn-type":[{"type":"print","value":"1615-4584"}],"subject":[],"published":{"date-parts":[[1992]]}}}