{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:45Z","timestamp":1725664185865},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606925"},{"type":"electronic","value":"9783540492634"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60692-0_62","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:53:07Z","timestamp":1330289587000},"page":"377-390","source":"Crossref","is-referenced-by-count":2,"title":["Minimizing space usage in evaluation of expression trees"],"prefix":"10.1007","author":[{"given":"Sandip K.","family":"Biswas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sampath","family":"Kannan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"A. Appel. Compiling with Continuations. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511609619"},{"key":"27_CR2","unstructured":"J.L. Bruno, P.B. Gibbons, and S. Phillips. Testing concurrent data structures. Technical Report BL011211-941201-29TM, AT&T Bell Laboratories, 1994."},{"key":"27_CR3","unstructured":"M. R. Garey and D.S. Johnson. Computers and Intractibility. W.H. Freeman And Company, 1979."},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/moor.4.3.215","volume":"4","author":"C. L. Monma","year":"1979","unstructured":"Clyde L. Monma and Jeffrey B. Sidney. Sequencing with series-parallel precedence constraints. Mathematics of Operations Research, 4:215\u2013224, 1979.","journal-title":"Mathematics of Operations Research"},{"key":"27_CR5","unstructured":"L. C. Paulson. ML for the Working Programmer. Cambridge University Press, 1991."},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/0204020","volume":"4","author":"R. Sethi","year":"1975","unstructured":"Ravi Sethi. Complete register allocation problems. SIAM Journal of Computing, 4:226\u2013248, 1975.","journal-title":"SIAM Journal of Computing"},{"key":"27_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(82)90015-9","volume":"19","author":"R. Sethi","year":"1982","unstructured":"Ravi Sethi. Pebble games for studying storage sharing. Theoretical Computer Science, 19:69\u201384, 1982.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60692-0_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:01:24Z","timestamp":1605646884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60692-0_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606925","9783540492634"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-60692-0_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}