{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:00Z","timestamp":1725664620002},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616269"},{"type":"electronic","value":"9783540706335"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61626-8_60","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:06:07Z","timestamp":1330293967000},"page":"451-454","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving the constant-degree parallelism alignment problem"],"prefix":"10.1007","author":[{"given":"Claude G.","family":"Diderich","sequence":"first","affiliation":[]},{"given":"Marc","family":"Gengler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"1\u20132","key":"60_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(94)00254-G","volume":"147","author":"E. Amaldi","year":"1995","unstructured":"E. Amaldi and V. Kann. The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoret. Comput. Sci., 147(1\u20132):181\u2013210, 1995.","journal-title":"Theoret. Comput. Sci."},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"J. M. Anderson and M. S. Lam. Global optimizations for parallelism and locality on scalable parallel machines. In Proc. PLDI '93, pages 112\u2013125, 1993.","DOI":"10.1145\/173262.155101"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"D. Bau, I. Kodukula, V. Kotlyar, K. Pingali, and P. Stodghill. Solving alignment using elementary linear algebra. In Proc. LCPC '94, LNCS 892, pages 46\u201360, Springer, 1994.","DOI":"10.1007\/BFb0025870"},{"key":"60_CR4","volume-title":"Research Rep. DI-96\/195","author":"C. G. Diderich","year":"1996","unstructured":"C. G. Diderich and M. Gengler. Solving the constant-degree parallelism alignment problem. Research Rep. DI-96\/195, Swiss Fed. Inst. of Tech.-Lausanne, Switzerland, 1996."},{"key":"60_CR5","doi-asserted-by":"crossref","unstructured":"Mich\u00e8le Dion and Yves Robert. Mapping affine loop nests: New results. In Proc. HPCN '95, LNCS 919, pages 184\u2013189, Springer, 1995.","DOI":"10.1007\/BFb0046628"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"C.-H. Huang and P. Sadayappan. Communication-free hyperplane partitioning of nested loops. In Proc. LCPC '91, LNCS 589, pages 186\u2013200, Springer, 1991.","DOI":"10.1007\/BFb0038665"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'96 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61626-8_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:26:03Z","timestamp":1587342363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61626-8_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616269","9783540706335"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-61626-8_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}