{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:57:46Z","timestamp":1743015466987,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99639-4_3","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T15:43:34Z","timestamp":1534952614000},"page":"32-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sparse Polynomial Arithmetic with the BPAS\u00a0Library"],"prefix":"10.1007","author":[{"given":"Mohammadali","family":"Asadi","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Brandt","sequence":"additional","affiliation":[]},{"given":"Robert H. C.","family":"Moir","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Moreno Maza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Arnold, A., Roche, D.S.: Output-sensitive algorithms for sumset and sparse polynomial multiplication. In: Proceedings of ISSAC 2015, pp. 29\u201336 (2015). \n                    http:\/\/doi.acm.org\/10.1145\/2755996.2756653","DOI":"10.1145\/2755996.2756653"},{"key":"3_CR2","unstructured":"Bronstein, M., Moreno Maza, M., Watt, S.: Generic programming techniques in ALDOR. In: Proceedings of AWFS 2007, pp. 72\u201377 (2007)"},{"key":"3_CR3","unstructured":"Chen, C., Covanov, S., Mansouri, F., Maza, M.M., Xie, N., Xie, Y.: Parallel integer polynomial multiplication. CoRR abs\/1612.05778 (2016). \n                    http:\/\/arxiv.org\/abs\/1612.05778"},{"issue":"6","key":"3_CR4","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.jsc.2011.12.023","volume":"47","author":"C Chen","year":"2012","unstructured":"Chen, C., Moreno Maza, M.: Algorithms for computing triangular decomposition of polynomial systems. J. Symb. Comput. 47(6), 610\u2013642 (2012). \n                    https:\/\/doi.org\/10.1016\/j.jsc.2011.12.023","journal-title":"J. Symb. Comput."},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-319-02297-0_8","volume-title":"Computer Algebra in Scientific Computing","author":"M Gastineau","year":"2013","unstructured":"Gastineau, M., Laskar, J.: Highly scalable multiplication for distributed sparse multivariate polynomials on many-core systems. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2013. LNCS, vol. 8136, pp. 100\u2013115. Springer, Cham (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-319-02297-0_8"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Gastineau, M., Laskar, J.: Parallel sparse multivariate polynomial division. In: Proceedings of PASCO 2015, pp. 25\u201333 (2015). \n                    http:\/\/doi.acm.org\/10.1145\/2790282.2790285","DOI":"10.1145\/2790282.2790285"},{"key":"3_CR7","unstructured":"Granlund, T., et al.: GNU MP 6.0 Multiple Precision Arithmetic Library. Samurai Media Limited (2015)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Hall Jr., A.D.: The ALTRAN system for rational function manipulation-a survey. In: Proceedings of the Second ACM Symposium on Symbolic and Algebraic Manipulation, pp. 153\u2013157. ACM (1971)","DOI":"10.1145\/800204.806280"},{"key":"3_CR9","unstructured":"Hart, W., Johansson, F., Pancratz, S.: FLINT: Fast Library for Number Theory, v. 2.4.3. \n                    http:\/\/flintlib.org"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.jsc.2012.06.004","volume":"50","author":"J Hoeven van der","year":"2013","unstructured":"van der Hoeven, J., Lecerf, G.: On the bit-complexity of sparse polynomial and series multiplication. J. Symb. Comput. 50, 227\u2013254 (2013). \n                    https:\/\/doi.org\/10.1016\/j.jsc.2012.06.004","journal-title":"J. Symb. Comput."},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1086837.1086847","volume":"8","author":"SC Johnson","year":"1974","unstructured":"Johnson, S.C.: Sparse polynomial arithmetic. ACM SIGSAM Bull. 8(3), 63\u201371 (1974)","journal-title":"ACM SIGSAM Bull."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-0-387-09766-4_289","volume-title":"Encyclopedia of Parallel Computing","author":"CE Leiserson","year":"2011","unstructured":"Leiserson, C.E.: Cilk. In: Padua, D. (ed.) Encyclopedia of Parallel Computing, pp. 273\u2013288. Springer, Boston (2011). \n                    https:\/\/doi.org\/10.1007\/978-0-387-09766-4_289"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/1113439.1113456","volume":"39","author":"F Lemaire","year":"2005","unstructured":"Lemaire, F., Maza, M.M., Xie, Y.: The regularchains library in MAPLE. ACM SIGSAM Bull. 39(3), 96\u201397 (2005). \n                    https:\/\/doi.org\/10.1145\/1113439.1113456","journal-title":"ACM SIGSAM Bull."},{"issue":"7","key":"3_CR14","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1016\/j.jsc.2008.04.019","volume":"44","author":"X Li","year":"2009","unstructured":"Li, X., Maza, M.M., Schost, \u00c9.: Fast arithmetic for triangular sets: from theory to practice. J. Symb. Comput. 44(7), 891\u2013907 (2009). \n                    https:\/\/doi.org\/10.1016\/j.jsc.2008.04.019","journal-title":"J. Symb. Comput."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Monagan, M.B., Pearce, R.: Parallel sparse polynomial multiplication using heaps. In: ISSAC, pp. 263\u2013270 (2009)","DOI":"10.1145\/1576702.1576739"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-540-75187-8_23","volume-title":"Computer Algebra in Scientific Computing","author":"M Monagan","year":"2007","unstructured":"Monagan, M., Pearce, R.: Polynomial division using dynamic arrays, heaps, and packed exponent vectors. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2007. LNCS, vol. 4770, pp. 295\u2013315. Springer, Heidelberg (2007). \n                    https:\/\/doi.org\/10.1007\/978-3-540-75187-8_23"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Monagan, M., Pearce, R.: Parallel sparse polynomial division using heaps. In: Proceedings of PASCO 2010, pp. 105\u2013111. ACM (2010)","DOI":"10.1145\/1837210.1837227"},{"issue":"3\/4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/2733693.2733720","volume":"48","author":"M Monagan","year":"2015","unstructured":"Monagan, M., Pearce, R.: The design of Maple\u2019s sum-of-products and POLY data structures for representing mathematical objects. ACM Commun. Comput. Algebra 48(3\/4), 166\u2013186 (2015)","journal-title":"ACM Commun. Comput. Algebra"},{"issue":"7","key":"3_CR19","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.jsc.2010.08.014","volume":"46","author":"MB Monagan","year":"2011","unstructured":"Monagan, M.B., Pearce, R.: Sparse polynomial division using a heap. J. Symb. Comput. 46(7), 807\u2013822 (2011). \n                    https:\/\/doi.org\/10.1016\/j.jsc.2010.08.014","journal-title":"J. Symb. Comput."},{"issue":"5","key":"3_CR20","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1142\/S0129054111008556","volume":"22","author":"M Moreno Maza","year":"2011","unstructured":"Moreno Maza, M., Xie, Y.: Balanced dense polynomial multiplication on multi-cores. Int. J. Found. Comput. Sci. 22(5), 1035\u20131055 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"3_CR21","unstructured":"Shoup, V., et al.: NTL: A library for doing number theory. \n                    www.shoup.net\/ntl\/"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99639-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T20:32:36Z","timestamp":1535920356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99639-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99639-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}