{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T19:30:35Z","timestamp":1672342235781},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1982,7,1]],"date-time":"1982-07-01T00:00:00Z","timestamp":394329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1982,7]]},"DOI":"10.1016\/0020-0190(82)90020-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"223-227","source":"Crossref","is-referenced-by-count":7,"title":["Extreme time-space tradeoffs for graphs with small space requirements"],"prefix":"10.1016","volume":"14","author":[{"given":"David A.","family":"Carlson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John E.","family":"Savage","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(82)90020-5_BIB1","series-title":"Tech. Rept. CS-63 (Ph.D. thesis)","article-title":"Time-space and size-space tradeoffs for oblivious computations","author":"Carlson","year":"1980"},{"key":"10.1016\/0020-0190(82)90020-5_BIB2","first-page":"16","article-title":"Efficient compilation of linear recursive programs","author":"Chandra","year":"1973","journal-title":"Proc. 14th SWAT"},{"key":"10.1016\/0020-0190(82)90020-5_BIB3","series-title":"Rept. RUU-CS-78-4","article-title":"Move rules and tradeoffs in the pebble game","author":"van Emde Boas","year":"1978"},{"key":"10.1016\/0020-0190(82)90020-5_BIB4","first-page":"35","article-title":"An application of separability and independence notions for proving lower bounds of circuit complexity","volume":"60","author":"Grigoryev","year":"1976","journal-title":"Steklov Math. Inst."},{"issue":"2","key":"10.1016\/0020-0190(82)90020-5_BIB5","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1145\/322003.322015","article-title":"On time versus space","volume":"24","author":"Hopcroft","year":"1977","journal-title":"JACM"},{"key":"10.1016\/0020-0190(82)90020-5_BIB6","series-title":"Ph.D. Thesis","article-title":"Upper and lower bounds for time-space tradeoffs in a pebble game","author":"Lengauer","year":"1979"},{"key":"10.1016\/0020-0190(82)90020-5_BIB7","first-page":"262","article-title":"Upper and lower bounds on time-space tradeoffs","author":"Lengauer","year":"1979","journal-title":"Proc. 11th STOC"},{"key":"10.1016\/0020-0190(82)90020-5_BIB8","series-title":"Automata, Languages and Programming","first-page":"300","article-title":"A PSPACE-complete problem related to a pebble game","volume":"62","author":"Lingas","year":"1978"},{"key":"10.1016\/0020-0190(82)90020-5_BIB9","first-page":"119","article-title":"Comparative schematology","author":"Paterson","year":"1970","journal-title":"Proc. MAC Conf. on Concurrent Systems and Parallel Computation"},{"key":"10.1016\/0020-0190(82)90020-5_BIB10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF00289150","article-title":"Time-space tradeoffs in a pebble game","volume":"10","author":"Paul","year":"1978","journal-title":"Acta Informatica"},{"key":"10.1016\/0020-0190(82)90020-5_BIB11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01683275","article-title":"Space bounds for a game on graphs","volume":"10","author":"Paul","year":"1977","journal-title":"Math. Systems Theory"},{"issue":"4","key":"10.1016\/0020-0190(82)90020-5_BIB12","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1145\/322217.322233","article-title":"Improved bounds on the problem of time-space tradeoffs in the pebble game","volume":"27","author":"Reischuk","year":"1980","journal-title":"JACM"},{"key":"10.1016\/0020-0190(82)90020-5_BIB13","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1109\/TIT.1978.1055938","article-title":"Space-time tradeoffs on the FFT algorithm","volume":"IT-24","author":"Savage","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0020-0190(82)90020-5_BIB14","first-page":"135","article-title":"Space-time tradeoffs for linear recursion","author":"Swamy","year":"1979","journal-title":"Proc. 6th POPL"},{"issue":"2","key":"10.1016\/0020-0190(82)90020-5_BIB15","first-page":"118","article-title":"Time-space tradeoffs for computing functions, using connectivity properties of their circuits","volume":"20","author":"Tompa","year":"1980","journal-title":"JCSS"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900205?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900205?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:54:17Z","timestamp":1555073657000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019082900205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,7]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1982,7]]}},"alternative-id":["0020019082900205"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(82)90020-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1982,7]]}}}