{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:22:19Z","timestamp":1778293339830,"version":"3.51.4"},"reference-count":16,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[1983,6,1]],"date-time":"1983-06-01T00:00:00Z","timestamp":423273600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1983,6]]},"DOI":"10.1109\/tc.1983.1676281","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T20:35:10Z","timestamp":1188938110000},"page":"585-589","source":"Crossref","is-referenced-by-count":3,"title":["Time-Space Tradeoffs on Back-to-Back FFT Algorithms"],"prefix":"10.1109","volume":"C-32","author":[{"family":"Carlson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055938"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223205"},{"key":"ref12","author":"tompa","year":"1978","journal-title":"Time-space tradeoffs for straight-line and branching programs"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90056-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/800116.803752"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/3-540-08353-7_135","volume":"53","author":"valiant","year":"1977","journal-title":"Lecture Notes in Computer Science Math Foundations of Computer Science"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"ref4","author":"feller","year":"1966","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"ref3","author":"carlson","year":"1980","journal-title":"Time-space and size-space tradeoffs for oblivious computations"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1968.tb00063.x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01693976"},{"key":"ref8","first-page":"119","article-title":"comparative schematology","author":"paterson","year":"1970","journal-title":"Proc MAC Conf Concurr Syst Parallel Computat"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1974.9"},{"key":"ref2","author":"benes","year":"1965","journal-title":"Mathematical Theory of Connecting Networks and Telephone Traffic"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321962"},{"key":"ref1","first-page":"113","article-title":"the analysis and synthesis of signal switching networks","author":"beizer","year":"1962","journal-title":"Proc Symp Mathematical Theory of Automata"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35228\/01676281.pdf?arnumber=1676281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:40:06Z","timestamp":1638218406000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1676281\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":16,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tc.1983.1676281","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}