{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T01:28:24Z","timestamp":1786584504632,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T00:00:00Z","timestamp":1783814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,13]]},"DOI":"10.1145\/3815436.3815473","type":"proceedings-article","created":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:11:51Z","timestamp":1783613511000},"page":"246-255","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Data Structure for Monomial Ideals with Applications to Signature Gr\u00f6bner Bases"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3756-0151","authenticated-orcid":false,"given":"Pierre","family":"Lairez","sequence":"first","affiliation":[{"name":"INRIA, Saclay, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9869-7122","authenticated-orcid":false,"given":"Rafael","family":"Mohr","sequence":"additional","affiliation":[{"name":"Dep. of Computer Science, KU Leuven, Leuven, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7508-2863","authenticated-orcid":false,"given":"Th\u00e9o","family":"Ternier","sequence":"additional","affiliation":[{"name":"INRIA, Saclay, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,12]]},"reference":[{"key":"e_1_3_3_2_2_2","volume-title":"Handbook of Discrete and Computational Geometry (3 ed.)","author":"Agarwal Pankaj\u00a0K.","year":"2017","unstructured":"Pankaj\u00a0K. Agarwal. 2017. Range Searching. In Handbook of Discrete and Computational Geometry (3 ed.). Chapman and Hall\/CRC."},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"crossref","unstructured":"Jon\u00a0Louis Bentley. 1979. Decomposable Searching Problems. Inf. Process. Lett. 8 5 (1979) 244\u2013251. https:\/\/doi.org\/10\/bhpbfk","DOI":"10.1016\/0020-0190(79)90117-0"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"crossref","unstructured":"J\u00e9r\u00e9my Berthomieu Christian Eder and Mohab Safey El\u00a0Din. 2021. Examples for Msolve. https:\/\/msolve.lip6.fr\/examples\/index.html","DOI":"10.1145\/3452143.3465545"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3452143.3465545"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"crossref","unstructured":"J.\u00a0Lawrence Carter and Mark\u00a0N. Wegman. 1979. Universal Classes of Hash Functions. J. Comput. System Sci. 18 2 (1979) 143\u2013154. https:\/\/doi.org\/10\/dbprb6","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.5555\/1614191"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.5555\/2821082"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/160985.161138"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"crossref","unstructured":"Christian Eder and Jean-Charles Faug\u00e8re. 2017. A Survey on Signature-Based Algorithms for Computing Gr\u00f6bner Bases. J. Symb. Comput. 80 3 (2017) 719\u2013784. https:\/\/doi.org\/10\/ggck7f","DOI":"10.1016\/j.jsc.2016.07.031"},{"key":"e_1_3_3_2_11_2","first-page":"331","volume-title":"Proc. ISSAC 2013","author":"Eder Christian","year":"2013","unstructured":"Christian Eder and Bjarke\u00a0Hammersholt Roune. 2013. Signature Rewriting in Gr\u00f6bner Basis Computation. In Proc. ISSAC 2013. ACM, 331\u2013338. https:\/\/doi.org\/10\/ggkppx"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Jean-Charles Faug\u00e8re. 1999. A new efficient algorithm for computing Gr\u00f6bner bases (F4). J. Pure Appl. Algebra 139 1-3 (1999) 61\u201388. https:\/\/doi.org\/10\/bpq5dx","DOI":"10.1016\/S0022-4049(99)00005-5"},{"key":"e_1_3_3_2_13_2","first-page":"75","volume-title":"Proc. ISSAC 2002","author":"Faug\u00e8re Jean-Charles","year":"2002","unstructured":"Jean-Charles Faug\u00e8re. 2002. A New Efficient Algorithm for Computing Gr\u00f6bner Bases without Reduction to Zero (F5). In Proc. ISSAC 2002. ACM, 75\u201383. https:\/\/doi.org\/10\/bd4nnq"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/1159876.1159880"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"crossref","unstructured":"Shuhong Gao Frank Volny and Mingsheng Wang. 2016. A New Framework for Computing Gr\u00f6bner Bases. Math. Comp. 85 297 (2016) 449\u2013465. https:\/\/doi.org\/10\/f7t889","DOI":"10.1090\/mcom\/2969"},{"key":"e_1_3_3_2_16_2","unstructured":"Shuhong Gao and Mingfu Zhu. 2008. Computing Irreducible Decomposition of Monomial Ideals. arXiv:https:\/\/arXiv.org\/abs\/0811.3425https:\/\/doi.org\/10\/hbdj7g"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/11555964_15"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56666-0_18"},{"key":"e_1_3_3_2_19_2","volume-title":"Monocopy and Associative Algorithms in Extended LISP","author":"Goto Eiichi","year":"1974","unstructured":"Eiichi Goto. 1974. Monocopy and Associative Algorithms in Extended LISP. Technical Report TR-74-03. University of Toyko."},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0346-0329-4_2"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"crossref","unstructured":"Amir Hashemi Matthias Orth and Werner\u00a0M. Seiler. 2022. Complementary Decompositions of Monomial Ideals and Involutive Bases. Appl. Algebra Eng. Commun. Comput. 33 6 (2022) 791\u2013821. https:\/\/doi.org\/10\/hbdj7h","DOI":"10.1007\/s00200-022-00569-0"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Amir Hashemi Matthias Orth and Werner\u00a0M. Seiler. 2023. Recursive Structures in Involutive Bases Theory. J. Symb. Comput. 118 (2023) 32\u201368. https:\/\/doi.org\/10\/hbdj7j","DOI":"10.1016\/j.jsc.2023.01.003"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.5555\/1984890"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"crossref","unstructured":"Pierre Lairez. 2024. Axioms for a Theory of Signature Bases. J. Symb. Comput. 123 (2024) 102275. https:\/\/doi.org\/10\/k99k","DOI":"10.1016\/j.jsc.2023.102275"},{"key":"e_1_3_3_2_25_2","unstructured":"Peter\u00a0N. Malkin. 2007. Computing Markov Bases Gr\u00f6bner Bases and Extreme Rays. Ph.\u00a0D. Dissertation. Universit\u00e9 catholique de Louvain."},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005320"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"crossref","unstructured":"Guillermo Moreno-Soc\u00edas. 2003. Degrevlex Gr\u00f6bner Bases of Generic Complete Intersections. J. Pure Appl. Algebra 180 3 (2003) 263\u2013283. https:\/\/doi.org\/10\/fvbj64","DOI":"10.1016\/S0022-4049(02)00297-9"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"crossref","unstructured":"Bjarke\u00a0Hammersholt Roune. 2009. The Slice Algorithm for Irreducible Decomposition of Monomial Ideals. J. Symb. Comput. 44 4 (2009) 358\u2013381. https:\/\/doi.org\/10\/fpqfwv","DOI":"10.1016\/j.jsc.2008.08.002"},{"key":"e_1_3_3_2_29_2","unstructured":"Bjarke\u00a0Hammersholt Roune and Michael Stillman. 2012. Practical Groebner Basis Computation. arXiv:https:\/\/arXiv.org\/abs\/1206.6940http:\/\/arxiv.org\/abs\/1206.6940"},{"key":"e_1_3_3_2_30_2","first-page":"203","volume-title":"Proc. ISSAC 2012","author":"Roune Bjarke\u00a0Hammersholt","year":"2012","unstructured":"Bjarke\u00a0Hammersholt Roune and Michael Stillman. 2012. Practical Gr\u00f6bner Basis Computation. In Proc. ISSAC 2012. ACM, 203\u2013210. https:\/\/doi.org\/10\/ggkpqd"}],"event":{"name":"ISSAC '26: 51st International Symposium on Symbolic and Algebraic Computation","location":"Oldenburg , Germany","acronym":"ISSAC '26"},"container-title":["Proceedings of the 2026 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3815436.3815473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T01:02:57Z","timestamp":1786582977000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3815436.3815473"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,12]]},"references-count":29,"alternative-id":["10.1145\/3815436.3815473","10.1145\/3815436"],"URL":"https:\/\/doi.org\/10.1145\/3815436.3815473","relation":{},"subject":[],"published":{"date-parts":[[2026,7,12]]},"assertion":[{"value":"2026-07-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}