{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:33:13Z","timestamp":1725456793850},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615491"},{"type":"electronic","value":"9783540688082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0030121","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:38:48Z","timestamp":1133415528000},"page":"307-312","source":"Crossref","is-referenced-by-count":1,"title":["The module allocation problem: An average case analysis"],"prefix":"10.1007","author":[{"given":"M.","family":"Lamari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. Fernandez","family":"De La Vega","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"28_CR1","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s, Random Graphs, Academic Press, London 1985."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"A. Lubotzky, Discrete Groups, Expanding Graphs and Invariant Measures, Birkh\u00e4user, 1994.","DOI":"10.1007\/978-3-0346-0332-4"},{"issue":"No.3","key":"28_CR3","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1145\/146637.146646","volume":"39","author":"A. Billonnet","year":"1992","unstructured":"Billonnet A., Costa M.C., Sutter A., An Efficient Algorithm for the Task Allocation Problem, Journal of the Association for Computing Machinary, Vol. 39, No. 3, pp. 502\u2013518, 1992.","journal-title":"Journal of the Association for Computing Machinary"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Bokhari S.H., A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System, IEEE Trans. Softw. Eng., Vol. SE-7, No. 6, 1981.","DOI":"10.1109\/TSE.1981.226469"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Fernandez-Baca D., Allocating Modules to Processors in a Distributed System, IEEE Trans. Softw. Eng., Vol. 15, No. 11, 1989.","DOI":"10.1109\/32.41334"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/0167-6377(89)90022-9","volume":"8","author":"V.F. Magirou","year":"1989","unstructured":"Magirou V.F., Milis J.Z., An Algorithm for the Multiprocessor Assignment Problem, Operation Research Letters 8, 1989, 351\u2013356.","journal-title":"Operation Research Letters"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Dalhaus E., Johnson D. S., Papadimitriou C. H., Seymour P., and Yannakakis M., The Complexity of Multiway Cut, In Proc. 24th ACM STOC 1992, 241\u2013251.","DOI":"10.1145\/129712.129736"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Stone H. S., Multiprocessor Scheduling with the Aid of Network Flow Algorithms, IEEE Trans. Softw. Eng., Vol. SE-3, No. 1, 1977.","DOI":"10.1109\/TSE.1977.233840"}],"container-title":["Lecture Notes in Computer Science","Parallel Algorithms for Irregularly Structured Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030121","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:16:00Z","timestamp":1586592960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615491","9783540688082"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0030121","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}