{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:23:24Z","timestamp":1743074604041,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664437"},{"type":"electronic","value":"9783540483113"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48311-x_212","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:16:48Z","timestamp":1269897408000},"page":"1492-1495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Parallel Symbolic Computation Environment: Structures and Mechanics"],"prefix":"10.1007","author":[{"given":"\u2019Mant\u015dika","family":"Matooane","sequence":"first","affiliation":[]},{"given":"Arthur","family":"Norman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,8,6]]},"reference":[{"key":"212_CR1","unstructured":"Dinda, P.A., Garcia, B.M., and Leung, D.-S. The measured network traffic of compiler-parallelized programs. Tech. rep., Carnegie Mellon University School of Computer Science, 1998. Techincal Report CMU-CS-98-144."},{"key":"212_CR2","unstructured":"Geist, G., Kohl, J., and Papadopoulos, P. Pvm vs mpi: A comparison of features. In Calculateurs Paralleles (1996)."},{"key":"212_CR3","doi-asserted-by":"crossref","unstructured":"Gustavson, F., and Yun, D.Y.Y. Arithmetic complexity of unordered sparse polynomials. In SYMSAC\u201976 (August 1976), R.D. Jenks, Ed., SIGSAM, ACM, pp. 149\u2013153.","DOI":"10.1145\/800205.806333"},{"key":"212_CR4","unstructured":"Hitachi Ltd. A tutorial for parallel programming, 1995."},{"key":"212_CR5","volume-title":"Introduction to Parallel Computing:Design and Analysis of Algorithms","author":"V. Kumar","year":"1994","unstructured":"Kumar, V., Grama, A., Gupta, A., and Karypis, G. Introduction to Parallel Computing:Design and Analysis of Algorithms. Benjamin\/Cummings Publishing Company, Inc., Redwood City, California, 1994."},{"key":"212_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5232.001.0001","volume-title":"Parallel Algorithms for Regular Architectures: Meshes and Pyramids","author":"R. Miller","year":"1996","unstructured":"Miller, R., and Stout, Q.F. Parallel Algorithms for Regular Architectures: Meshes and Pyramids. The MIT Press, Cambridge, Massachusetts, 1996."},{"key":"212_CR7","doi-asserted-by":"crossref","unstructured":"Norman, A., and Fitch, J. Cabal: Polynomial and power series algebra on a parallel computer. In Proceedings of PASCO 1997 (1997).","DOI":"10.1145\/266670.266729"},{"key":"212_CR8","volume-title":"Parallel Programming with MPI","author":"P.S. Pacheco","year":"1997","unstructured":"Pacheco, P.S. Parallel Programming with MPI. Morgan Kaufmann Publishers, Inc., San Francisco, California, 1997."},{"key":"212_CR9","unstructured":"Sasaki, T., and Kanada, Y. Parallelism in algebraic computaion and parallel algorithms for symbolic linear systems. In Proceedings of 1981 ACM Symposium on Symbolic and Algebraic Computation (1981), P.S. Wang, Ed., pp. 160\u2013167."},{"key":"212_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-09519-5_61","volume-title":"Proceedings of International Symposium on Symbolic and Algebraic Manipulation","author":"J. Smit","year":"1979","unstructured":"Smit, J. New recursive minor expansion algorithms: A presentation in a comparative context. In Proceedings of International Symposium on Symbolic and Algebraic Manipulation (1979), E.W. Ng, Ed., Lecture Notes in Computer Science 72, Springer-Verlag, pp. 74\u201387."},{"key":"212_CR11","doi-asserted-by":"crossref","unstructured":"Smit, J. A cancellation free algorithm, with factoring capabilities, for the efficient solution of large sets of equations. In Proceedings of the 1981 ACM Symposium on Symbolic and Algebraic Computation (1981), P.S. Wang, Ed.","DOI":"10.1145\/800206.806386"},{"key":"212_CR12","volume-title":"MPI:The Complete Reference","author":"M. Snir","year":"1996","unstructured":"Snir, M., Otto, S.W., Huss-lederman, S., Walker, D.W., and Don-garra, J. MPI:The Complete Reference. The MIT Press, Cambridge, Massachusetts, 1996."},{"key":"212_CR13","unstructured":"Tobey, R. Experience with formac algorithm design. In Communications of the ACM (1966), pp. 589\u2013597."}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201999 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48311-X_212","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T19:22:15Z","timestamp":1739992935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48311-X_212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664437","9783540483113"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48311-x_212","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"6 August 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}