{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:45:11Z","timestamp":1725936311811},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319724522"},{"type":"electronic","value":"9783319724539"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-72453-9_7","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T09:35:54Z","timestamp":1513762554000},"page":"95-106","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Fast Chinese Remaindering in Practice"],"prefix":"10.1007","author":[{"given":"Joris","family":"van der Hoeven","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Bajard, J.C., Kaihara, M.E., Plantard, T.: Selected RNS bases for modular multiplication. In: Proceedings of the 19th IEEE Symposium on Computer Arithmetic, pp. 25\u201332 (2009)","DOI":"10.1109\/ARITH.2009.20"},{"key":"7_CR2","unstructured":"Bernstein, D.: Scaled remainder trees (2004). \nhttps:\/\/cr.yp.to\/arith\/scaledmod-20040820.pdf"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/S0022-0000(74)80029-2","volume":"8","author":"A Borodin","year":"1974","unstructured":"Borodin, A., Moenck, R.T.: Fast modular transforms. J. Comput. Syst. Sci. 8, 366\u2013386 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Bostan, A., Lecerf, G., Schost, \u00c9.: Tellegen\u2019s principle into practice. In: Proceedings of ISSAC 2003, pp. 37\u201344. ACM Press (2003)","DOI":"10.1145\/860854.860870"},{"issue":"4","key":"7_CR5","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.jco.2004.09.009","volume":"21","author":"A Bostan","year":"2005","unstructured":"Bostan, A., Schost, \u00c9.: Polynomial evaluation and interpolation on special sets of points. J. Complex. 21(4), 420\u2013446 (2005). Festschrift for the 70th Birthday of Arnold Sch\u00f6nhage","journal-title":"J. Complex."},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19, 297\u2013301 (1965)","journal-title":"Math. Comput."},{"key":"7_CR7","unstructured":"Doliskani, J., Giorgi, P., Lebreton, R., Schost, \u00c9.: Simultaneous conversions with the Residue Number System using linear algebra. Technical report, HAL (2016). \nhttps:\/\/hal-lirmm.ccsd.cnrs.fr\/lirmm-01415472"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M.: Polynomial evaluation via the division algorithm: the fast Fourier transform revisited. In: Rosenberg, A.L. (ed.) Fourth Annual ACM Symposium on Theory of Computing, pp. 88\u201393 (1972)","DOI":"10.1145\/800152.804900"},{"key":"7_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139856065","volume-title":"Modern Computer Algebra","author":"J Gathen von zur","year":"2013","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 3rd edn. Cambridge University Press, New York (2013)","edition":"3"},{"key":"7_CR10","unstructured":"van der Hoeven, J.: Faster Chinese remaindering. Technical report, HAL (2016). \nhttp:\/\/hal.archives-ouvertes.fr\/hal-01403810"},{"key":"7_CR11","unstructured":"van der Hoeven, J., Lecerf, G., Mourrain, B., et al.: Mathemagix (2002). \nhttp:\/\/www.mathemagix.org"},{"issue":"1","key":"7_CR12","first-page":"5:1","volume":"43","author":"J Hoeven van der","year":"2016","unstructured":"van der Hoeven, J., Lecerf, G., Quintin, G.: Modular SIMD arithmetic in Mathemagix. ACM Trans. Math. Softw. 43(1), 5:1\u20135:37 (2016)","journal-title":"ACM Trans. Math. Softw."},{"key":"7_CR13","first-page":"595","volume":"7","author":"A Karatsuba","year":"1963","unstructured":"Karatsuba, A., Ofman, J.: Multiplication of multidigit numbers on automata. Soviet Phys. Doklady 7, 595\u2013596 (1963)","journal-title":"Soviet Phys. Doklady"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Moenck, R.T., Borodin, A.: Fast modular transforms via division. In: Thirteenth annual IEEE Symposium on Switching and Automata Theory, pp. 90\u201396, University of Maryland, College Park (1972)","DOI":"10.1109\/SWAT.1972.5"},{"key":"7_CR15","unstructured":"The PARI Group, Bordeaux. PARI\/GP (2012). Software. \nhttp:\/\/pari.math.u-bordeaux.fr"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72453-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T09:37:40Z","timestamp":1513762660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72453-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724522","9783319724539"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72453-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}