{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T12:10:07Z","timestamp":1723205407746},"reference-count":0,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["VLSI Design"],"published-print":{"date-parts":[[1999,1]]},"abstract":"<jats:p>Algorithms for multiplying several types of sparse <jats:italic>n<\/jats:italic> x <jats:italic>n<\/jats:italic>\u2010matrices on dynamically\nreconfigurable <jats:italic>n<\/jats:italic> x <jats:italic>n<\/jats:italic>\u2010arrays are presented. For some classes of sparse matrices constant\ntime algorithms are given, <jats:italic>e.g.<\/jats:italic>, when the first matrix has at most <jats:italic>kn<\/jats:italic> elements in each\ncolumn or in each row and the second matrix has at most <jats:italic>kn<\/jats:italic> nonzero elements in each\nrow, where <jats:italic>k<\/jats:italic> is a constant. Moreover, <jats:italic>O<\/jats:italic>(<jats:italic>k<\/jats:italic>\n) algorithms are obtained for the case that\none matrix is a general sparse matrix with at most <jats:italic>kn<\/jats:italic> nonzero elements and the other\nmatrix has at most <jats:italic>k<\/jats:italic> nonzero elements in every row or in every column. Also a lower\nbound of \u2126(\n) is proved for this and other cases which shows that the algorithms are\nclose to the optimum.<\/jats:p>","DOI":"10.1155\/1999\/32697","type":"journal-article","created":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T12:58:21Z","timestamp":1190120301000},"page":"69-81","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Multiplication of Matrices With Different Sparseness Properties on Dynamically Reconfigurable Meshes"],"prefix":"10.1155","volume":"9","author":[{"given":"Martin","family":"Middendorf","sequence":"first","affiliation":[]},{"given":"Hartmut","family":"Schmeck","sequence":"additional","affiliation":[]},{"given":"Heiko","family":"Schr\u00f6der","sequence":"additional","affiliation":[]},{"given":"Gavin","family":"Turner","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[1999,1]]},"container-title":["VLSI Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/archive\/1999\/032697.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/1999\/32697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T11:52:04Z","timestamp":1723204324000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/1999\/32697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["10.1155\/1999\/32697"],"URL":"https:\/\/doi.org\/10.1155\/1999\/32697","archive":["Portico"],"relation":{},"ISSN":["1065-514X","1563-5171"],"issn-type":[{"type":"print","value":"1065-514X"},{"type":"electronic","value":"1563-5171"}],"subject":[],"published":{"date-parts":[[1999,1]]},"assertion":[{"value":"1997-05-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"1999-01-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}