{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:35Z","timestamp":1725662915267},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540095101"},{"type":"electronic","value":"9783540351689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/3-540-09510-1_40","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:43:11Z","timestamp":1330188191000},"page":"498-504","source":"Crossref","is-referenced-by-count":11,"title":["Space-time tradeoffs for oblivious integer multiplication"],"prefix":"10.1007","author":[{"given":"John E.","family":"Savage","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sowmitri","family":"Swamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"40_CR1","unstructured":"Paterson, M. S. and C. E. Hewitt, \"Comparative Schematology,\" Proj. MAC Conf. on Concurrent Systems and Parallel Computation, Woods Hole, Massachusetts, pp. 119\u2013127, June 2\u20135, 1970."},{"issue":"2","key":"40_CR2","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1145\/322003.322015","volume":"24","author":"J. E. Hopcroft","year":"1977","unstructured":"Hopcroft, J. E., W. J. Paul, and L. G. Valiant, \"On Time Versus Space,\" JACM, Vol. 24, No. 2, pp. 332\u2013337, 1977.","journal-title":"JACM"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Paul, W. J., R. E. Tarjan, and J. R. Celoni, \"Space Bounds for a Game on Graphs,\" Eighth Ann. Symp. on Theory of Computing, Hershey, Pennsylvania, pp. 149\u2013160, May 3\u20135, 1976.","DOI":"10.1145\/800113.803643"},{"issue":"4","key":"40_CR4","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1145\/321724.321731","volume":"19","author":"J. E. Savage","year":"1972","unstructured":"Savage, J. E., \"Computational Work and Time on Finite Machines,\" JACM, Vol. 19, No. 4, pp. 660\u2013674, 1972.","journal-title":"JACM"},{"issue":"5","key":"40_CR5","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1109\/TIT.1978.1055938","volume":"IT-24","author":"J. E. Savage","year":"1978","unstructured":"Savage, J. E. and S. Swamy, \"Space-Time Tradeoffs on the FFT Algorithm,\" IEEE Transactions on Information Theory, Vol. IT-24, No. 5, pp. 563\u2013568, Sept. 1978.","journal-title":"IEEE Transactions on Information Theory"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Tompa, M., \"Time-Space Tradeoffs for Computing Functions Using Connectivity Properties of their Circuits,\" Proceedings of the Tenth Annual ACM Symp. on Theory of Computing, pp. 196\u2013204, May 1\u20133, 1978.","DOI":"10.1145\/800133.804348"},{"key":"40_CR7","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/S0022-0000(76)80041-4","volume":"13","author":"L. G. Valiant","year":"1976","unstructured":"Valiant, L. G., \"Graph-Theoretic Properties in Computational Complexity,\" Journal of Computer and System Sciences, Vol. 13, pp. 278\u2013285, 1976.","journal-title":"Journal of Computer and System Sciences"},{"key":"40_CR8","unstructured":"Pippenger, N., \"A Time-Space Tradeoff,\" IBM preprint, May 1977, to appear in JACM."},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Swamy, S. and J. E. Savage, \"Space-Time Tradeoffs for Linear Recursion,\" Brown University, Computer Science Technical Report No. CS-36, June 1978.","DOI":"10.1145\/567752.567765"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Chandra, A. K., \"Efficient Compilation of Linear Recursive Programs,\" IBM Research Report RC4517, 10 pp., August 29, 1973, 14th SWAT Conference.","DOI":"10.1109\/SWAT.1973.7"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Paul, W. J. and R. E. Tarjan, \"Time-Space Tradeoffs in a Pebble Game,\" Stanford University Technical Report STAN-CS-77-619, July 1977, Fourth Colloq. on Auto. Langs. and Progr., Turku, Finland.","DOI":"10.1007\/3-540-08342-1_28"},{"key":"40_CR12","volume-title":"Notes of Scientific Seminars","author":"D. Yu. Grigoryev","year":"1976","unstructured":"Grigoryev, D. Yu., \"An Application of Separability and Independence Notions for Proving Lower Bounds on Circuit Complexity,\" Notes of Scientific Seminars, Steklov Math. Inst., Leningrad, Vol. 60, 1976."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-09510-1_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:57:46Z","timestamp":1640912266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-09510-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540095101","9783540351689"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-09510-1_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1979]]}}}