{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T20:45:29Z","timestamp":1775594729848,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T00:00:00Z","timestamp":1690156800000},"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":[[2023,7,24]]},"DOI":"10.1145\/3597066.3597103","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T18:15:27Z","timestamp":1688580927000},"page":"80-89","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Algorithms for Discrete Differential Equations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3798-9281","authenticated-orcid":false,"given":"Alin","family":"Bostan","sequence":"first","affiliation":[{"name":"INRIA, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1485-8968","authenticated-orcid":false,"given":"Hadrien","family":"Notarantonio","sequence":"additional","affiliation":[{"name":"Inria, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9463-1257","authenticated-orcid":false,"given":"Mohab","family":"Safey El Din","sequence":"additional","affiliation":[{"name":"University Pierre and Marie Curie, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"172","volume-title":"Discrete Math. Appl.","author":"Ardila","unstructured":"[1] F.\u00a0Ardila. Algebraic and geometric methods in enumerative combinatorics. In Handbook of enumerative combinatorics, Discrete Math. Appl., pages 3\u2013172. CRC Press, 2015."},{"key":"e_1_3_2_1_2_1","first-page":"80","volume-title":"Basic analytic combinatorics of directed lattice paths","author":"Banderier P.","unstructured":"[2] C.\u00a0Banderier and P.\u00a0Flajolet. Basic analytic combinatorics of directed lattice paths. volume 281, pages 37\u201380. 2002. Selected papers in honour of M. Nivat."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1197095"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90110-X"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480190177650"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-008-0334-5"},{"key":"e_1_3_2_1_7_1","first-page":"58","volume-title":"ISSAC\u201921","author":"Berthomieu C.","unstructured":"[7] J.\u00a0Berthomieu, C.\u00a0Eder, and M.\u00a0Safey El\u00a0Din. msolve: a library for solving polynomial systems. In ISSAC\u201921, pages 51\u201358. ACM, 2021."},{"key":"e_1_3_2_1_8_1","first-page":"110","volume-title":"ISSAC\u201922","author":"Bostan F.","unstructured":"[8] A.\u00a0Bostan, F.\u00a0Chyzak, H.\u00a0Notarantonio, and M.\u00a0Safey El\u00a0Din. Algorithms for discrete differential equations of order 1. In ISSAC\u201922, pages 101\u2013110. ACM, 2022."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.014"},{"key":"e_1_3_2_1_10_1","first-page":"26","article-title":"The number of intervals in the m-Tamari lattices. Electron. J. Combin., 18(2)","volume":"31","author":"Bousquet-M\u00e9lou E.","year":"2012","unstructured":"[10] M.\u00a0Bousquet-M\u00e9lou, E.\u00a0Fusy, and L.-F. Pr\u00e9ville-Ratelle. The number of intervals in the m-Tamari lattices. Electron. J. Combin., 18(2):Paper 31, 26, 2012.","journal-title":"Paper"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.12.003"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00147-3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/aama.1999.0673"},{"key":"e_1_3_2_1_14_1","series-title":"Leibniz Int","first-page":"14","volume-title":"AofA\u201920","author":"Bousquet-M\u00e9lou M.","year":"2020","unstructured":"[14] M.\u00a0Bousquet-M\u00e9lou and M.\u00a0Wallner. More Models of Walks Avoiding a Quadrant. In AofA\u201920, volume 159 of Leibniz Int. Proc. Inform. (LIPIcs), pages 8:1\u20138:14, 2020."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-14.4.746"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-030-1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01370732"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00229-018-1025-0"},{"key":"e_1_3_2_1_19_1","volume-title":"Springer","author":"Cox","year":"2021","unstructured":"[19] D.\u00a0A. Cox. Stickelberger and the eigenvalue theorem. In Commutative algebra, pages 283\u2013298. Springer, 2021."},{"key":"e_1_3_2_1_20_1","volume-title":"varieties, and algorithms. Undergraduate Texts in Mathematics","author":"Cox J.","year":"2015","unstructured":"[20] D.\u00a0A. Cox, J.\u00a0Little, and D.\u00a0O\u2019Shea. Ideals, varieties, and algorithms. Undergraduate Texts in Mathematics. Springer, fourth edition, 2015. An introduction to computational algebraic geometry and commutative algebra."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/251040.251049"},{"key":"e_1_3_2_1_22_1","unstructured":"[22] R.\u00a0Duan H.\u00a0Wu and R.\u00a0Zhou. Faster matrix multiplication via asymmetric hashing 2022. Technical Report 2210.10173 arXiv."},{"key":"e_1_3_2_1_23_1","first-page":"178","volume-title":"ISSAC\u201912","author":"Faug\u00e8re J.","unstructured":"[23] J.-C. Faug\u00e8re and J.\u00a0Svartz. Solving polynomial systems globally invariant under an action of the symmetric group and application to the equilibria of N vortices in the plane. In ISSAC\u201912, pages 170\u2013178. ACM, 2012."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065"},{"key":"e_1_3_2_1_26_1","first-page":"142","volume-title":"ISSAC\u201903","author":"Giorgi C.","unstructured":"[26] P.\u00a0Giorgi, C.-P. Jeannerod, and G.\u00a0Villard. On the complexity of polynomial matrix computations. In ISSAC\u201903, pages 135\u2013142. ACM, 2003."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90002-6"},{"key":"e_1_3_2_1_28_1","first-page":"242","volume-title":"ISSAC\u201919","author":"Hyun V.","unstructured":"[28] S.\u00a0G. Hyun, V.\u00a0Neiger, and \u00c9.\u00a0Schost. Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants. In ISSAC\u201919, pages 235\u2013242. ACM, 2019."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1997.0113"},{"key":"e_1_3_2_1_30_1","volume-title":"Fundamental algorithms. Second printing","author":"Knuth","year":"1968","unstructured":"[30] D.\u00a0E. Knuth. The art of computer programming. Vol. 1: Fundamental algorithms. Second printing. Addison-Wesley, Reading, MA, 1968."},{"key":"e_1_3_2_1_31_1","unstructured":"[31] H.\u00a0Notarantonio and S.\u00a0Yurkevich. Effective algebraicity for solutions of systems of functional equations with one catalytic variable. In FPSAC\u201923 to appear."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0027763000022698"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996450"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/178365.178368"},{"key":"e_1_3_2_1_35_1","first-page":"395","volume-title":"Discrete Math. Appl.","author":"Schaeffer","unstructured":"[35] G.\u00a0Schaeffer. Planar maps. In Handbook of enumerative combinatorics, Discrete Math. Appl., pages 335\u2013395. CRC Press, 2015."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-002-0109-x"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609589"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1968-11877-4"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90351-F"},{"key":"e_1_3_2_1_40_1","first-page":"463","volume-title":"The umbral transfer-matrix method. I. Foundations. volume\u00a091","author":"Zeilberger","unstructured":"[40] D.\u00a0Zeilberger. The umbral transfer-matrix method. I. Foundations. volume\u00a091, pages 451\u2013463. 2000. In memory of Gian-Carlo Rota."}],"event":{"name":"ISSAC 2023: International Symposium on Symbolic and Algebraic Computation 2023","location":"Troms\u00f8 Norway","acronym":"ISSAC 2023"},"container-title":["Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597066.3597103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597066.3597103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T09:37:05Z","timestamp":1755855425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597066.3597103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,24]]},"references-count":40,"alternative-id":["10.1145\/3597066.3597103","10.1145\/3597066"],"URL":"https:\/\/doi.org\/10.1145\/3597066.3597103","relation":{},"subject":[],"published":{"date-parts":[[2023,7,24]]},"assertion":[{"value":"2023-07-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}