{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:54:31Z","timestamp":1743044071518,"version":"3.40.3"},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030408138"},{"type":"electronic","value":"9783030408145"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-40814-5_7","type":"book-chapter","created":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T13:02:55Z","timestamp":1585054975000},"page":"59-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Italian Folk Multiplication Algorithm Is Indeed Better: It Is More Parallelizable"],"prefix":"10.1007","author":[{"given":"Martine","family":"Ceberio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Kosheleva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladik","family":"Kreinovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,25]]},"reference":[{"key":"7_CR1","volume-title":"The Historical Roots of Elementary Mathematics","author":"LNH Bunt","year":"1988","unstructured":"Bunt, L.N.H., Jones, P.S., Bedient, J.D.: The Historical Roots of Elementary Mathematics. Dover, New York (1988)"},{"key":"7_CR2","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge, Massachusetts (2009)"},{"key":"7_CR3","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 2. Seminumerical Algorithms, Addison Wesley, Reading, Massachusetts (1969)"},{"key":"7_CR4","unstructured":"Llorente, A.: 3 sencillos m\u00e9todos para aprender a multiplicar sin calculadora, BBC Mundo, posted Nov 22 (2017). \nhttp:\/\/www.bbc.com\/mundo\/noticias-42020116"},{"issue":"3","key":"7_CR5","first-page":"178","volume":"1","author":"JI Vargas","year":"2007","unstructured":"Vargas, J.I., Kosheleva, O.: Russian peasant multiplication algorithm, RSA cryptosystem, and a new explanation of half-orders of magnitude. J. Uncertain Syst. 1(3), 178\u2013184 (2007)","journal-title":"J. Uncertain Syst."}],"container-title":["Studies in Systems, Decision and Control","Decision Making under Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40814-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T23:04:31Z","timestamp":1585091071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-40814-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030408138","9783030408145"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40814-5_7","relation":{},"ISSN":["2198-4182","2198-4190"],"issn-type":[{"type":"print","value":"2198-4182"},{"type":"electronic","value":"2198-4190"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}