{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:59:42Z","timestamp":1725465582927},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646822"},{"type":"electronic","value":"9783540691068"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054354","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T03:43:28Z","timestamp":1149651808000},"page":"47-58","source":"Crossref","is-referenced-by-count":0,"title":["Approximations for the general block distribution of a matrix"],"prefix":"10.1007","author":[{"given":"Bengt","family":"Aspvall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magn\u00das M.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fredrik","family":"Manne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"5_CR1","unstructured":"B. Aspvall, M. M. Halld\u00f3rsson, and F. Manne, Approximating the Generalized Block Distribution of a Matrix, Institutt for Informatikk, TR-141, University of Bergen, Dec. 1997."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/M-PDT.1994.329803","volume":"Fall","author":"B. Chapman","year":"1994","unstructured":"B. Chapman, P. Mehrotra, and H. Zima, Extending HPF for advanced data parallel applications, IEEE Trans. Par. Dist. Syst., (Fall 1994), pp. 59\u201370.","journal-title":"IEEE Trans. Par. Dist. Syst."},{"key":"5_CR3","unstructured":"G. N. Frederickson, Optimal algorithms for partitioning trees and locating p-centers in in trees, in Proceedings of second ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 168\u2013177."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"M. Grigni and F. Manne, On the complexity of the generalized block distribution, in Proceedings of Irregular'96, the third international workshop on parallel algorithms for irregularly structured problems, Lecture Notes in Computer Science 1117, Springer, 1996, pp. 319\u2013326.","DOI":"10.1007\/BFb0030123"},{"key":"5_CR5","unstructured":"High Performance Fortran Language Specification 2.0, January 1997. Available from http:\/\/www.crpc.rice.edu\/HPFF\/home.html."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"S. Khanna, S. Muthukrishnan, and S. Skiena, Efficient array partitioning. Proceedings of the 24th International Colloquium on Para Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science 1256, Springer, 1997, pp. 616\u2013626.","DOI":"10.1007\/3-540-63165-8_216"},{"key":"5_CR7","volume-title":"PhD thesis","author":"F. Manne","year":"1993","unstructured":"F. Manne, Load Balancing in Parallel Sparse Matrix Computations, PhD thesis, University of Bergen, Norway, 1993."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"F. Manne and T. S\u00f8revik, Partitioning an array onto a mesh of processors, in Proceedings of '96, Workshop on Applied Parallel Computing in Industrial Problems and Optimization, Lecture Notes in Computer Science 1184, Springer, 1996, pp. 467\u2013477.","DOI":"10.1007\/3-540-62095-8_50"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0166-218X(94)00154-6","volume":"62","author":"A. Mingozzi","year":"1995","unstructured":"A. Mingozzi, S. Ricciardelli, and M. Spadoni, Partitioning a matrix to minimize the maximum cost, Disc. Appl. Math., 62 (1995), pp. 221\u2013248.","journal-title":"Disc. Appl. Math."},{"key":"5_CR10","unstructured":"D. M. Nicol, Rectilinear partitioning of irregular data parallel computations, J. Par. Dist. Comp., (1994), pp. 119\u2013134."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1109\/12.475128","volume":"44","author":"B. Olstad","year":"1995","unstructured":"B. Olstad and F. Manne, Efficient partitioning of sequences, IEEE Trans. Cornput., 44 (1995), pp. 1322\u20131326.","journal-title":"IEEE Trans. Cornput."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T02:46:46Z","timestamp":1555642006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0054354","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}