{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T07:56:14Z","timestamp":1725436574332},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icppw.2004.1328011","type":"proceedings-article","created":{"date-parts":[[2005,4,5]],"date-time":"2005-04-05T18:48:50Z","timestamp":1112726930000},"page":"160-164","source":"Crossref","is-referenced-by-count":1,"title":["On parallel computation of grobner bases"],"prefix":"10.1109","author":[{"given":"A.","family":"Leykin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"75","article-title":"A new efficient algorithm for computing Gr&#x00F6;bner bases without reduction to zero (F5)","author":"faug\u00e8re","year":"2002","journal-title":"Proceedings of IS-SAC 2002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01018692"},{"key":"ref10","article-title":"Parallel computation of boolean Gr&#x00F6;bner bases","author":"sato","year":"1999","journal-title":"Electronic Proceedings of ATCM 1999"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/120694.120701"},{"key":"ref11","article-title":"A Parallel Factorization Tree Gr&#x00F6;bner Basis Algorithm","author":"siegl","year":"1994","journal-title":"Technical Report 94-51"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80048-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2003.07.005"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80003-X"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7056.001.0001","author":"gropp","year":"1999","journal-title":"Using MPI"},{"journal-title":"Remarques sur l'ideal de Bernstein associ&#x00E9; &#x00E0; des polynomes","year":"0","author":"brian\u00e7on","key":"ref2"},{"key":"ref9","first-page":"269","article-title":"A fine-grained parallel completion procedure","author":"reinhard","year":"1994","journal-title":"ISSAC 1994"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0022"}],"event":{"name":"Workshops on Mobile and Wireless Networking\/High Performance Scientific, Engineering Computing\/Network Design and Architecture\/Optical Networks Control and Management\/Ad Hoc and Sensor Networks\/Compile and Run Time Techniques for Parallel Computing ICPP 2004","location":"Montreal, QC, Canada"},"container-title":["Workshops on Mobile and Wireless Networking\/High Performance Scientific, Engineering Computing\/Network Design and Architecture\/Optical Networks Control and Management\/Ad Hoc and Sensor Networks\/Compile and Run Time Techniques for Parallel Computing ICPP 2004"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9249\/29348\/01328011.pdf?arnumber=1328011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T23:32:39Z","timestamp":1549755159000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1328011\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/icppw.2004.1328011","relation":{},"subject":[]}}