{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T18:02:59Z","timestamp":1774548179857,"version":"3.50.1"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T00:00:00Z","timestamp":1515024000000},"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":[[2018,1,4]]},"abstract":"<jats:p>\n            The CUDA Modular Polynomial (CUMODP) Library implements arithmetic operations for dense matrices and dense polynomials, primarily with modular integer coefficients. Some operations are available for integer or floating point coefficients. Similar to other software libraries, like CuBLAS\n            <jats:sup>1<\/jats:sup>\n            targeting Graphics Processing Units (GPUs), CUMODP focuses on efficiency-critical routines and provides them in the form of device functions and CUDA kernels. Hence, these routines are primarily designed to offer GPU support to polynomial system solvers. A bivariate system solver is part of the library, as a proof-of-concept. Its implementation is presented in [10] and it is integrated in M\n            <jats:sc>aple<\/jats:sc>\n            's Triangularize command\n            <jats:sup>2<\/jats:sup>\n            , since the release 18 of M\n            <jats:sc>aple<\/jats:sc>\n            .\n          <\/jats:p>","DOI":"10.1145\/3177795.3177799","type":"journal-article","created":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T16:27:31Z","timestamp":1515083251000},"page":"89-91","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["<b>CUMODP<\/b>"],"prefix":"10.1145","volume":"51","author":[{"given":"S. Anisul","family":"Haque","sequence":"first","affiliation":[{"name":"Qassim University, Saudi Arabia"}]},{"given":"X.","family":"Li","sequence":"additional","affiliation":[{"name":"Universidad Carlos III, Spain"}]},{"given":"F.","family":"Mansouri","sequence":"additional","affiliation":[{"name":"Microsoft"}]},{"given":"M. Moreno","family":"Maza","sequence":"additional","affiliation":[{"name":"University of Western Ontario, Canada"}]},{"given":"D.","family":"Mohajerani","sequence":"additional","affiliation":[{"name":"University of Western Ontario, Canada"}]},{"given":"W.","family":"Pan","sequence":"additional","affiliation":[{"name":"Intel Corporation"}]}],"member":"320","published-online":{"date-parts":[[2018,1,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"e_1_2_1_2_1","first-page":"153","volume-title":"8th International Symposium, ANTS-VIII","author":"Brent Richard P.","year":"2008","unstructured":"Richard P. Brent , Pierrick Gaudry , Emmanuel Thom\u00e9 , and Paul Zimmermann . Faster multiplication in gf(2)[x]. In Algorithmic Number Theory , 8th International Symposium, ANTS-VIII , Banff, Canada, May 17--22 , 2008 , Proceedings, pages 153 -- 166 , 2008. Richard P. Brent, Pierrick Gaudry, Emmanuel Thom\u00e9, and Paul Zimmermann. Faster multiplication in gf(2)[x]. In Algorithmic Number Theory, 8th International Symposium, ANTS-VIII, Banff, Canada, May 17--22, 2008, Proceedings, pages 153--166, 2008."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/385\/1\/012014"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44199-2_108"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10515-4_13"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the International Conference on Parallel Computing, ParCo 2015","author":"Haque Sardar Anisul","year":"2015","unstructured":"Sardar Anisul Haque , Marc Moreno Maza , and Ning Xie . A many-core machine model for designing algorithms with minimum parallelism overheads. In Parallel Computing: On the Road to Exascale , Proceedings of the International Conference on Parallel Computing, ParCo 2015 , 1--4 September 2015 , Edinburgh, Scotland, UK, pages 35--44 , 2015. Sardar Anisul Haque, Marc Moreno Maza, and Ning Xie. A many-core machine model for designing algorithms with minimum parallelism overheads. In Parallel Computing: On the Road to Exascale, Proceedings of the International Conference on Parallel Computing, ParCo 2015, 1--4 September 2015, Edinburgh, Scotland, UK, pages 35--44, 2015."},{"key":"e_1_2_1_7_1","volume-title":"FLINT: Fast Library for Number Theory","author":"Hart W.","year":"2013","unstructured":"W. Hart , F. Johansson , and S. Pancratz . FLINT: Fast Library for Number Theory , 2013 . Version 2.4.0, http:\/\/flintlib.org. W. Hart, F. Johansson, and S. Pancratz. FLINT: Fast Library for Number Theory, 2013. Version 2.4.0, http:\/\/flintlib.org."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.08.016"},{"key":"e_1_2_1_9_1","first-page":"256","article-title":"Fast polynomial arithmetic on a GPU","author":"Moreno Maza M.","year":"2010","unstructured":"M. Moreno Maza and W. Pan . Fast polynomial arithmetic on a GPU . J. of Physics: Conference Series , 256 , 2010 . M. Moreno Maza and W. Pan. Fast polynomial arithmetic on a GPU. J. of Physics: Conference Series, 256, 2010.","journal-title":"J. of Physics: Conference Series"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/341\/1\/012022"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139856065","volume-title":"Modern Computer Algebra (3. ed.)","author":"von zur Gathen Joachim","year":"2013","unstructured":"Joachim von zur Gathen and J\u00fcrgen Gerhard . Modern Computer Algebra (3. ed.) . Cambridge University Press , 2013 . Joachim von zur Gathen and J\u00fcrgen Gerhard. Modern Computer Algebra (3. ed.). Cambridge University Press, 2013."}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3177795.3177799","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3177795.3177799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:51Z","timestamp":1750273551000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3177795.3177799"}},"subtitle":["a CUDA library for modular polynomial computation"],"short-title":[],"issued":{"date-parts":[[2018,1,4]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,1,4]]}},"alternative-id":["10.1145\/3177795.3177799"],"URL":"https:\/\/doi.org\/10.1145\/3177795.3177799","relation":{},"ISSN":["1932-2240"],"issn-type":[{"value":"1932-2240","type":"print"}],"subject":[],"published":{"date-parts":[[2018,1,4]]},"assertion":[{"value":"2018-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}