{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:48:03Z","timestamp":1725860883947},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319424316"},{"type":"electronic","value":"9783319424323"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42432-3_28","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T11:12:09Z","timestamp":1467717129000},"page":"223-231","source":"Crossref","is-referenced-by-count":0,"title":["Recursive Double-Size Fixed Precision Arithmetic"],"prefix":"10.1007","author":[{"given":"Alexis","family":"Breust","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Chabot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Guillaume","family":"Dumas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Fousse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Giorgi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"issue":"10","key":"28_CR1","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1109\/TC.2008.54","volume":"57","author":"O Arazi","year":"2008","unstructured":"Arazi, O., Qi, H.: On calculating multiplicative inverses modulo $$2^{m}$$ . IEEE Trans. Comput. 57(10), 1435\u20131438 (2008). http:\/\/dx.org\/10.1109\/TC.2008.54","journal-title":"IEEE Trans. Comput."},{"key":"28_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921698","volume-title":"Modern Computer Arithmetic","author":"R Brent","year":"2010","unstructured":"Brent, R., Zimmermann, P.: Modern Computer Arithmetic. Cambridge University Press, New York (2010)"},{"unstructured":"Burnikel, C., Ziegler, J.: Fast recursive division. Technical Report MPI-I-98-1-022, Max Planck Institute fr Informatik, October 1998. http:\/\/www.mpi-sb.mpg.de\/ziegler\/TechRep.ps.gz","key":"28_CR3"},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-1-4020-8588-8_9","volume-title":"High-Level Synthesis","author":"P Coussy","year":"2008","unstructured":"Coussy, P., Chavet, C., Bomel, P., Heller, D., Senn, E., Martin, E.: GAUT: a high-level synthesis tool for DSP applications. From algorithm to digital circuit. In: Coussy, P., Morawiec, A. (eds.) High-Level Synthesis, pp. 147\u2013169. Springer, Netherlands (2008). http:\/\/dx.org\/10.1007\/978-1-4020-8588-8_9"},{"issue":"8","key":"28_CR5","doi-asserted-by":"crossref","first-page":"2106","DOI":"10.1109\/TC.2013.94","volume":"63","author":"J-G Dumas","year":"2014","unstructured":"Dumas, J.-G.: On Newton-Raphson iteration for multiplicative inverses modulo prime powers. IEEE Trans. Comput. 63(8), 2106\u20132109 (2014). http:\/\/dx.org\/10.1109\/TC.2013.94","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"crossref","unstructured":"Dumas, J.-G., Gautier, T., Giesbrecht, M., Giorgi, P., Hovinen, B., Kaltofen, E., Saunders, B.D., Turner, W.J., Villard, G.: LinBox: a generic library for exact linear algebra. In: ICMS 2002, Beijing, China, pp. 40\u201350, August 2002. http:\/\/ljk.imag.fr\/membres\/Jean-Guillaume.Dumas\/Publications\/icms.pdf","key":"28_CR6","DOI":"10.1142\/9789812777171_0005"},{"issue":"3","key":"28_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1391989.1391992","volume":"35","author":"J-G Dumas","year":"2008","unstructured":"Dumas, J.-G., Giorgi, P., Pernet, C.: Dense linear algebra over prime fields. ACM Trans. Math. Softw. 35(3), 1\u201342 (2008). http:\/\/dx.org\/10.1145\/1391989.1391992","journal-title":"ACM Trans. Math. Softw."},{"issue":"1\/2","key":"28_CR8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1006\/jsco.2001.0451","volume":"32","author":"J-G Dumas","year":"2001","unstructured":"Dumas, J.-G., Saunders, B.D., Villard, G.: On efficient sparse integer matrix Smith normal form computations. J. Symbol Comput. 32(1\/2), 71\u201399 (2001). http:\/\/dx.org\/10.1006\/jsco.2001.0451","journal-title":"J. Symbol Comput."},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-09526-8_5","volume-title":"Mathematical Foundations of Computer Science 1979","author":"R Freivalds","year":"1979","unstructured":"Freivalds, R.: Fast probabilistic algorithms. In: Be\u010dv\u00e1\u0159, J. (ed.) MFCS 1979. LNCS, vol. 74, pp. 57\u201369. Springer, Heidelberg (1979)"},{"unstructured":"Gaudry, P., Thom\u00e9, E.: The mpFq library and implementing curve-based key exchanges. In: SPEED: Software Performance Enhancement for Encryption and Decryption, Amsterdam, Netherlands, pp. 49\u201364. ECRYPT Network, June 2007. http:\/\/hal.inria.fr\/inria-00168429","key":"28_CR10"},{"unstructured":"Granlund, T.: The GNU multiple precision arithmetic library, v6.1, November 2015. http:\/\/gmplib.org","key":"28_CR11"},{"doi-asserted-by":"crossref","unstructured":"Kaltofen, E.L., Nehring, M., Saunders, B.D.: Quadratic-time certificates in linear algebra. In: ISSAC 2011, San Jose, USA, pp. 171\u2013176, June 2011. http:\/\/www.math.ncsu.edu\/kaltofen\/bibliography\/11\/KNS11.pdf","key":"28_CR12","DOI":"10.1145\/1993886.1993915"},{"issue":"170","key":"28_CR13","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985). http:\/\/dx.org\/10.1090\/S0025-5718-1985-0777282-X","journal-title":"Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42432-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T14:47:25Z","timestamp":1568126845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42432-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319424316","9783319424323"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42432-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}