{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:55:53Z","timestamp":1725584153986},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212536"},{"type":"electronic","value":"9783642212543"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21254-3_37","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T09:38:04Z","timestamp":1306489084000},"page":"465-476","source":"Crossref","is-referenced-by-count":1,"title":["Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Reidenbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus L.","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","volume-title":"Theory of Scheduling","author":"R.W. Conway","year":"1967","unstructured":"Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison-Wesley Publishing Company, Reading (1967)"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0166-218X(92)90177-C","volume":"39","author":"P. Flajolet","year":"1992","unstructured":"Flajolet, P., Gardy, D., Thimonier, L.: Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Discrete Applied Mathematics\u00a039, 207\u2013229 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/321312.321317","volume":"13","author":"L.P. Horwitz","year":"1966","unstructured":"Horwitz, L.P., Karp, R.M., Miller, R.E., Winograd, S.: Index register allocation. Journal of the ACM\u00a013, 43\u201361 (1966)","journal-title":"Journal of the ACM"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D. Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on subsequences and supersequences. Journal of the ACM\u00a025, 322\u2013336 (1978)","journal-title":"Journal of the ACM"},{"key":"37_CR6","unstructured":"Pereira, F.M.Q.: A survey on register allocation (2008), \n                    \n                      http:\/\/compilers.cs.ucla.edu\/fernando\/publications\/drafts\/survey.pdf"},{"key":"37_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-18098-9_26","volume-title":"Implementation and Application of Automata","author":"D. Reidenbach","year":"2011","unstructured":"Reidenbach, D., Schmid, M.L.: A polynomial time match test for large classes of extended regular expressions. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol.\u00a06482, pp. 241\u2013250. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21254-3_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T23:08:58Z","timestamp":1553728138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21254-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212536","9783642212543"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21254-3_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}