{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T14:05:01Z","timestamp":1764079501188,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T00:00:00Z","timestamp":1562544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1319994,1618269"],"award-info":[{"award-number":["1319994,1618269"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Conseil R\u00e9gional Languedoc-Roussillon"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,8]]},"DOI":"10.1145\/3326229.3326249","type":"proceedings-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T12:53:20Z","timestamp":1562676800000},"page":"187-194","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Generic Reductions for In-place Polynomial Multiplication"],"prefix":"10.1145","author":[{"given":"Pascal","family":"Giorgi","sequence":"first","affiliation":[{"name":"LIRMM, Univ. Montpellier, CNRS, Montpellier, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Grenet","sequence":"additional","affiliation":[{"name":"LIRMM, Univ. Montpellier, CNRS, Montpellier, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel S.","family":"Roche","sequence":"additional","affiliation":[{"name":"United States Naval Academy, Annapolis, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.58"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1540612"},{"key":"e_1_3_2_1_3_1","unstructured":"Alin Bostan Fr\u00e9d\u00e9ric Chyzak Marc Giusti Romain Lebreton Gr\u00e9goire Lecerf Bruno Salvy and \u00c9ric Schost. 2017. Algorithmes Efficaces en Calcul Formel 1 ed.)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860870"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1576702.1576713"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1963394"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178683"},{"key":"e_1_3_2_1_8_1","unstructured":"Yiping Cheng. 2016. Space-Efficient Karatsuba Multiplication for Multi-Precision Integers. http:\/\/arxiv.org\/abs\/1605.06760."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","unstructured":"J. von zur Gathen and J. Gerhard. 2013. Modern Computer Algebra 3rd ed.). Cambridge University Press.","DOI":"10.5555\/2512973"},{"key":"e_1_3_2_1_11_1","volume-title":"Communication and Computing","volume":"14","author":"Hanrot Guillaume","year":"2004","unstructured":"Guillaume Hanrot, Michel Quercia, and Paul Zimmermann. 2004. The Middle Product Algorithm I . Applicable Algebra in Engineering, Communication and Computing, Vol. 14, 6 (01 Mar 2004), 415--438."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2003.03.001"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3005344"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837934.1837996"},{"key":"e_1_3_2_1_15_1","volume-title":"Polynomial multiplication over finite fields in time O(n log n). (March","author":"Harvey David","year":"2019","unstructured":"David Harvey and Joris Van Der Hoeven. 2019. Polynomial multiplication over finite fields in time O(n log n). (March 2019). https:\/\/hal.archives-ouvertes.fr\/hal-02070816 preprint."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2000.0370"},{"key":"e_1_3_2_1_17_1","first-page":"595","article-title":"Multiplication of Multidigit Numbers on Automata","volume":"7","author":"Karatsuba Anatolii","year":"1963","unstructured":"Anatolii Karatsuba and Yuri Ofman. 1963. Multiplication of Multidigit Numbers on Automata . Soviet Physics-Doklady, Vol. 7 (1963), 595--596.","journal-title":"Soviet Physics-Doklady"},{"key":"e_1_3_2_1_18_1","volume-title":"Joshua R. Wang, and R. Ryan Williams.","author":"Lincoln Andrea","year":"2016","unstructured":"Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, and R. Ryan Williams. 2016. Deterministic Time-Space Trade-Offs for k-SUM. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (Leibniz International Proceedings in Informatics (LIPIcs)), Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi (Eds.), Vol. 55. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 58:1--58:14."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002000000037"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1576702.1576743"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/646233.682386"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242355"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2012.03.012"},{"key":"e_1_3_2_1_24_1","unstructured":"Emmanuel Thom\u00e9. 2002. Karatsuba multiplication with temporary space of size \u0142eq n. (2002). online."},{"key":"e_1_3_2_1_25_1","first-page":"3431","article-title":"On some fine-grained questions in algorithms and complexity","volume":"3","author":"Williams Virginia Vassilevska","year":"2018","unstructured":"Virginia Vassilevska Williams. 2018. On some fine-grained questions in algorithms and complexity. In Proceedings ICM, Vol. 3. 3431--3472.","journal-title":"Proceedings ICM"}],"event":{"name":"ISSAC '19: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Beijing China","acronym":"ISSAC '19"},"container-title":["Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326249","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3326229.3326249","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3326229.3326249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:59Z","timestamp":1750206359000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,8]]},"references-count":24,"alternative-id":["10.1145\/3326229.3326249","10.1145\/3326229"],"URL":"https:\/\/doi.org\/10.1145\/3326229.3326249","relation":{},"subject":[],"published":{"date-parts":[[2019,7,8]]},"assertion":[{"value":"2019-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}