{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T08:51:36Z","timestamp":1776761496481,"version":"3.51.2"},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2006,2,18]],"date-time":"2006-02-18T00:00:00Z","timestamp":1140220800000},"content-version":"vor","delay-in-days":5071,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0743-7315(92)90080-7","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"426-430","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Large integer multiplication on hypercubes"],"prefix":"10.1016","volume":"14","author":[{"given":"Barry S.","family":"Fagin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0743-7315(92)90080-7_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/TASSP.1974.1162555","article-title":"Fast convolution using Fermat number transforms with applications to digital filtering","volume":"ASSP-22","author":"Agarwal","year":"1974","journal-title":"IEEE Trans. Acoustics Speech Signal Process"},{"key":"10.1016\/0743-7315(92)90080-7_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TASSP.1974.1162532","article-title":"Fast one-dimensional digital convolution by multidimensional techniques","volume":"ASSP-22","author":"Agarwal","year":"1974","journal-title":"IEEE Trans. Acoustics Speech Signal Process"},{"key":"10.1016\/0743-7315(92)90080-7_BIB3","unstructured":"Fagin, B. Fast addition of large integers, IEEE Transactions on Computers, to appear."},{"key":"10.1016\/0743-7315(92)90080-7_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/78.149987","article-title":"Negacyclic convolution using polynomial transforms on hypercubes","author":"Fagin","year":"1992","journal-title":"IEEE Trans. Signal Process"},{"key":"10.1016\/0743-7315(92)90080-7_BIB5","series-title":"Large integer multiplication using the Fermat number transform","author":"Fagin","year":"1990"},{"issue":"12","key":"10.1016\/0743-7315(92)90080-7_BIB6","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1145\/7902.7903","article-title":"Data parallel algorithms","volume":"29","author":"Hillis","year":"1986","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0743-7315(92)90080-7_BIB7","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0743-7315(86)90027-4","article-title":"FFT algorithms for SIMD parallel processing systems","volume":"3","author":"Jamieson","year":"1986","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0743-7315(92)90080-7_BIB8","article-title":"Computing fast Fourier transforms on Boolean cubes and related networks","author":"Johnsson","year":"1987"},{"issue":"9","key":"10.1016\/0743-7315(92)90080-7_BIB9","doi-asserted-by":"crossref","DOI":"10.1109\/12.29465","article-title":"Optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnsson","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90080-7_BIB10","volume":"Vol. 2","author":"Knuth","year":"1981"},{"issue":"192","key":"10.1016\/0743-7315(92)90080-7_BIB11","first-page":"815","article-title":"Extending Waring's conjecture to 471,600,000","volume":"55","author":"Kubina","year":"1990","journal-title":"Math. Computation"},{"key":"10.1016\/0743-7315(92)90080-7_BIB12","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/TASSP.1976.1162834","article-title":"A simplified binary arithmetic for the Fermat number transform","volume":"ASSP-24","author":"Leibowitz","year":"1976","journal-title":"IEEE Trans. Acoustics Speech Signal Process"},{"key":"10.1016\/0743-7315(92)90080-7_BIB13","doi-asserted-by":"crossref","DOI":"10.1145\/63047.63101","article-title":"The fast Hartley transform on the hypercube multiprocessors","author":"Lin","year":"1988"},{"issue":"2","key":"10.1016\/0743-7315(92)90080-7_BIB14","doi-asserted-by":"crossref","DOI":"10.1109\/TASSP.1980.1163372","article-title":"Fast polynomial transform algorithms for digital convolution","volume":"ASSP-28","author":"Nussbaumer","year":"1980","journal-title":"IEEE Trans. Acoustics Speech Signal Process"},{"key":"10.1016\/0743-7315(92)90080-7_BIB15","series-title":"Proc. 1988 International Conference on Parallel Processing","article-title":"Parallel algorithms for multiplying very large integers","author":"Peng","year":"1988"},{"issue":"1","key":"10.1016\/0743-7315(92)90080-7_BIB16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0743-7315(89)90045-2","article-title":"Data communication in hypercubes","volume":"6","author":"Saad","year":"1989","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0743-7315(92)90080-7_BIB17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","article-title":"Schnelle Multiplikation gro\u00dfer Zahlen","volume":"7","author":"Sch\u00f6nhage","year":"1971","journal-title":"Computing"},{"key":"10.1016\/0743-7315(92)90080-7_BIB18","series-title":"Connection Machine Technical Summary","author":"Thinking Machines Corp.","year":"1989"},{"key":"10.1016\/0743-7315(92)90080-7_BIB19","author":"Thinking Machines Corp.","year":"1988","journal-title":"C\/Paris 5.1 User's Manual"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731592900807?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731592900807?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:08Z","timestamp":1757514608000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731592900807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["0743731592900807"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(92)90080-7","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Large integer multiplication on hypercubes","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(92)90080-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}