{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:49Z","timestamp":1750307269687,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"3\/4","license":[{"start":{"date-parts":[[2011,1,28]],"date-time":"2011-01-28T00:00:00Z","timestamp":1296172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2011,1,28]]},"abstract":"<jats:p>Today's parallel hardware architectures and computer memory hierarchies enforce revisiting fundamental algorithms which were often designed with algebraic complexity as the main complexity measure and with sequential running time as the main performance counter. This study is devoted to two algorithms for univariate polynomial multiplication algorithms that are are independent of the coefficient ring: the plain and the Toom-Cook univariate multiplications. We analyze their cache complexity and report on their parallel implementations in Cilk++.<\/jats:p>","DOI":"10.1145\/1940475.1940484","type":"journal-article","created":{"date-parts":[[2011,2,8]],"date-time":"2011-02-08T13:21:01Z","timestamp":1297171261000},"page":"99-100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity and performance results for non FFT-based univariate polynomial multiplication"],"prefix":"10.1145","volume":"44","author":[{"given":"Muhammad F.I.","family":"Chowdhury","sequence":"first","affiliation":[{"name":"University of Western Ontario, London, Ontario, Canada"}]},{"given":"Marc Moreno","family":"Maza","sequence":"additional","affiliation":[{"name":"University of Western Ontario, London, Ontario, Canada"}]},{"given":"Wei","family":"Pan","sequence":"additional","affiliation":[{"name":"University of Western Ontario, London, Ontario, Canada"}]},{"given":"\u00c9ric","family":"Schost","sequence":"additional","affiliation":[{"name":"University of Western Ontario, London, Ontario, Canada"}]}],"member":"320","published-online":{"date-parts":[[2011,1,28]]},"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1940475.1940484","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1940475.1940484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:55Z","timestamp":1750243975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1940475.1940484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,28]]},"references-count":0,"journal-issue":{"issue":"3\/4","published-print":{"date-parts":[[2011,1,28]]}},"alternative-id":["10.1145\/1940475.1940484"],"URL":"https:\/\/doi.org\/10.1145\/1940475.1940484","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2011,1,28]]},"assertion":[{"value":"2011-01-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}