{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T14:01:50Z","timestamp":1762783310979,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-22-CE91-00075 EAGLES, ANR-21-CE39-0006 SANGRIA and ANR-22-PECY-0010 CRYPTANALYSE"],"award-info":[{"award-number":["ANR-22-CE91-00075 EAGLES, ANR-21-CE39-0006 SANGRIA and ANR-22-PECY-0010 CRYPTANALYSE"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,28]]},"DOI":"10.1145\/3747199.3747569","type":"proceedings-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T10:51:17Z","timestamp":1762771877000},"page":"258-266","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Quasi-Linear Guessing of Minimal Lexicographic Gr\u00f6bner Bases of Ideals of C-Relations of Random Bi-Indexed Sequences"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9011-2211","authenticated-orcid":false,"given":"J\u00e9r\u00e9my","family":"Berthomieu","sequence":"first","affiliation":[{"name":"Sorbonne Universit\u00e9, CNRS, LIP6, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0880-1190","authenticated-orcid":false,"given":"Romain","family":"Lebreton","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Montpellier, CNRS, LIRMM, Montpellier, France"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7800-5804","authenticated-orcid":false,"given":"Kevin","family":"Tran","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, CNRS, LIP6, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/190347.190382"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","unstructured":"E. Berlekamp. 1968. Nonbinary BCH Decoding. IEEE Trans. Inform. Theory 14 2 (1968) 242\u2013242. 10.1109\/TIT.1968.1054109","DOI":"10.1109\/TIT.1968.1054109"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/2755996.2756673"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","unstructured":"J. Berthomieu B. Boyer and J.-Ch. Faug\u00e8re. 2017. Linear algebra for computing Gr\u00f6bner bases of linear recursive multidimensional sequences. Journal of Symbolic Computation 83 (2017) 36\u201367. 10.1016\/j.jsc.2016.11.005Special issue on the conference ISSAC 2015.","DOI":"10.1016\/j.jsc.2016.11.005"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3208976.3209017"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","unstructured":"J. Berthomieu and J.-Ch. Faug\u00e8re. 2022. Polynomial-division-based algorithms for computing linear recurrence relations. Journal of Symbolic Computation 109 (2022) 1\u201330. 10.1016\/j.jsc.2021.07.002","DOI":"10.1016\/j.jsc.2021.07.002"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"crossref","unstructured":"J. Berthomieu R. Lebreton and K. Tran. 2025. CrecbiseqGuessing a Maple Function for Quasi-Linear Guessing Minimal Lexicographic Gr\u00f6bner bases of Idealsof C-Relations of Random Bi-Indexed Sequences. https:\/\/github.com\/ktran11\/CrecbiseqGuessing detailed example at https:\/\/github.com\/ktran11\/CrecbiseqGuessing\/blob\/main\/example\/example_iterative.pdf.","DOI":"10.1145\/3747199.3747569"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860870"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","unstructured":"R.\u00a0P. Brent F.\u00a0G. Gustavson and D.\u00a0Y.\u00a0Y. Yun. 1980. Fast solution of Toeplitz systems of equations and computation of Pad\u00e9 approximants. Journal of Algorithms 1 3 (1980) 259\u2013295. 10.1016\/0196-6774(80)90013-9","DOI":"10.1016\/0196-6774(80)90013-9"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16721-3"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","unstructured":"J-Ch. Faug\u00e8re P. Gianni D. Lazard and T. Mora. 1993. Efficient Computation of Zero-dimensional Gr\u00f6bner Bases by Change of Ordering. Journal of Symbolic Computation 16 4 (1993) 329\u2013344. 10.1006\/jsco.1993.1051","DOI":"10.1006\/jsco.1993.1051"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","unstructured":"J.-Ch. Faug\u00e8re and Ch. Mou. 2017. Sparse FGLM Algorithms. Journal of Symbolic Computation 80 (2017) 538\u2013569. 10.1016\/j.jsc.2016.07.025","DOI":"10.1016\/j.jsc.2016.07.025"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3452143.3465533"},{"key":"e_1_3_3_2_16_2","first-page":"269","volume-title":"Actes du Congres International des Math\u00e9maticiens (Nice, 1970)","author":"Knuth D.\u00a0E.","year":"1970","unstructured":"D.\u00a0E. Knuth. 1970. The analysis of algorithms. In Actes du Congres International des Math\u00e9maticiens (Nice, 1970) , Vol.\u00a03. 269\u2013274."},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","unstructured":"D. Lazard. 1985. Ideal Bases and Primary Decomposition: Case of Two Variables. J. Symb. Comput. 1 3 (1985) 261\u2013270. 10.1016\/S0747-7171(85)80035-3","DOI":"10.1016\/S0747-7171(85)80035-3"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","unstructured":"J. Massey. 1969. Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theor. 15 1 (1969) 122\u2013127. 10.1109\/TIT.1969.1054260","DOI":"10.1109\/TIT.1969.1054260"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804045"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3087604.3087632"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3373207.3404059"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","unstructured":"Sh. Sakata. 1988. Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array. J. Symbolic Comput. 5 3 (1988) 321\u2013337. 10.1016\/S0747-7171(88)80033-6","DOI":"10.1016\/S0747-7171(88)80033-6"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","unstructured":"Sh. Sakata. 1990. Extension of the Berlekamp-Massey Algorithm to N Dimensions. Inform. and Comput. 84 2 (1990) 207\u2013239. 10.1016\/0890-5401(90)90039-K","DOI":"10.1016\/0890-5401(90)90039-K"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93806-4_9"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","unstructured":"A. Sch\u00f6nhage. 1971. Schnelle Berechnung von Kettenbruchentwicklungen. Acta Informatica 1 2 (1971) 139\u2013144. 10.1007\/BF00289520","DOI":"10.1007\/BF00289520"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3208976.3209020"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","unstructured":"G. Villard. 2025. Bivariate polynomial reduction and elimination ideal over finite fields. Journal of Symbolic Computation 127 (2025) 102367. 10.1016\/j.jsc.2024.102367","DOI":"10.1016\/j.jsc.2024.102367"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"crossref","unstructured":"D. Wiedemann. 1986. Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory 32 1 (1986) 54\u201362.","DOI":"10.1109\/TIT.1986.1057137"}],"event":{"name":"ISSAC '25: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Guanajuato Mexico","acronym":"ISSAC '25"},"container-title":["Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3747199.3747569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:38:47Z","timestamp":1762774727000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3747199.3747569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,28]]},"references-count":27,"alternative-id":["10.1145\/3747199.3747569","10.1145\/3747199"],"URL":"https:\/\/doi.org\/10.1145\/3747199.3747569","relation":{},"subject":[],"published":{"date-parts":[[2025,7,28]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}