{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T18:12:30Z","timestamp":1697825550525},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,2,1]],"date-time":"1983-02-01T00:00:00Z","timestamp":412905600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11124,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1983,2]]},"DOI":"10.1016\/0022-0000(83)90021-1","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"65-81","source":"Crossref","is-referenced-by-count":1,"title":["Size-Space Tradeoffs for Oblivious Computations"],"prefix":"10.1016","volume":"26","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\/0022-0000(83)90021-1_BIB1","series-title":"Report CS-63","article-title":"Time-Space and Size-Space Tradeoffs for Oblivious Computations","author":"Carlson","year":"1980"},{"key":"10.1016\/0022-0000(83)90021-1_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/368892.368907","article-title":"On programming arithmetic operations","volume":"1","author":"Ershov","year":"1958","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(83)90021-1_BIB3","series-title":"Proc. 20th Ann. Symp. on Foundations of Comp. Sci.","first-page":"364","article-title":"Explicit construction of linear sized concentrators and superconcentrators","author":"Gabber","year":"1979"},{"key":"10.1016\/0022-0000(83)90021-1_BIB4","series-title":"Information Theory and Reliable Communication","author":"Gallager","year":"1966"},{"key":"10.1016\/0022-0000(83)90021-1_BIB5","series-title":"The Art of Computer Programming-Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/0022-0000(83)90021-1_BIB6","series-title":"Proc. 15th Ann. Symp. Switching and Aut. Theory","first-page":"140","article-title":"Combinational complexity of some monotone functions","author":"Lamagna","year":"1974"},{"key":"10.1016\/0022-0000(83)90021-1_BIB7","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1145\/363534.363549","article-title":"On compiling algorithms for arithmetic expressions","volume":"10","author":"Nakata","year":"1967","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(83)90021-1_BIB8","series-title":"Proc. Proj. MAC Conf. on Concurrent Systems and Parallel Computation","first-page":"119","article-title":"Comparative schematology","author":"Paterson","year":"1970"},{"key":"10.1016\/0022-0000(83)90021-1_BIB9","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/321958.321962","article-title":"Shifting graphs and their applications","volume":"23","author":"Pippenger","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90021-1_BIB10","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0206022","article-title":"Superconcentrators","volume":"6","author":"Pippenger","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90021-1_BIB11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/362848.362859","article-title":"On arithmetic expressions and trees","volume":"12","author":"Redziejowski","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(83)90021-1_BIB12","series-title":"The Complexity of Computing","author":"Savage","year":"1976"},{"key":"10.1016\/0022-0000(83)90021-1_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\/0022-0000(83)90021-1_BIB14","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0022-0000(80)90056-2","article-title":"Time-space tradeoffs for computing functions, using connectivity properties of their circuits","volume":"20","author":"Tompa","year":"1980","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0022-0000(83)90021-1_BIB15","unstructured":"L. G. Valiant, \u201cOn Non-Linear Lower Bounds in Computational Complexity,\u201d University of Leeds, England."},{"key":"10.1016\/0022-0000(83)90021-1_BIB16","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/S0022-0000(76)80041-4","article-title":"Graph-theoretic properties in computational complexity","volume":"13","author":"Valiant","year":"1976","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900211?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900211?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:50:36Z","timestamp":1550325036000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,2]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,2]]}},"alternative-id":["0022000083900211"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90021-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,2]]}}}