{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:37:15Z","timestamp":1761597435988,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T00:00:00Z","timestamp":1372204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,26]]},"DOI":"10.1145\/2465506.2465526","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"355-362","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Structured FFT and TFT"],"prefix":"10.1145","author":[{"given":"Joris","family":"van der Hoeven","sequence":"first","affiliation":[{"name":"\u00c9cole polytechnique, Palaiseau, France"}]},{"given":"Romain","family":"Lebreton","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Montpellier II, Montpellier, France"}]},{"given":"\u00c9ric","family":"Schost","sequence":"additional","affiliation":[{"name":"Western University, London, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2013,6,26]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/62212.62241"},{"key":"e_1_3_2_1_3_1","volume-title":"The fast Fourier transform and fast wavelet transform for patterns on the torus. Applied and Computational Harmonic Analysis","author":"Bergmann R.","year":"2012","unstructured":"R. Bergmann . The fast Fourier transform and fast wavelet transform for patterns on the torus. Applied and Computational Harmonic Analysis , 2012 . In Press . R. Bergmann. The fast Fourier transform and fast wavelet transform for patterns on the torus. Applied and Computational Harmonic Analysis, 2012. In Press."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.5555\/1965416"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/74540.74556"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/BF01178683"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"e_1_3_2_1_8_1","volume-title":"Algorithms for Computer Algebra","author":"Czapor S.","year":"1992","unstructured":"S. Czapor , K. Geddes , and G. Labahn . Algorithms for Computer Algebra . Kluwer Academic Publishers , 1992 . S. Czapor, K. Geddes, and G. Labahn. Algorithms for Computer Algebra. Kluwer Academic Publishers, 1992."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1016\/0165-1684(90)90158-U"},{"unstructured":"R.J. Fateman. What's it worth to write a short program for polynomial multiplication. http:\/\/www.cs.berkeley.edu\/~fateman\/papers\/shortprog.tex 2010.  R.J. Fateman. What's it worth to write a short program for polynomial multiplication. http:\/\/www.cs.berkeley.edu\/~fateman\/papers\/shortprog.tex 2010.","key":"e_1_3_2_1_10_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/44128.214376"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1016\/j.tcs.2009.03.030"},{"key":"e_1_3_2_1_13_1","volume-title":"IMCCE","author":"Gastineau M.","year":"2012","unstructured":"M. Gastineau and J. Laskar . TRIP 1.2.26. Trip reference manual , IMCCE , 2012 . http:\/\/www.imcce.fr\/trip\/. M. Gastineau and J. Laskar. TRIP 1.2.26. Trip reference manual, IMCCE, 2012. http:\/\/www.imcce.fr\/trip\/."},{"key":"e_1_3_2_1_14_1","volume-title":"Modern Computer Algebra","author":"von zur Gathen J.","year":"2002","unstructured":"J. von zur Gathen and J. Gerhard . Modern Computer Algebra . Cambridge University Press , 2 nd edition, 2002 . J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 2nd edition, 2002.","edition":"2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1109\/TASSP.1986.1164883"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1006\/jsco.2002.0562"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/1005285.1005327"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1016\/j.jsc.2010.03.005"},{"key":"e_1_3_2_1_20_1","volume-title":"HAL","author":"van der Hoeven J.","year":"2010","unstructured":"J. van der Hoeven and G. Lecerf . On the bit-complexity of sparse polynomial multiplication. Technical report , HAL , 2010 . http:\/\/hal.archives-ouvertes.fr\/hal-00476223, accepted for publication in JSC. J. van der Hoeven and G. Lecerf. On the bit-complexity of sparse polynomial multiplication. Technical report, HAL, 2010. http:\/\/hal.archives-ouvertes.fr\/hal-00476223, accepted for publication in JSC."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/2442829.2442861"},{"key":"e_1_3_2_1_22_1","volume-title":"HAL","author":"van der Hoeven J.","year":"2010","unstructured":"J. van der Hoeven and \u00c9. Schost. Multi-point evaluation in higher dimensions. Technical report , HAL , 2010 . http:\/\/hal.archives-ouvertes.fr\/hal-00477658, accepted for publication in AAECC. J. van der Hoeven and \u00c9. Schost. Multi-point evaluation in higher dimensions. Technical report, HAL, 2010. http:\/\/hal.archives-ouvertes.fr\/hal-00477658, accepted for publication in AAECC."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/1277548.1277576"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/1086837.1086847"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.5555\/646361.690740"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/96877.96912"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/345542.345629"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1107\/S0108767307047411"},{"key":"e_1_3_2_1_29_1","volume-title":"Polynomial and matrix computations","author":"Pan V.","year":"1994","unstructured":"V. Pan and D. Bini . Polynomial and matrix computations . Birkhauser , 1994 . V. Pan and D. Bini. Polynomial and matrix computations. Birkhauser, 1994."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1006\/jsco.1994.1042"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1016\/j.jsc.2010.08.013"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1007\/BF02242355"},{"key":"e_1_3_2_1_33_1","first-page":"221","volume-title":"Proceedings of the 1984 MACSYMA Users' Conference: Schenectady","author":"Stoutemyer D. R.","year":"1984","unstructured":"D. R. Stoutemyer . Which polynomial representation is best ? In Proceedings of the 1984 MACSYMA Users' Conference: Schenectady , New York , July 23-25, 1984 , pages 221 -- 243 , 1984. D. R. Stoutemyer. Which polynomial representation is best? In Proceedings of the 1984 MACSYMA Users' Conference: Schenectady, New York, July 23-25, 1984, pages 221--243, 1984."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1107\/S0567739473000458"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1007\/s10851-007-0013-x"}],"event":{"sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"acronym":"ISSAC'13","name":"ISSAC'13: International Symposium on Symbolic and Algebraic Computation","location":"Boston Maine USA"},"container-title":["Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465506.2465526","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2465506.2465526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:36Z","timestamp":1750234716000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465506.2465526"}},"subtitle":["symmetric and lattice polynomials"],"short-title":[],"issued":{"date-parts":[[2013,6,26]]},"references-count":33,"alternative-id":["10.1145\/2465506.2465526","10.1145\/2465506"],"URL":"https:\/\/doi.org\/10.1145\/2465506.2465526","relation":{},"subject":[],"published":{"date-parts":[[2013,6,26]]},"assertion":[{"value":"2013-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}