{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T05:04:13Z","timestamp":1733029453194,"version":"3.30.0"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T00:00:00Z","timestamp":1729987200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T00:00:00Z","timestamp":1729987200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency (JST)","doi-asserted-by":"publisher","award":["JPMJAP2302"],"award-info":[{"award-number":["JPMJAP2302"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,10,27]]},"DOI":"10.1109\/focs61266.2024.00127","type":"proceedings-article","created":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T18:48:52Z","timestamp":1732906132000},"page":"2180-2185","source":"Crossref","is-referenced-by-count":0,"title":["Power Series Composition in Near-Linear Time"],"prefix":"10.1109","author":[{"given":"Yasunori","family":"Kinoshita","sequence":"first","affiliation":[{"name":"Tokyo Institute of Technology,Tokyo,Japan"}]},{"given":"Baitian","family":"Li","sequence":"additional","affiliation":[{"name":"Institute for Interdisciplinary Information Sciences, Tsinghua University,Beijing,China"}]}],"member":"263","reference":[{"volume-title":"Removing redundancy in high-precision newton iteration","author":"Bernstein","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1998.0216"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860870"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-08-02066-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976496.14"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1390768.1390806"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.03.012"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-697560-4.50014-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322099"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03338-8"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178683"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.2307\/2003354"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0214007"},{"key":"ref14","first-page":"125","article-title":"Modular algorithms for polynomial basis conversion and greatest factorial factorization","volume-title":"Proc. 7th Rhine Workshop Comput. Algebra","author":"Gerhard","year":"2000"},{"journal-title":"Faster exponentials of power series","year":"2009","author":"Harvey","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-2010-02392-0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2019.03.004"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1998.0476"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.13"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/08073408x"},{"key":"ref21","volume-title":"The Art of Computer Programming","volume":"2","author":"Knuth","year":"1998"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01436917"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3638349"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2012.05.007"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90107-6"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00044-2"},{"key":"ref27","article-title":"Fast algorithms","author":"Schonhage","year":"1994","journal-title":"A multitape Turing machine implementation. B.I. Wissenschaftsverlag"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1515\/dma.2010.002"},{"journal-title":"A note on the fast power series\u2019 exponential","year":"2012","author":"Sergeev","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2002.0562"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.03.005"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2019.04.001"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.134"}],"event":{"name":"2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2024,10,27]]},"location":"Chicago, IL, USA","end":{"date-parts":[[2024,10,30]]}},"container-title":["2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10755992\/10756014\/10756067.pdf?arnumber=10756067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T05:51:56Z","timestamp":1732945916000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10756067\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,27]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/focs61266.2024.00127","relation":{},"subject":[],"published":{"date-parts":[[2024,10,27]]}}}