{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T13:43:15Z","timestamp":1762782195665,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100007493","name":"Fondation Math\u00e9matique Jacques Hadamard","doi-asserted-by":"publisher","award":["PGMO GAMMA"],"award-info":[{"award-number":["PGMO GAMMA"]}],"id":[{"id":"10.13039\/501100007493","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3208976.3209017","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"79-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations"],"prefix":"10.1145","author":[{"given":"J\u00e9r\u00e9my","family":"Berthomieu","sequence":"first","affiliation":[{"name":"Sorbonne Universit\u00e9, CNRS, INRIA, LIP6, \u00c9quipe PolSys, Paris, France"}]},{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, CNRS, INRIA, LIP6, \u00c9quipe PolSys, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479892230031"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054109"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755996.2756673"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755996.2756673"},{"key":"e_1_3_2_1_5_1","volume-title":"In-depth comparison of the Berlekamp -- Massey -- Sakata and the Scalar-FGLM algorithms: the non adaptive variants. (May","author":"Berthomieu J.","year":"2017","unstructured":"J. Berthomieu and J.-Ch. Faug\u00e8re . 2017. In-depth comparison of the Berlekamp -- Massey -- Sakata and the Scalar-FGLM algorithms: the non adaptive variants. (May 2017 ). https:\/\/hal.inria.fr\/hal-01516708 preprint. J. Berthomieu and J.-Ch. Faug\u00e8re. 2017. In-depth comparison of the Berlekamp -- Massey -- Sakata and the Scalar-FGLM algorithms: the non adaptive variants. (May 2017). https:\/\/hal.inria.fr\/hal-01516708 preprint."},{"key":"e_1_3_2_1_6_1","unstructured":"J. Berthomieu and J.-Ch. Faug\u00e8re. 2018. Experiments. (2018). http:\/\/www-polsys.lip6.fr\/~berthomieu\/ISSAC2018.html  J. Berthomieu and J.-Ch. Faug\u00e8re. 2018. Experiments. (2018). http:\/\/www-polsys.lip6.fr\/~berthomieu\/ISSAC2018.html"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556111"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(60)90287-4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-006-0015-8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(80)90013-9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178683"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"volume-title":"D. Cox, J. Little, and D. O'Shea. 2015. Ideals, Varieties, and Algorithms","key":"e_1_3_2_1_13_1","unstructured":"D. Cox, J. Little, and D. O'Shea. 2015. Ideals, Varieties, and Algorithms ( fourth ed.). Springer , New York . xvi+646 pages. An introduction to computational algebraic geometry and commutative algebra. D. Cox, J. Little, and D. O'Shea. 2015. Ideals, Varieties, and Algorithms (fourth ed.). Springer, New York. xvi+646 pages. An introduction to computational algebraic geometry and commutative algebra."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057299"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993908"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2016.07.025"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80087-9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.59953"},{"key":"e_1_3_2_1_19_1","first-page":"147","article-title":"Codes correcteurs d'erreurs","volume":"2","author":"Hocquenghem A.","year":"1959","unstructured":"A. Hocquenghem . 1959 . Codes correcteurs d'erreurs . Chiffres 2 (1959), 147 -- 156 . A. Hocquenghem. 1959. Codes correcteurs d'erreurs. Chiffres 2 (1959), 147 -- 156.","journal-title":"Chiffres"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(89)90032-3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/sapm1946251261"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087604.3087632"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80033-6"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90039-K"},{"volume-title":"The BMS Algorithm","author":"Sakata Sh.","key":"e_1_3_2_1_26_1","unstructured":"Sh. Sakata . 2009. The BMS Algorithm . In Gr\u00f6bner Bases, Coding, and Cryptography, Massimiliano Sala, Shojiro Sakata, Teo Mora, Carlo Traverso, and Ludovic Perret (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 143--163. Sh. Sakata. 2009. The BMS Algorithm. In Gr\u00f6bner Bases, Coding, and Cryptography, Massimiliano Sala, Shojiro Sakata, Teo Mora, Carlo Traverso, and Ludovic Perret (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 143--163."},{"volume-title":"The MIT Press","author":"Wiener N.","key":"e_1_3_2_1_27_1","unstructured":"N. Wiener . 1964. Extrapolation, Interpolation, and Smoothing of Stationary Time Series . The MIT Press , Cambridge, MA . N. Wiener. 1964. Extrapolation, Interpolation, and Smoothing of Stationary Time Series. The MIT Press, Cambridge, MA."}],"event":{"name":"ISSAC '18: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"New York NY USA","acronym":"ISSAC '18"},"container-title":["Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3208976.3209017","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3208976.3209017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:49Z","timestamp":1750208929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3208976.3209017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":27,"alternative-id":["10.1145\/3208976.3209017","10.1145\/3208976"],"URL":"https:\/\/doi.org\/10.1145\/3208976.3209017","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}