{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:57Z","timestamp":1725663297323},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540528463"},{"type":"electronic","value":"9783540471646"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52846-6_77","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:44:06Z","timestamp":1330206246000},"page":"48-59","source":"Crossref","is-referenced-by-count":8,"title":["The file distribution problem for processor networks"],"prefix":"10.1007","author":[{"given":"Goos","family":"Kant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Leeuwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1981.1675777","volume":"C-30","author":"B.W. Arden","year":"1981","unstructured":"Arden, B.W., and H. Lee, Analysis of chordal ring network, IEEE Trans. Comput., C-30 (1981), pp. 291\u2013295.","journal-title":"IEEE Trans. Comput."},{"key":"5_CR2","unstructured":"Astola, J., The Theory of Lee-codes, Manuscript, Lappeenranta University of Technology, Finland."},{"key":"5_CR3","unstructured":"Bakker, E.M., The File Distribution Problem, unpublished manuscript, Utrecht, 1988."},{"key":"5_CR4","unstructured":"Bakker, E.M., personal communication, 1990."},{"key":"5_CR5","volume-title":"Algebraic Coding Theory","author":"E.R. Berlekamp","year":"1968","unstructured":"Berlekamp, E.R., Algebraic Coding Theory, McGraw-Hill Book Co., New York, 1968."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/356876.356883","volume":"14","author":"L.W. Dowdy","year":"1982","unstructured":"Dowdy, L.W., and D.V. Foster, Comparative models of the file assignment problem, ACM Computing Surveys 14 (1982), pp. 287\u2013313.","journal-title":"ACM Computing Surveys"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/TC.1982.1675994","volume":"C-31","author":"J.P. Fishburn","year":"1982","unstructured":"Fishburn, J.P., and R.A. Finkel, Quotient Networks, IEEE Trans. Comput., C-31 (1982), pp. 288\u2013295.","journal-title":"IEEE Trans. Comput."},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1137\/0118025","volume":"18","author":"S.W. Golomb","year":"1970","unstructured":"Golomb, S.W., and L.R. Welch, Perfect codes in the Lee metric and the packing of polyominoes, SIAM J. Appl. Math., 18 (1970), pp. 302\u2013317.","journal-title":"SIAM J. Appl. Math."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Kant, G., and J. van Leeuwen, The File Distribution Problem for Processor Networks, Tech. Report RUU-CS-90-16, Dept. of Computer Science, Utrecht University, 1990.","DOI":"10.1007\/3-540-52846-6_77"},{"key":"5_CR10","unstructured":"Kant, G., and J. van Leeuwen, Strong Colorings of Graphs, Tech. Report RUU-CS-90-15, Dept. of Computer Science, Utrecht University, 1990."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Lint, J.H. van, Coding Theory, Lecture Notes in Mathematics, vol. 207, Springer (1971), Berlin.","DOI":"10.1007\/BFb0067908"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"McCormick, S.T., Optimal approximation of sparse hessians and its equivalence to a graph coloring problem, Technical Report, Dept. of Operations Res., Stanford, 1981.","DOI":"10.21236\/ADA110846"},{"issue":"5","key":"5_CR13","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F.P. Preparata","year":"1981","unstructured":"Preparata, F.P., and J. Vuillemin, The Cube-Connected Cycles: A Versatile Network for Parallel Computation, Comm. ACM, vol. 24, no. 5 (1981), pp. 300\u2013309.","journal-title":"Comm. ACM"},{"key":"5_CR14","unstructured":"Siegel, H.J., Interconnection Networks for Large-Scale Parallel Processing, Lexington Books, Mass., 1985."}],"container-title":["Lecture Notes in Computer Science","SWAT 90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52846-6_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:19Z","timestamp":1605648319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52846-6_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540528463","9783540471646"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-52846-6_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}