{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:21:08Z","timestamp":1648848068450},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1007\/bf01379314","type":"journal-article","created":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T22:56:31Z","timestamp":1112396191000},"page":"39-66","source":"Crossref","is-referenced-by-count":3,"title":["Extended parallelism in the Gr\ufffdbner basis algorithm"],"prefix":"10.1007","volume":"21","author":[{"given":"Stephen A.","family":"Schwab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3849-0","volume-title":"Algebraic Geometry: Graduate Texts in Mathematics","author":"Robin Hartshorne","year":"1977","unstructured":"Robin Hartshorne,Algebraic Geometry: Graduate Texts in Mathematics, Volume 52, Springer-Verlag, New York (1977)."},{"key":"CR2","unstructured":"Bruno Buchberger, An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal (German). PhI) Thesis, University of Innsbruck, (1965)."},{"key":"CR3","unstructured":"Bruno Buchberger, Gr\u00f6bner bases: An Algorithmic Method in Polynomial Ideal Theory, (ed.), N. K. Bose,Recent Trends In Multidimensional Systems Theory, D. Reidel Publishing Company, pp. 184?232, (1985)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0255(89)90037-6","volume":"48","author":"B. Misra","year":"1989","unstructured":"B. Misra and C. Yap, Notes on Gr\u00f6bner Bases,Information Sciences,48:219?252 (August 1989).","journal-title":"Information Sciences"},{"key":"CR5","unstructured":"Jean Philippe Vidal, The Computation of Gr\u00f6bner Bases on a Shared Memory Multiprocessor, Technical Report CMU-CS-90-163, Computer Science Department, Carnegie Mellon University (August 1990)."},{"issue":"2, 3","key":"CR6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0747-7171(88)80048-8","volume":"6","author":"R\u00fcdiger Gebauer","year":"1988","unstructured":"R\u00fcdiger Gebauer and Michael M\u00f6ller, On an Installation of Buchberger's Algorithm,Journal of Symbolic Computation,6(2, 3):275?286 (1988).","journal-title":"Journal of Symbolic Computation"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"Ernst W. Mayr","year":"1982","unstructured":"Ernst W. Mayr and Albert Meyer, The Complexity of the Word Problems for Commutative Semiigroups and Polynomial Ideals,Advances in Mathematics,46:305?329 (1982).","journal-title":"Advances in Mathematics"},{"key":"CR8","unstructured":"Stephen M. Watt, Bounded Parallelism in Computer Algebra, PhD Thesis, University of Waterloo (May 1986)."},{"key":"CR9","unstructured":"Bruno Buchberger, The Parallelization of Critical Pair\/Completion Procedures on theL-Machine,Proc. of the Japanese Symp. on Functional Programming, pp. 54?61 (February 1987)."},{"key":"CR10","volume-title":"Evaluation of ?Performance Enhancements? in Algebraic Manipulation Systems","author":"Carl Glen Ponder","year":"1988","unstructured":"Carl Glen Ponder, Evaluation of ?Performance Enhancements? in Algebraic Manipulation Systems. Ph.D. thesis, University of California, Berkeley (August 1988)."},{"key":"CR11","volume-title":"Computer Algebra and Parallelism, Workshop at the TIM3 Laboratory, University of Grenoble, France","author":"Herbert Melenk","year":"1988","unstructured":"Herbert Melenk and Winfried Neun, Parallel Polynomial Operations in the Large Buchberger Algorithm,Computer Algebra and Parallelism, Workshop at the TIM3 Laboratory, University of Grenoble, France. Academic Press, London (June 1988)."},{"key":"CR12","series-title":"Technical Report RISC-Linz 90-17.0","volume-title":"A Parallel Version of Buchberger's Algorithm in STRAND88","author":"Kurt Siegl","year":"1990","unstructured":"Kurt Siegl, A Parallel Version of Buchberger's Algorithm in STRAND88, Technical Report RISC-Linz 90-17.0, Johannes Kepler University, Linz, Austria (1990)."},{"key":"CR13","first-page":"159","volume-title":"Computer Algebra and Parallelism, Workshop at the TIM3 Laboratory, University of Grenoble, France","author":"Pascale Senechaud","year":"1988","unstructured":"Pascale Senechaud, Implementation of a Parallel Algorithm to Compute a Gr\u00f6bner Basis on Boolean Polynomials,Computer Algebra and Parallelism, Workshop at the TIM3 Laboratory, University of Grenoble, France, Academic Press, London, pp. 159?166 (June 1988)."},{"key":"CR14","unstructured":"Encore Computer Corporation,Multimax Technical Summary (1986)."},{"key":"CR15","unstructured":"IBM.Research Parallel Processor Prototype Principle of Operations."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"R. Bisiani and M. Ravishankar, PLUS: A Distributed Shared-Memory System,Proc. of the 17th Ann. Symp. on Comp. Archit. IEEE Computer Society Press (June 1990).","DOI":"10.1145\/325164.325121"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Eric A. Brewer, Chrysanthos N. Dellarocas, Adrian Colbrook, and William E. Weihl, Proteus: A High-Performance Parallel Architecture Simulator, Technical Report MIT\/LCS\/TR-516, MIT, Laboratory of Computer Science (1991).","DOI":"10.21236\/ADA241343"},{"key":"CR18","series-title":"Technical Report CMU-CS-88-154","volume-title":"C-Threads","author":"E. C. Cooper","year":"1988","unstructured":"E. C. Cooper, C-Threads, Technical Report CMU-CS-88-154, Carnegie Mellon University, Pittsburgh, Pennsylvannia (June 1988)."},{"key":"CR19","unstructured":"R. V. Baron, R. F. Rashid, E. Siegel, A. Tevanian, and M. W. Young, MACH-1:A Multiprocessor Oriented Operating System and Environment,New Computing Environments: Parallel, Vector and Symbolic. SIAM (1986)."},{"key":"CR20","unstructured":"David L. Detlefs, Concurrent, Atomic Garbage Collection. PhD Thesis, Carnegie Mellon University (October 1990)."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/3-540-09519-5_52","volume":"72","author":"Bruno Buchberger","year":"1979","unstructured":"Bruno Buchberger, A Criterion for Detecting Unnecessary Reductions in the Construction of Gr\u00f6bner Bases,Proc. of EUROSAM 79, Lectures Notes in Computer Science,72:3?21 (1979).","journal-title":"Proc. of EUROSAM 79, Lectures Notes in Computer Science"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"A. Giovini, T. Mora, G. Niesi, L. Robbiano, and C. Traverso. ?One Sugar Cube, Please? or Selection Strategies in the Buchberger Algorithm,Proc. of the Int'l. Symp. on Symbolic and Algebraic Computation, ACM, New York, pp. 49?54. (July 1991).","DOI":"10.1145\/120694.120701"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0747-7171(86)80014-1","volume":"1","author":"W. Boege","year":"1986","unstructured":"W. Boege, R. Gebauer, and H. Kredel, Some Examples for Solving Systems of Algebraic Equations by Calculating Groebner Bases,Journal of Symbolic Computation,1:83?98 (1986).","journal-title":"Journal of Symbolic Computation"},{"key":"CR24","unstructured":"24. Sarita V. Adve and Mark D. Hill, Weak Ordering?A New Definition.The 17th Ann. Int'l. Symp. on Comp. Archit. (June 1990)."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L. Lamport","year":"1979","unstructured":"L. Lamport, How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs.IEEE Trans. on Computers,C-28:690?691 (September 1979).","journal-title":"IEEE Trans. on Computers, C"},{"key":"CR26","unstructured":"Kurt Siegl, Gr\u00f6bner Bases Computation in STRAND: A Case Study for Concurrent Symbolic Computation in Logic Programming Languages. PhD Thesis, RISC-LINZ, Johannes Kepler University (November 1990)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01379314.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01379314\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01379314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T16:17:11Z","timestamp":1586189831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01379314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["BF01379314"],"URL":"https:\/\/doi.org\/10.1007\/bf01379314","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}