{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:27:21Z","timestamp":1752985641302,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"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":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538551","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"449-452","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Brief Announcement: On the I\/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms"],"prefix":"10.1145","author":[{"given":"Lorenzo","family":"De Stefani","sequence":"first","affiliation":[{"name":"Brown University, Providence, RI, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310558"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1080"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1969-0249212-8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3367"},{"key":"e_1_3_2_1_5_1","volume-title":"On the I\/O complexity of hybrid algorithms for Integer Multiplication. https:\/\/arxiv.org\/abs\/1912.08045","author":"Stefani Lorenzo De","year":"2019","unstructured":"Lorenzo De Stefani . 2019. On the I\/O complexity of hybrid algorithms for Integer Multiplication. https:\/\/arxiv.org\/abs\/1912.08045 ( 2019 ). arXiv:1912.08045 [cs.CC] Lorenzo De Stefani. 2019. On the I\/O complexity of hybrid algorithms for Integer Multiplication. https:\/\/arxiv.org\/abs\/1912.08045 (2019). arXiv:1912.08045 [cs.CC]"},{"key":"e_1_3_2_1_6_1","volume-title":"30th International Symposium on Algorithms and Computation (ISAAC 2019","volume":"149","author":"Stefani Lorenzo De","year":"2019","unstructured":"Lorenzo De Stefani . 2019 . The I\/O Complexity of Hybrid Algorithms for Square Matrix Multiplication . In 30th International Symposium on Algorithms and Computation (ISAAC 2019 ), Vol. 149 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 33:1--33:16. https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC. 2019.33 10.4230\/LIPIcs.ISAAC.2019.33 Lorenzo De Stefani. 2019. The I\/O Complexity of Hybrid Algorithms for Square Matrix Multiplication. In 30th International Symposium on Algorithms and Computation (ISAAC 2019), Vol. 149. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 33:1--33:16. https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2019.33"},{"key":"e_1_3_2_1_7_1","volume-title":"Communication-Optimal Parallel Standard and Karatsuba Integer Multiplication in the Distributed Memory Model. https:\/\/arxiv.org\/abs\/2009.14590","author":"Stefani Lorenzo De","year":"2020","unstructured":"Lorenzo De Stefani . 2020. Communication-Optimal Parallel Standard and Karatsuba Integer Multiplication in the Distributed Memory Model. https:\/\/arxiv.org\/abs\/2009.14590 ( 2020 ). arXiv:2009.14590 [cs.DC] Lorenzo De Stefani. 2020. Communication-Optimal Parallel Standard and Karatsuba Integer Multiplication in the Distributed Memory Model. https:\/\/arxiv.org\/abs\/2009.14590 (2020). arXiv:2009.14590 [cs.DC]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/070711761"},{"key":"e_1_3_2_1_9_1","volume-title":"Darmstadt","author":"Garcia L","year":"2005","unstructured":"L Garcia . 2005. Can Sch\u00f6nhage multiplication speed up the RSA encryption or decryption? University of Technology , Darmstadt ( 2005 ). L Garcia. 2005. Can Sch\u00f6nhage multiplication speed up the RSA encryption or decryption? University of Technology, Darmstadt (2005)."},{"key":"e_1_3_2_1_10_1","volume-title":"Faster integer multiplication using short lattice vectors. The Open Book Series 2, 1","author":"Harvey David","year":"2019","unstructured":"David Harvey and Joris van der Hoeven . 2019. Faster integer multiplication using short lattice vectors. The Open Book Series 2, 1 ( 2019 ), 293--310. David Harvey and Joris van der Hoeven. 2019. Faster integer multiplication using short lattice vectors. The Open Book Series 2, 1 (2019), 293--310."},{"key":"e_1_3_2_1_11_1","volume-title":"Integer multiplication in time O(n log n). Annals of Mathematics","author":"Harvey David","year":"2021","unstructured":"David Harvey and Joris van der Hoeven . 2021. Integer multiplication in time O(n log n). Annals of Mathematics ( 2021 ). David Harvey and Joris van der Hoeven. 2021. Integer multiplication in time O(n log n). Annals of Mathematics (2021)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2016.03.001"},{"volume-title":"Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing","author":"Jia-Wei Hong","key":"e_1_3_2_1_13_1","unstructured":"Hong Jia-Wei and H. T. Kung . 1981. I\/O Complexity: The Red-Blue Pebble Game . In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing ( Milwaukee, Wisconsin, USA) (STOC '81). Association for Computing Machinery, New York, NY, USA, 326--333. https:\/\/doi.org\/10.1145\/800076.802486 10.1145\/800076.802486 Hong Jia-Wei and H. T. Kung. 1981. I\/O Complexity: The Red-Blue Pebble Game. In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing (Milwaukee, Wisconsin, USA) (STOC '81). Association for Computing Machinery, New York, NY, USA, 326--333. https:\/\/doi.org\/10.1145\/800076.802486"},{"key":"e_1_3_2_1_14_1","first-page":"85","article-title":"Multiplication of many-digital numbers by automatic computers","volume":"145","author":"Karatsuba Anatolii","year":"1962","unstructured":"Anatolii Karatsuba and Yuri Ofman . 1962 . Multiplication of many-digital numbers by automatic computers . In Doklady Akad. Nauk SSSR , Vol. 145. 85 . Anatolii Karatsuba and Yuri Ofman. 1962. Multiplication of many-digital numbers by automatic computers. In Doklady Akad. Nauk SSSR, Vol. 145. 85.","journal-title":"Doklady Akad. Nauk SSSR"},{"key":"e_1_3_2_1_15_1","unstructured":"C. A. Patterson M. Snir and S. L. Graham. 2005. Getting Up to Speed:: The Future of Supercomputing. National Academies Press.  C. A. Patterson M. Snir and S. L. Graham. 2005. Getting Up to Speed:: The Future of Supercomputing. National Academies Press."},{"key":"e_1_3_2_1_16_1","volume-title":"Models of Computation: Exploring the Power of Computing","author":"Savage J. E.","unstructured":"J. E. Savage . 1997. Models of Computation: Exploring the Power of Computing ( 1 st ed.). Addison-Wesley Longman Publishing Co., Inc. , Boston, MA, USA . J. E. Savage. 1997. Models of Computation: Exploring the Power of Computing (1st ed.). Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA.","edition":"1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242355"},{"key":"e_1_3_2_1_18_1","first-page":"714","article-title":"The complexity of a scheme of functional elements realizing the multiplication of integers","volume":"3","author":"Toom Andrei L","year":"1963","unstructured":"Andrei L Toom . 1963 . The complexity of a scheme of functional elements realizing the multiplication of integers . In Soviet Mathematics Doklady , Vol. 3. 714 -- 716 . Andrei L Toom. 1963. The complexity of a scheme of functional elements realizing the multiplication of integers. In Soviet Mathematics Doklady, Vol. 3. 714--716.","journal-title":"Soviet Mathematics Doklady"},{"volume-title":"Distributed Computing Systems, 1988., 8th International Conference on. IEEE, 366--373","author":"Yang C.","key":"e_1_3_2_1_19_1","unstructured":"C. Yang and B. P. Miller . 1988. Critical path analysis for the execution of parallel and distributed programs . In Distributed Computing Systems, 1988., 8th International Conference on. IEEE, 366--373 . C. Yang and B. P. Miller. 1988. Critical path analysis for the execution of parallel and distributed programs. In Distributed Computing Systems, 1988., 8th International Conference on. IEEE, 366--373."}],"event":{"name":"SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538551","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538551","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:08Z","timestamp":1750191128000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538551"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":19,"alternative-id":["10.1145\/3490148.3538551","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538551","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}