{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T06:42:21Z","timestamp":1791268941633,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540615491","type":"print"},{"value":"9783540688082","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0030098","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:38:48Z","timestamp":1133397528000},"page":"75-86","source":"Crossref","is-referenced-by-count":50,"title":["Decomposing irregularly sparse matrices for parallel matrix-vector multiplication"],"prefix":"10.1007","author":[{"given":"\u00dcmit V.","family":"\u00c7ataly\u00fcrek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"5_CR1","unstructured":"C. J. Alpert, L. W. Hagen, and A. B. Kahng. A hybrid multilevel\/genetic approach for circuit partitioning. Technical report, UCLA CS Dept., 1996."},{"issue":"1\u20132","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C. J. Alpert","year":"1995","unstructured":"C. J. Alpert and A. B. Kahng. Recent directions in netlist partitioning: A survey. VLSI Journal, 19(1\u20132):1\u201381, 1995.","journal-title":"VLSI Journal"},{"key":"5_CR3","unstructured":"\u00dc. V. \u00c7ataly\u00fcrek and C. Aykanat. A hypergraph model for mapping repeated sparse matrix-vector product computations onto multicomputers. In Proceedings of International Conference on Hyperformance Computing, December 1995."},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62038.62043","volume":"15","author":"I. S. Duff","year":"1989","unstructured":"I. S. Duff, R. Grimes, and J. Lewis. Sparse matrix test problems. ACM Transactions on Mathematical Software, 15(1):1\u201314, march 1989.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1109\/12.9733","volume":"37","author":"F. Er\u00e7al","year":"1988","unstructured":"F. Er\u00e7al, C. Aykanat, F. \u00d6zg\u00fcner and P. Sadayappan. Iterative algorithms for solution of large sparse systems of linear equations on hypercubes. IEEE Transactions on Computers, 37:1554\u20131567, 1988.","journal-title":"IEEE Transactions on Computers"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In Proceedings of the 19th ACM\/IEEE Design Automation Conference, pages 175\u2013181, 1982.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"5_CR7","unstructured":"D. M. Gay. Electronic mail distribution of linear programming test problems. Mathematical Programming Society COAL Newsletter, 1985."},{"key":"5_CR8","unstructured":"B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. Technical report, Sandia National Laboratories, 1993."},{"issue":"4","key":"5_CR9","first-page":"31","volume":"37","author":"B. A. Hendrickson","year":"1994","unstructured":"B. A. Hendrickson, W. Camp, S. J. Plimpton and R. W. Leland. Massively parallel methods for engineering and science problems. Communication of ACM, 37(4):31\u201341, April 1994.","journal-title":"Communication of ACM"},{"key":"5_CR10","unstructured":"G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. Tech. report, CS Dept., University of Minnesota, 1995."},{"issue":"2","key":"5_CR11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. W. Kernighan","year":"1970","unstructured":"B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291\u2013307, February 1970.","journal-title":"The Bell System Technical Journal"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0913011","volume":"13","author":"C. Pommerell","year":"1992","unstructured":"C. Pommerell, M. Annaratone, and W. Fichtner. A set of new mapping and colloring heuristics for distributed-memory parallel processors. SIAM Journal of Scientific and Statistical Computing, 13(1):194\u2013226, January 1992.","journal-title":"SIAM Journal of Scientific and Statistical Computing"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0743-7315(90)90004-9","volume":"10","author":"J. Ramanujam","year":"1990","unstructured":"J. Ramanujam, F. Er\u00e7al and P. Sadayappan. Task allocation onto a hypercube by recursive mincut bipartitioning. J. Parallel and Bist. Comput., 10:35\u201344, 1990.","journal-title":"J. Parallel and Bist. Comput."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"D. G. Schweikert and B. W. Kernighan. A proper model for the partitioning of electrical circuits. In Proceedings of the 9th ACM\/IEEE Design Automation Conference, pages 57\u201362, 1972.","DOI":"10.1145\/800153.804930"}],"container-title":["Lecture Notes in Computer Science","Parallel Algorithms for Irregularly Structured Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:16:16Z","timestamp":1586578576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615491","9783540688082"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0030098","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}