{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:51:04Z","timestamp":1743101464873,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_44","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"528-541","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Shuffle Code with Permutation Instructions"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Buchwald","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Mohr","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Blazy, S., Robillard, B.: Live-range unsplitting for faster optimal coalescing. In: Languages, Compilers, and Tools for Embedded Systems (LCTES 2009), pp. 70\u201379. ACM (2009)","DOI":"10.1145\/1542452.1542462"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Bouchez, F., Darte, A., Rastello, F.: On the complexity of register coalescing. In: Code Generation and Optimization (CGO 2007), pp. 102\u2013114. IEEE (2007)","DOI":"10.1109\/CGO.2007.26"},{"key":"44_CR3","unstructured":"Buchwald, S., Mohr, M., Rutter, I.: Optimal shuffle code with permutation instructions. CoRR abs\/1504.07073 (2015). http:\/\/arxiv.org\/abs\/1504.07073"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: Computational Molecular Biology (RECOMB 1997), pp. 75\u201383. ACM (1997)","DOI":"10.1145\/267521.267531"},{"issue":"1","key":"44_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TIT.2011.2171532","volume":"58","author":"F Farnoud","year":"2012","unstructured":"Farnoud, F., Milenkovic, O.: Sorting of permutations by cost-constrained transpositions. IEEE Transactions on Information Theory 58(1), 3\u201323 (2012)","journal-title":"IEEE Transactions on Information Theory"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-71229-9_8","volume-title":"Compiler Construction","author":"D Grund","year":"2007","unstructured":"Grund, D., Hack, S.: A fast cutting-plane algorithm for optimal coalescing. In: Adsul, B., Odersky, M. (eds.) CC 2007. LNCS, vol. 4420, pp. 111\u2013125. Springer, Heidelberg (2007)"},{"key":"44_CR7","unstructured":"Hack, S.: Register Allocation for Programs in SSA Form. Ph.D. thesis, Universit\u00e4t Karlsruhe (2007). http:\/\/digbib.ubka.uni-karlsruhe.de\/volltexte\/documents\/6532"},{"issue":"6","key":"44_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1145\/1379022.1375610","volume":"43","author":"S Hack","year":"2008","unstructured":"Hack, S., Goos, G.: Copy coalescing by graph recoloring. SIGPLAN Notices 43(6), 227\u2013237 (2008)","journal-title":"SIGPLAN Notices"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Mohr, M., Grudnitsky, A., Modschiedler, T., Bauer, L., Hack, S., Henkel, J.: Hardware acceleration for programs in SSA form. In: Compilers, Architecture and Synthesis for Embedded Systems (CASES 2013). ACM (2013)","DOI":"10.1109\/CASES.2013.6662518"},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Seress, \u00c1.: Permutation Group Algorithms, vol. 152. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511546549"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T13:36:11Z","timestamp":1676468171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}