{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:59:17Z","timestamp":1760061557410},"publisher-location":"Berlin\/Heidelberg","reference-count":22,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354013350X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032842","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:41:26Z","timestamp":1133430086000},"page":"195-206","source":"Crossref","is-referenced-by-count":14,"title":["Algorithms for computing Gr\u00f6bner bases of polynomial ideals over various Euclidean rings"],"prefix":"10.1007","author":[{"given":"Abdelilah","family":"Kandri-Rody","sequence":"first","affiliation":[]},{"given":"Deepak","family":"Kapur","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/1089235.1089238","volume":"14","author":"L. Bachmair","year":"1980","unstructured":"Bachmair, L., and Buchberger, B., \u201cA Simplified Proof of the Characterization Theorem for Gr\u00f6bner-Bases,\u201d ACM-SIGSAM Bulletin, 14\/4, 1980, pp. 29\u201334.","journal-title":"ACM-SIGSAM Bulletin"},{"key":"19_CR2","first-page":"19","volume":"39","author":"B. Buchberger","year":"1976","unstructured":"Buchberger, B., \u201cA Theoretical Basis for the Reduction of Polynomials to Canonical Forms,\u201d ACM-SIGSAM Bulletin, 39, August 1976, pp. 19\u201329.","journal-title":"ACM-SIGSAM Bulletin"},{"key":"19_CR3","first-page":"3","volume":"72","author":"B. Buchberger","year":"1979","unstructured":"Buchberger, B., \u201cA Criterion for Detecting Unnecessary Reductions in the Construction of Gr\u00f6bner-Bases,\u201d Proceedings of EUROSAM 79, Marseille, Springer Verlag Lecture Notes in Computer Science, Vol. 72, 1979, pp. 3\u201321.","journal-title":"Proceedings of EUROSAM 79"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-7091-3406-1_2","volume-title":"Computer Algebra: Symbolic and Algebraic Computation","author":"B. Buchberger","year":"1982","unstructured":"Buchberger, B. and Loos, R., \u201cAlgebraic Simplification,\u201d Computer Algebra: Symbolic and Algebraic Computation (B. Buchberger, G.E. Collins, and R. Loos, eds.), Computing Suppl. 4, Springer Verlag, New York, 1982, pp. 11\u201343."},{"issue":"4","key":"19_CR5","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G., \u201cConfluent Reductions: Abstract Properties and Applications to Term Rewriting Systems,\u201d JACM, Vol. 27, No. 4, October 1980, pp. 797\u2013821.","journal-title":"JACM"},{"issue":"1","key":"19_CR6","first-page":"11","volume":"23","author":"G. Huet","year":"1981","unstructured":"Huet, G., \u201cA Complete Proof of Correctness of the Knuth-Bendix Completion Procedure,\u201d JCSS, Vol. 23, No. 1, August 1981, pp. 11\u201321.","journal-title":"JCSS"},{"key":"19_CR7","volume-title":"Topics in Theorem Proving and Program Synthesis","author":"J. Hsiang","year":"1983","unstructured":"Hsiang, J., Topics in Theorem Proving and Program Synthesis, Ph.D. Thesis, University of Illinois, Urbana-Champagne, July 1983."},{"key":"19_CR8","volume-title":"Effective Problems in the Theory of Polynomial Ideals","author":"A. Kandri-Rody","year":"1984","unstructured":"Kandri-Rody, A., Effective Problems in the Theory of Polynomial Ideals, Forthcoming Ph.D. Thesis, RPI, Troy, NY, May 1984."},{"key":"19_CR9","series-title":"TIS Report","volume-title":"On Relationship between Buchberger's Gr\u00f6bner Basis Algorithm and the Knuth-Bendix Completion Procedure","author":"A. Kandri-Rody","year":"1983","unstructured":"Kandri-Rody, A. and Kapur, D., \u201cOn Relationship between Buchberger's Gr\u00f6bner Basis Algorithm and the Knuth-Bendix Completion Procedure,\u201d TIS Report No. 83CRD286, General Electric Research and Development Center, Schenectady, NY, December 1983."},{"key":"19_CR10","unstructured":"Kandri-Rody, A. and Kapur, D., \u201cComputing the Gr\u00f6bner Basis of Polynomial Ideals over Integers,\u201d to appear in Third MACSYMA User's Conference, Schenectady, NY, July 1984."},{"key":"19_CR11","unstructured":"Kandri-Rody, A. and Saunders, B.D., \u201cPrimality of Ideals in Polynomial Rings,\u201d to appear in Third MACSYMA User's Conference, Schenectady, NY, July 1984."},{"key":"19_CR12","unstructured":"Kapur, D. and Narendran, P., \u201cThe Knuth-Bendix Completion Procedure and Thue Systems,\u201d Third Conference on Foundation of Computer Science and Software Engg., Bangalore, India, December 1983, pp. 363\u2013385."},{"key":"19_CR13","unstructured":"Kapur, D. and Sivakumar, G., \u201cArchitecture of and Experiments with RRL, a Rewrite Rule Laboratory,\u201d Proceedings of the NSF Workshop on Rewrite Rule Laboratory, Rensselaerville, NY, September 4\u20136, 1983."},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Knuth, D.E. and Bendix, P.B., \u201cSimple Word Problems in Universal Algebras,\u201d Computational Problems in Abstract Algebras (J. Leech, ed.), Pergamon Press, 1970, pp. 263\u2013297.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"19_CR15","unstructured":"Lankford, D.S. and Ballantyne, A.M., Private Communication, December 1983."},{"key":"19_CR16","unstructured":"Lankford, D.S. and Butler, G., \u201cExperiments with Computer Implementations of Procedures which often Derive Decision Algorithms for the Word Problem in Abstract Algebra,\u201d Technical Report, MTP-7, Louisiana Tech. University, August 1980."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Lauer, M., \u201cCanonical Representatives for Residue Classes of a Polynomial Ideal,\u201d SYMSAC, 1976, pp. 339\u2013345.","DOI":"10.1145\/800205.806353"},{"key":"19_CR18","volume-title":"Algebra of Polynomials","author":"H. Lausch","year":"1973","unstructured":"Lausch, H., and Nobaurer, W., Algebra of Polynomials, North-Holland, Amsterdam, 1973."},{"key":"19_CR19","volume-title":"Algorithmic Aspects of Polynomial Residue Class Rings","author":"S. Schaller","year":"1979","unstructured":"Schaller, S., Algorithmic Aspects of Polynomial Residue Class Rings, Ph.D. Thesis, Computer Science Tech., University of Wisconsin, Madison, Rep. 370, 1979."},{"issue":"6","key":"19_CR20","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1080\/00029890.1952.11988146","volume":"59","author":"G. Szekeres","year":"1952","unstructured":"Szekeres, G., \u201cA Canonical Basis for the Ideals of a Polynomial Domain,\u201d American Mathematical Monthly, Vol. 59, No. 6, 1952, pp. 379\u2013386.","journal-title":"American Mathematical Monthly"},{"key":"19_CR21","volume-title":"Modern Algebra, Vols. I and II","author":"B.L. Waerden van der","year":"1966","unstructured":"van der Waerden, B.L., Modern Algebra, Vols. I and II, Fredrick Ungar Publishing Co., New York, 1966."},{"key":"19_CR22","unstructured":"Zacharias, G., Generalized Gr\u00f6bner Bases in Commutative Polynomial Rings, Bachelor Thesis, Lab. for Computer Science, MIT, 1978."}],"container-title":["Lecture Notes in Computer Science","EUROSAM 84"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:35:00Z","timestamp":1586594100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354013350X"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0032842","relation":{},"subject":[]}}