{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:28:58Z","timestamp":1759332538845},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540183174"},{"type":"electronic","value":"9783540478799"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18317-5_9","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:33:13Z","timestamp":1330198393000},"page":"134-153","source":"Crossref","is-referenced-by-count":5,"title":["Matrix algebra and applicative programming"],"prefix":"10.1007","author":[{"given":"David S.","family":"Wise","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(85)90170-7","volume":"40","author":"S. K. Abdali","year":"1985","unstructured":"S. K. Abdali. & D. D. Saunders. Transitive closure and related semiring properties via eliminants. Theoretical Computer Science 40, 2,3 (1985), 257\u2013274.","journal-title":"Theoretical Computer Science"},{"issue":"12","key":"9_CR2","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1145\/7902.315708","volume":"29","author":"P. J. Denning","year":"1986","unstructured":"P. J. Denning Parallel computing and its evolution. Comm. ACM 29, 12 (December, 1986), 1163\u20131167.","journal-title":"Comm. ACM"},{"issue":"4","key":"9_CR3","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/PROC.1977.10514","volume":"65","author":"I. S. Duff","year":"1977","unstructured":"I. S. Duff. A survey of sparse matrix research. Proc. IEEE 65, 4 (April, 1977), 500\u2013535.","journal-title":"Proc. IEEE"},{"issue":"7","key":"9_CR4","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/359131.359134","volume":"22","author":"P. C. Fischer","year":"1979","unstructured":"P. C. Fischer & R. L. Probert. Storage reorganization techniques for matrix computation in a paging environment. Comm. ACM 22, 7 (July, 1979), 405\u2013415.","journal-title":"Comm. ACM"},{"issue":"4","key":"9_CR5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/TC.1978.1675100","volume":"C-27","author":"D. P. Friedman","year":"1978","unstructured":"D. P. Friedman & D. S. Wise. Aspects of applicative programming for parallel processing. IEEE Trans. Comput. C-27, 4 (April, 1978), 289\u2013296.","journal-title":"IEEE Trans. Comput."},{"key":"9_CR6","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A. George","year":"1981","unstructured":"A. George & J. W-H Liu. Computer Solution of Large Sparse Positive Definite Systems, Englewood Cliffs, NJ, Prentice-Hall (1981), Chapter 8."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"P. Hudak. Arrays, non-determinism, side-effects, and parallelism: a functional perspective (Extended Abstract). Proc. LANL\/MCC Graph Reduction Workshop Sante Fe, September, 1986, Lecture Notes in Computer Science, New York, Springer (to appear).","DOI":"10.1007\/3-540-18420-1_63"},{"key":"9_CR8","unstructured":"S. D. Johnson. \u201cStorage Allocation for List Multiprocessing\u201d, Indiana University Computer Science Dept. Technical Report No. 168, (March, 1985)."},{"key":"9_CR9","volume-title":"Synthesis of Digital Designs from Recursion Equations","author":"S. D. Johnson","year":"1984","unstructured":"S. D. Johnson. Synthesis of Digital Designs from Recursion Equations, Cambridge, MA, M.I.T. Press (1984)."},{"key":"9_CR10","first-page":"299","volume-title":"The Art of Computer Programming, I, Fundamental Algorithms","author":"D. E. Knuth","year":"1975","unstructured":"D. E. Knuth. The Art of Computer Programming, I, Fundamental Algorithms, 2nd Ed., Reading, MA, Addison-Wesley (1975), 299\u2013318 + 401, 556.","edition":"2nd Ed."},{"issue":"3","key":"9_CR11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/362875.362879","volume":"12","author":"A. C. McKellar","year":"1969","unstructured":"A. C. McKellar & E. G. Coffman, Jr. Organizing matrices and matrix operations for paged memory systems. Comm. ACM 12, 3 (March, 1969), 153\u2013165.","journal-title":"Comm. ACM"},{"key":"9_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-81897-4","volume-title":"Fast Fourier Transforms and Convolution Algorithms","author":"H. J. Nussbaumber","year":"1982","unstructured":"H. J. Nussbaumber. Fast Fourier Transforms and Convolution Algorithms, Berlin, Springer (1982)."},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/3-540-15975-4_36","volume-title":"Functional Programming Languages and Computer Architecture","author":"J. T. O'Donnell","year":"1985","unstructured":"J. T. O'Donnell. An architecture that efficiently updates associative aggregates in applicative programming languages. In Jean-Pierre Jouannaud (ed.), Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science 201, Berlin, Springer (1985), 164\u2013189."},{"issue":"1","key":"9_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0167-8191(84)90446-0","volume":"1","author":"F. J. Peters","year":"1984","unstructured":"F. J. Peters. Parallel pivoting algorithms for sparse symmetric matrices. Parallel Computing 1, 1 (August, 1984), 99\u2013110.","journal-title":"Parallel Computing"},{"issue":"2","key":"9_CR15","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/321450.321457","volume":"15","author":"M. C. Pease","year":"1968","unstructured":"M. C. Pease. An adaptation of the fast Fourier transform for parallel processing. J. ACM 15, 2 (April, 1968), 252\u2013264.","journal-title":"J. ACM"},{"issue":"12","key":"9_CR16","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1145\/7902.7905","volume":"29","author":"R. Rettberg","year":"1986","unstructured":"R. Rettberg & R. Thomas. Contention is no obstacle to shared-memory multiprocessing. Comm. ACM 29, 12 (December, 1986), 1202\u20131212.","journal-title":"Comm. ACM"},{"issue":"4","key":"9_CR17","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"V. Strassen. Gaussian elimination is not optimal. Numer. Math. 13, 4 (August, 1969), 354\u2013356.","journal-title":"Numer. Math."},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(85)90049-3","volume":"20","author":"D. S. Wise","year":"1985","unstructured":"D. S. Wise. Representing matrices as quadtrees for parallel processors. Information Processing Letters 20 (May, 1985), 195\u2013199.","journal-title":"Information Processing Letters"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/3-540-15975-4_43","volume-title":"Functional Programming Languages and Computer Architecture","author":"D. S. Wise","year":"1985","unstructured":"D. S. Wise. Design for a Multiprocessing Heap with On-Board Reference Counting. In Jean-Pierre Jouannaud (ed.), Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science 201, Berlin, Springer (1985), 289\u2013304."},{"key":"9_CR20","unstructured":"D. S. Wise. Parallel decomposition of matrix inversion using quadtrees. Proc. 1986 International Conference on Parallel Processing (IEEE Cat. No. 86CH2355-6), 92\u201399."},{"key":"9_CR21","unstructured":"D. S. Wise & J. Franco. Costs of quadtree representation of sparsely patterned matrices (in preparation.)"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/3-540-15975-4_44","volume-title":"Functional Programming Languages and Computer Architecture","author":"M. F. Young","year":"1985","unstructured":"M. F. Young. A functional language and modular arithmetic for scientific computing. In Jean-Pierre Jouannaud (ed.), Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science 201, Berlin, Springer (1985), 305\u2013318."}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18317-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:43Z","timestamp":1605644083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18317-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540183174","9783540478799"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-18317-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}