{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:18:51Z","timestamp":1648610331296},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1974,10,1]],"date-time":"1974-10-01T00:00:00Z","timestamp":149817600000},"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":14169,"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":[[1974,10]]},"DOI":"10.1016\/s0022-0000(74)80007-3","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T04:46:40Z","timestamp":1289364400000},"page":"196-212","source":"Crossref","is-referenced-by-count":10,"title":["Minimum times and memories needed to compute the values of a function"],"prefix":"10.1016","volume":"9","author":[{"given":"Peter","family":"Elias","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80007-3_bib1","article-title":"Complexity of acceptors for prefix codes","author":"Brown","year":"1974"},{"key":"10.1016\/S0022-0000(74)80007-3_bib2","series-title":"Proceedings of the Sixth Annual Princeton Conference on Information Sciences and Systems","first-page":"54","article-title":"On binary representations of monotone sequences","author":"Elias","year":"1972"},{"key":"10.1016\/S0022-0000(74)80007-3_bib3","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/321812.321820","article-title":"Efficient storage and retrieval by content and address for static files","volume":"21","author":"Elias","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80007-3_bib4","author":"Gallager","year":"1968"},{"key":"10.1016\/S0022-0000(74)80007-3_bib5","article-title":"A device for quantizing, grouping and coding amplitude modulated pulses","author":"Kraft","year":"1949"},{"key":"10.1016\/S0022-0000(74)80007-3_bib6","first-page":"215","article-title":"Perceptrons","author":"Minsky","year":"1969"},{"key":"10.1016\/S0022-0000(74)80007-3_bib7_1","article-title":"Bounds on information retrieval efficiency in static file structures","author":"Welch","year":"1971"},{"key":"10.1016\/S0022-0000(74)80007-3_bib7_2","article-title":"Bounds on information retrieval efficiency in static file structures","author":"Welch","year":"1971"},{"key":"10.1016\/S0022-0000(74)80007-3_bib8","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/S0019-9958(72)90365-8","article-title":"An upper bound on the entropy series","volume":"20","author":"Wyner","year":"1972","journal-title":"Information and Control"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800073?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800073?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T18:52:09Z","timestamp":1544122329000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,10]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1974,10]]}},"alternative-id":["S0022000074800073"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80007-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,10]]}}}