{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:11:26Z","timestamp":1742983886543,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642551949"},{"type":"electronic","value":"9783642551956"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-55195-6_10","type":"book-chapter","created":{"date-parts":[[2014,5,7]],"date-time":"2014-05-07T14:55:32Z","timestamp":1399474532000},"page":"105-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms for In-Place Matrix Transposition"],"prefix":"10.1007","author":[{"given":"Fred G.","family":"Gustavson","sequence":"first","affiliation":[]},{"given":"David W.","family":"Walker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,8]]},"reference":[{"key":"10_CR1","unstructured":"Cachegrind: Cachegrind description. http:\/\/valgrind.org\/docs\/manual\/cg-manual.html (2013) Accessed 21 Nov 2013"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/2168773.2168775","volume":"38","author":"FG Gustavson","year":"2012","unstructured":"Gustavson, F.G., Karlsson, L., Kagstrom, B.: Parallel and cache-efficient in-place matrix storage format conversion. ACM Trans. Math. Softw. 38(3), 17:1\u201317:32 (2012)","journal-title":"ACM Trans. Math. Softw."},{"key":"10_CR3","unstructured":"Gustavson, F.G., Walker, D.W.: Proof of the swap count for the exchange operation. Technical report, School Computer Science and Informatics, Cardiff University, Cardiff, U.K (2013)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.jco.2009.02.008","volume":"25","author":"AA Tretyakov","year":"2009","unstructured":"Tretyakov, A.A., Tyrtyshnikov, E.E.: Optimal in-place transposition of rectangular matrices. J. Complex. 25, 377\u2013384 (2009)","journal-title":"J. Complex."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55195-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T00:16:57Z","timestamp":1675988217000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-55195-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642551949","9783642551956"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55195-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 May 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}