{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:43Z","timestamp":1750307623044,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"1-2","license":[{"start":{"date-parts":[[2008,7,25]],"date-time":"2008-07-25T00:00:00Z","timestamp":1216944000000},"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":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2008,7,25]]},"abstract":"<jats:p>Irreducible decompositions of monomial ideals are of interest in several areas. We present an incremental algorithm, which computes decompositions of ideals by adding one generator at a time. The new algorithm improves the Alexander dual and Scarf complex methods. A novel feature of the algorithm is that the intermediate storage used never exceeds the output size.<\/jats:p>","DOI":"10.1145\/1394042.1394081","type":"journal-article","created":{"date-parts":[[2008,7,29]],"date-time":"2008-07-29T13:22:19Z","timestamp":1217337739000},"page":"70-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An incremental algorithm for irreducible decompositions of monomial ideals (abstract only)"],"prefix":"10.1145","volume":"42","author":[{"given":"Shuhong","family":"Gao","sequence":"first","affiliation":[{"name":"Clemson University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingfu","family":"Zhu","sequence":"additional","affiliation":[{"name":"Clemson University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,7,25]]},"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1394042.1394081","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:52Z","timestamp":1750250752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1394042.1394081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,25]]},"references-count":0,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2008,7,25]]}},"alternative-id":["10.1145\/1394042.1394081"],"URL":"https:\/\/doi.org\/10.1145\/1394042.1394081","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2008,7,25]]},"assertion":[{"value":"2008-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}