{"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":1776844333495,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T00:00:00Z","timestamp":1372204800000},"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":[[2013,6,26]]},"DOI":"10.1145\/2465506.2465522","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"331-338","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Signature rewriting in gr\u00f6bner basis computation"],"prefix":"10.1145","author":[{"given":"Christian","family":"Eder","sequence":"first","affiliation":[{"name":"INRIA, Paris-Rocquencourt Center, Paris, France"}]},{"given":"Bjarke Hammersholt","family":"Roune","sequence":"additional","affiliation":[{"name":"University of Kaiserslautern, Kaiserslautern, Germany"}]}],"member":"320","published-online":{"date-parts":[[2013,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"F4\/5","author":"Albrecht M.","year":"2010","unstructured":"Albrecht , M. and Perry , J . F4\/5 . 2010 . http:\/\/arxiv.org\/abs\/1006.4933. Albrecht, M. and Perry, J. F4\/5. 2010. http:\/\/arxiv.org\/abs\/1006.4933."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.05.004"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993906"},{"key":"e_1_3_2_1_4_1","author":"Faug\u00e8re J.-C.","year":"1999","unstructured":"Faug\u00e8re , J.-C. A new efficient algorithm for computing Gr\u00f6bner bases (F4). Journal of Pure and Applied Algebra, 139(1--3):61--88 , June 1999 . Faug\u00e8re, J.-C. A new efficient algorithm for computing Gr\u00f6bner bases (F4). Journal of Pure and Applied Algebra, 139(1--3):61--88, June 1999.","journal-title":"Journal of Pure and Applied Algebra, 139(1--3):61--88"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780516"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780516"},{"key":"e_1_3_2_1_7_1","unstructured":"Galkin V. Termination of original F5. http:\/\/arxiv.org\/abs\/1203.2402 2012.  Galkin V. Termination of original F5. http:\/\/arxiv.org\/abs\/1203.2402 2012."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Gao S. Volny IV F. and Wang D. A new algorithm for computing Groebner bases. http:\/\/eprint.iacr.org\/2010\/641 2010.  Gao S. Volny IV F. and Wang D. A new algorithm for computing Groebner bases. http:\/\/eprint.iacr.org\/2010\/641 2010.","DOI":"10.1145\/1837934.1837944"},{"key":"e_1_3_2_1_9_1","volume-title":"The Termination of Algorithms for Computing Gr\u00f6bner Bases","author":"Pan S.","year":"2012","unstructured":"Pan , S. , Hu , Y. , and Wang , B . The Termination of Algorithms for Computing Gr\u00f6bner Bases . 2012 . http:\/\/arxiv.org\/abs\/1202.3524. Pan, S., Hu, Y., and Wang, B. The Termination of Algorithms for Computing Gr\u00f6bner Bases. 2012. http:\/\/arxiv.org\/abs\/1202.3524."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442860"},{"key":"e_1_3_2_1_11_1","unstructured":"Roune B. H. and Stillman M. Practical signature Gr\u00f6bner basis computation. In preparation.  Roune B. H. and Stillman M. Practical signature Gr\u00f6bner basis computation. In preparation."}],"event":{"name":"ISSAC'13: International Symposium on Symbolic and Algebraic Computation","location":"Boston Maine USA","acronym":"ISSAC'13","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465506.2465522","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2465506.2465522","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:35Z","timestamp":1750234715000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465506.2465522"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,26]]},"references-count":11,"alternative-id":["10.1145\/2465506.2465522","10.1145\/2465506"],"URL":"https:\/\/doi.org\/10.1145\/2465506.2465522","relation":{},"subject":[],"published":{"date-parts":[[2013,6,26]]},"assertion":[{"value":"2013-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}