{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T11:22:01Z","timestamp":1774956121132,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"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":11247,"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":[[1982,10]]},"DOI":"10.1016\/0022-0000(82)90005-8","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"214-238","source":"Crossref","is-referenced-by-count":11,"title":["A general class of resource tradeoffs"],"prefix":"10.1016","volume":"25","author":[{"given":"Jon Louis","family":"Bentley","sequence":"first","affiliation":[]},{"given":"Donna J.","family":"Brown","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90005-8_BIB1","first-page":"10","article-title":"An Optimal Data Structure for Minimal-Storage Dynamic Member Searching","author":"Bentley","year":"1978"},{"issue":"4","key":"10.1016\/0022-0000(82)90005-8_BIB2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","article-title":"Decomposable searching problems I: Static-to-dynamic transformations","volume":"1","author":"Bentley","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(82)90005-8_BIB3","unstructured":"J. L. Bentley and J. B. Saxe, Decomposable searching problems II: Adding range variables, in preparation."},{"issue":"3","key":"10.1016\/0022-0000(82)90005-8_BIB4","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","article-title":"An almost optimal algorithm for unbounded searching","volume":"5","author":"Bentley","year":"1976","journal-title":"Inform. Process. Lett."},{"issue":"9","key":"10.1016\/0022-0000(82)90005-8_BIB5","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/360336.360343","article-title":"Efficient generation of the binary reflected gray code and its applications","volume":"19","author":"Bitner","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(82)90005-8_BIB6","series-title":"Proceedings of the Twelfth ACM Symposium on the Theory of Computing","first-page":"294","article-title":"A time-space tradeoff for sorting on a general sequential model of computation","author":"Borodin","year":"1980"},{"key":"10.1016\/0022-0000(82)90005-8_BIB7","series-title":"Proceedings of the Twentieth FOCS Conference","first-page":"319","article-title":"A time-space tradeoff for sorting on non-oblivious machines","author":"Borodin","year":"1979"},{"key":"10.1016\/0022-0000(82)90005-8_BIB8","series-title":"Proceedings of the Fourteenth Conference on Switching and Automata Theory, IEEE","article-title":"Efficient compilation of linear recursive programs","author":"Chandra","year":"1973"},{"issue":"1","key":"10.1016\/0022-0000(82)90005-8_BIB9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1147\/rd.241.0075","article-title":"On the complexity of permuting records in magnetic bubble memory systems","volume":"24","author":"Chung","year":"1980","journal-title":"IBM J. Res. Develop."},{"issue":"8","key":"10.1016\/0022-0000(82)90005-8_BIB10","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1145\/359576.359582","article-title":"Fast parallel sorting algorithms","volume":"21","author":"Hirschberg","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(82)90005-8_BIB11","unstructured":"Jia-Wei Hong, unpublished notes, Carnegie-Mellon Univ., Pittsburgh, October 1980."},{"key":"10.1016\/0022-0000(82)90005-8_BIB12","series-title":"Proceedings of the Twelfth ACM Symposium on the Theory of Computing","first-page":"339","article-title":"Time-space tradeoffs for some algebraic problems","author":"Ja'Ja'","year":"1980"},{"key":"10.1016\/0022-0000(82)90005-8_BIB13","series-title":"Proceedings of the Sixth ICALP Conference","first-page":"304","article-title":"Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons","author":"Janko","year":"1979"},{"key":"10.1016\/0022-0000(82)90005-8_BIB14","author":"Knuth","year":"1968"},{"key":"10.1016\/0022-0000(82)90005-8_BIB15","author":"Knuth","year":"1973"},{"key":"10.1016\/0022-0000(82)90005-8_BIB16","series-title":"Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing","first-page":"262","article-title":"Upper and lower bounds on time-space tradeoffs","author":"Lengauer","year":"1979"},{"key":"10.1016\/0022-0000(82)90005-8_BIB17","article-title":"Lower Bounds on the Efficiency of Static to Dynamic Transforms of Data Structures","author":"Mehlhorn","year":"1980","journal-title":"Universitat des Saarlandes Technical Report A80\/05"},{"key":"10.1016\/0022-0000(82)90005-8_BIB18","article-title":"An Improved Simulation Result for Ink-Bounded Turing Machines","author":"Melville","year":"1978","journal-title":"Cornell Computer Science Technical Report TR78-348, Ithaca, N. Y."},{"key":"10.1016\/0022-0000(82)90005-8_BIB19","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/322077.322091","article-title":"A time-space trade-off","volume":"25","author":"Pippenger","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"issue":"7","key":"10.1016\/0022-0000(82)90005-8_BIB20","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TC.1978.1675167","article-title":"New parallel-sorting schemes","volume":"C-27","author":"Preparata","year":"1978","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0022-0000(82)90005-8_BIB21","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0304-3975(81)90006-2","article-title":"Optimal algorithms for sensitivity analysis in associative multiplication problems","volume":"14","author":"Rosenthal","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(82)90005-8_BIB22","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1109\/TIT.1978.1055938","article-title":"Space-time trade-offs on the FFT algorithm","volume":"24","author":"Savage","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"10.1016\/0022-0000(82)90005-8_BIB23","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/359619.359623","article-title":"Jump searching: A fast sequential search technique","volume":"21","author":"Shneiderman","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(82)90005-8_BIB24","series-title":"Proceedings of the Twentieth FOCS Conference","first-page":"328","article-title":"A TS2 = O(2n) time\/space tradeoff for certain NP-complete problems","author":"Schroeppel","year":"1979"},{"key":"10.1016\/0022-0000(82)90005-8_BIB25","series-title":"Xixth POPL Conference","first-page":"135","article-title":"Space-tme tradeoffs for linear recursion","author":"Swamy","year":"1979"},{"key":"10.1016\/0022-0000(82)90005-8_BIB26","series-title":"term paper for 21\u2013301 (Combinational Analysis)","author":"Sznyter","year":"1980"},{"key":"10.1016\/0022-0000(82)90005-8_BIB27","series-title":"Proceedings of the Eleventh ACM Symposium on the Theory of Computing","first-page":"81","article-title":"Area-time complexity for VLSI","author":"Thompson","year":"1979"},{"issue":"4","key":"10.1016\/0022-0000(82)90005-8_BIB28","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","article-title":"A data structure for manipulating priority queues","volume":"21","author":"Vuillemin","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(82)90005-8_BIB29","unstructured":"A. C. Yao, personal communication, October 1980."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900058?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900058?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:15Z","timestamp":1550325015000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000082900058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["0022000082900058"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90005-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,10]]}}}