{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:52:13Z","timestamp":1776844333485,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["DMS-0302549CCF-0830481"],"award-info":[{"award-number":["DMS-0302549CCF-0830481"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["H98230-08-1-0030"],"award-info":[{"award-number":["H98230-08-1-0030"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,25]]},"DOI":"10.1145\/1837934.1837944","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"13-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["A new incremental algorithm for computing Groebner bases"],"prefix":"10.1145","author":[{"given":"Shuhong","family":"Gao","sequence":"first","affiliation":[{"name":"Clemson University, Clemson, SC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinhua","family":"Guan","sequence":"additional","affiliation":[{"name":"Clemson University, Clemson, SC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"IV","given":"Frank","family":"Volny","sequence":"additional","affiliation":[{"name":"Clemson University, Clemson, SC"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646670.699008"},{"key":"e_1_3_2_1_3_1","volume-title":"Ed. Bose","author":"Buchberger B.","year":"1985","unstructured":"B. Buchberger , \" Gr\u00f6bner Bases : an Algorithmic Method in Polynomial Ideal Theory,\" In Recent trends in multidimensional system theory , Ed. Bose , 1985 . B. Buchberger, \"Gr\u00f6bner Bases: an Algorithmic Method in Polynomial Ideal Theory,\" In Recent trends in multidimensional system theory, Ed. Bose, 1985."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12678-9_5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756206"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6911-1"},{"key":"e_1_3_2_1_7_1","volume-title":"First International Conference on Symbolic Computation and Cryptography, SCC 2008","author":"Ding J.","unstructured":"J. Ding , J. Buchmann , M. S. E. Mohamed , W. S. A. M. Mohamed , R. Weinmann , \" Mutant XL,\" First International Conference on Symbolic Computation and Cryptography, SCC 2008 J. Ding, J. Buchmann, M. S. E. Mohamed, W. S. A. M. Mohamed, R. Weinmann, \"Mutant XL,\" First International Conference on Symbolic Computation and Cryptography, SCC 2008"},{"key":"e_1_3_2_1_8_1","volume-title":"July","author":"Eder C.","year":"2009","unstructured":"C. Eder and J. Perry , \" F5C: a variant of Faug\u00e8re's F5 algorithm with reduced Gr\u00f6bner bases,\" arXiv: 0906.2967v5 , July 2009 . C. Eder and J. Perry, \"F5C: a variant of Faug\u00e8re's F5 algorithm with reduced Gr\u00f6bner bases,\" arXiv: 0906.2967v5, July 2009."},{"key":"e_1_3_2_1_9_1","volume-title":"no. 1--3, 61--88","author":"Faug\u00e8re J.-C.","year":"1999","unstructured":"J.-C. Faug\u00e8re , \" A new efficient algorithm for computing Gr\u00f6bner bases (F4),\" Effective methods in algebraic geometry ( Saint-Malo , 1998), J. Pure Appl . Algebra 139 ( 1999 ), no. 1--3, 61--88 . J.-C. Faug\u00e8re, \"A new efficient algorithm for computing Gr\u00f6bner bases (F4),\" Effective methods in algebraic geometry (Saint-Malo, 1998), J. Pure Appl. Algebra 139 (1999), no. 1--3, 61--88."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780516"},{"key":"e_1_3_2_1_11_1","volume-title":"A variant of the F4 algorithm,\" preprint","author":"Joux A.","year":"2010","unstructured":"A. Joux and V. Vitse , \" A variant of the F4 algorithm,\" preprint 2010 . http:\/\/eprint.iacr.org\/2010\/158. A. Joux and V. Vitse, \"A variant of the F4 algorithm,\" preprint 2010. http:\/\/eprint.iacr.org\/2010\/158."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2005.07.006"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646657.700393"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s1-35.1.3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1883749.1883759"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88403-3_14"},{"key":"e_1_3_2_1_17_1","volume-title":"A New Proof of the F5 Algorithm,\" preprint","author":"Sun Y.","year":"2009","unstructured":"Y. Sun and D. K. Wang , \" A New Proof of the F5 Algorithm,\" preprint 2009 . http:\/\/www.mmrc.iss.ac.cn\/pub\/mm28.pdf\/06-F5Proof.pdf Y. Sun and D. K. Wang, \"A New Proof of the F5 Algorithm,\" preprint 2009. http:\/\/www.mmrc.iss.ac.cn\/pub\/mm28.pdf\/06-F5Proof.pdf"}],"event":{"name":"ISSAC '10: International Symposium on Symbolic and Algebraic Computation","location":"Munich Germany","acronym":"ISSAC '10","sponsor":["Gesellschaft fur Informtatik","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1837934.1837944","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1837934.1837944","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:43Z","timestamp":1750249423000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1837934.1837944"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":16,"alternative-id":["10.1145\/1837934.1837944","10.1145\/1837934"],"URL":"https:\/\/doi.org\/10.1145\/1837934.1837944","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}