{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T22:51:37Z","timestamp":1779317497660,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"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":10516,"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":[[1984,10]]},"DOI":"10.1016\/0022-0000(84)90029-1","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"183-197","source":"Crossref","is-referenced-by-count":20,"title":["Time-space tradeoffs for matrix multiplication and the discrete fourier transform on any general sequential random-access computer"],"prefix":"10.1016","volume":"29","author":[{"given":"Yaacov","family":"Yesha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90029-1_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(84)90029-1_BIB2","article-title":"Structured vs. General Models in Computational Complexity","author":"Borodin","year":"1980","journal-title":"University of Toronto, Department of Computer Science Technical Report 143\/80"},{"issue":"2","key":"10.1016\/0022-0000(84)90029-1_BIB3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0211022","article-title":"A time-space tradeoff for sorting on a general sequential model of computation","volume":"11","author":"Borodin","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(84)90029-1_BIB4","series-title":"Proceedings IEEE 20th Annual Found. of Comput. Sci. Conference","first-page":"319","article-title":"A time-space tradeoff for sorting on non-oblibious machines","author":"Borodin","year":"1979"},{"key":"10.1016\/0022-0000(84)90029-1_BIB5","doi-asserted-by":"crossref","unstructured":"A. Cobham, The recognition problem for the set of perfect squares, in \u201cConference Record IEEE 1966 Seventh Annual Symposium on Switching and Automata Theory,\u201d 78\u201387.","DOI":"10.1109\/SWAT.1966.30"},{"key":"10.1016\/0022-0000(84)90029-1_BIB6","series-title":"Proceedings IEEE 22nd Annual Found. of Comput. Sci. Conference","first-page":"53","article-title":"A time-space tradeoff for language recognition","author":"Duris","year":"1981"},{"key":"10.1016\/0022-0000(84)90029-1_BIB7","series-title":"Notes on Scientific Seminars 60","first-page":"38","article-title":"An application of separability and independence notions for proving lower bounds for circuit complexity","author":"Grigoryev","year":"1976"},{"key":"10.1016\/0022-0000(84)90029-1_BIB8","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(84)90029-1_BIB9_1","first-page":"343","article-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1965"},{"key":"10.1016\/0022-0000(84)90029-1_BIB9_2","first-page":"373","article-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1965"},{"key":"10.1016\/0022-0000(84)90029-1_BIB10","series-title":"Proceedings 12th Annual ACM Sympos. Theory Comput.","first-page":"339","article-title":"Time-space tradeoffs for some algebraic problems","author":"Ja'Ja'","year":"1980"},{"key":"10.1016\/0022-0000(84)90029-1_BIB11","series-title":"Proceedings IEEE 23rd Annual Found. of Comput. Sci. Conference","first-page":"45","article-title":"Three applications of Kolmogorov-complexity","author":"Reisch","year":"1982"},{"key":"10.1016\/0022-0000(84)90029-1_BIB12","article-title":"Time-Space Tradeoffs for Straight-Line and Branching Programs","author":"Tompa","year":"1978","journal-title":"University of Toronto, Department of Computer Science Technical Report 122\/78"},{"key":"10.1016\/0022-0000(84)90029-1_BIB13","series-title":"Proceedings 10th Annual Sympos. Theory Comput.","first-page":"196","article-title":"Time-space tradeoffs for computing functions, using connectivity properties of their circuits","author":"Tompa","year":"1978"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900291?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900291?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:51:49Z","timestamp":1550307109000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900291"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["0022000084900291"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90029-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}