{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:55:10Z","timestamp":1649213710486},"reference-count":11,"publisher":"EDP Sciences","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1993]]},"DOI":"10.1051\/ita\/1993270605411","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T14:55:55Z","timestamp":1486047355000},"page":"541-554","source":"Crossref","is-referenced-by-count":1,"title":["On the average number of registers needed to evaluate a special class of backtrack trees"],"prefix":"10.1051","volume":"27","author":[{"given":"U.","family":"Trier","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. FLAJOLET Ph., RAOULT J.-C. and VUILLEMIN J., The Number of Registers Required to Evaluate Arithmetic Expressions, Theoret. Comp. Sci. 1979, 9, pp. 99-125.5351270407.68057","DOI":"10.1016\/0304-3975(79)90009-4"},{"key":"R2","unstructured":"2. GRAHAM R. L., KNUTH D. E. and PATASHNIK O., ConcreteMathematics, Addison-Wesley, Reading, Mass. 1988.0668.00003"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. KEMP R., The Average Number of Registers Needed to Evaluate a Binary Tree Optimally, Acta Inf., 1979, 11, pp. 363-372.5334820395.68059","DOI":"10.1007\/BF00289094"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. KEMP R., The Expected Additive Weight of Trees, Acta Inf., 1989, 26, pp. 7-740.10217870685.68023","DOI":"10.1007\/BF00289158"},{"key":"R5","unstructured":"5. KEMP R., The Analysis of a Special Class of Backtrack Trees, preprint Johann Wolfgang Goethe-Universit\u00e4t Frankfurt, 1991."},{"key":"R6","unstructured":"6. KEMP R., On the Stacksize of a Class of Backtrack Trees, preprint Johann Wolfgang Goethe-Universit\u00e4t Frankfurt, 1991."},{"key":"R7","unstructured":"7. KNUTH D. E., The Art of Computer Programming, Vol. 1, (2nd \u00e9d.), Addison-Wesley, Reading, Mass., 1973.0302.68010378456"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. MEIR A. and MOON J. W., On the Altitude of Nodes in Random Trees, Can. J. Math., 1978, 30 pp. 997-1015.5062560394.05015","DOI":"10.4153\/CJM-1978-085-0"},{"key":"R9","unstructured":"9. PRODINGER H., D\u00e9termination de certains param\u00e8tres d'arbres binaires \u00e0 l'aide de m\u00e9thodes analytiques, Laboratoire de Recherche en Informatique, Universit\u00e9 Paris 11, 91405 Orsay cedex-France, Rapport de Recherche N\u00b0 177, 1984."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. PURDOM P. W., Tree Size by Partial Backtracking, SIAM J. Comput., 1978, 7 (4) pp. 481-491.5086080386.68044","DOI":"10.1137\/0207038"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. TRIER U., Additive Weights of a Special Class of Nonuniformly Distributed Backtrack Trees, Inform. Proc. Letters, 1992, 42, pp. 67-76.11708710780.68068","DOI":"10.1016\/0020-0190(92)90092-A"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270605411\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:55:33Z","timestamp":1568786133000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270605411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":11,"journal-issue":{"issue":"6"},"alternative-id":["ita1993270605411"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1993270605411","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}