{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:12:07Z","timestamp":1725541927024},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_30","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T14:04:58Z","timestamp":1260194698000},"page":"358-369","source":"Crossref","is-referenced-by-count":6,"title":["Parallel Randomized Load Balancing: A Lower Bound for a More General Model"],"prefix":"10.1007","author":[{"given":"Guy","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Medina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<159::AID-RSA3>3.0.CO;2-Q","volume":"13","author":"M. Adler","year":"1998","unstructured":"Adler, M., Chakrabarti, S., Mitzenmacher, M., Rasmussen, L.E.: Parallel Randomized Load Balancing. Random Struct. Algorithms\u00a013(2), 159\u2013188 (1998)","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"30_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s002240000119","volume":"32","author":"P. Berenbrink","year":"1999","unstructured":"Berenbrink, P., auf der Heide, F.M., Schr\u00f6der, K.: Allocating Weighted Jobs in Parallel. Theory of Computing Systems\u00a032(3), 281\u2013300 (1999)","journal-title":"Theory of Computing Systems"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/237502.237565","volume-title":"SPAA 1996","author":"V. Stemann","year":"1996","unstructured":"Stemann, V.: Parallel Balanced Allocations. In: SPAA 1996, pp. 261\u2013269. ACM, New York (1996)"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Even, G., Medina, M.: Revisiting Randomized Parallel Load Balancing Algorithms. In: SIROCCO 2009 (2009)","DOI":"10.1007\/978-3-642-11476-2_17"},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"2000","unstructured":"Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced Allocations. SIAM Journal on Computing\u00a029(1), 180\u2013200 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-49543-6_13","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"M. Raab","year":"1998","unstructured":"Raab, M., Steger, A.: \u201cBalls into Bins\u201d - A Simple and Tight Analysis. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol.\u00a01518, pp. 159\u2013170. Springer, Heidelberg (1998)"},{"key":"30_CR7","volume-title":"Random Allocations","author":"V. Kolchin","year":"1978","unstructured":"Kolchin, V., Sevastyanov, B., Chistyakov, V.: Random Allocations. John Wiley & Sons, Chichester (1978)"},{"issue":"5","key":"30_CR8","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1137\/S009753979529564X","volume":"29","author":"A. Czumaj","year":"2000","unstructured":"Czumaj, A., auf der Heide, F., Stemann, V.: Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal On Computing\u00a029(5), 1703\u20131739 (2000)","journal-title":"SIAM Journal On Computing"},{"issue":"4","key":"30_CR9","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1145\/792538.792546","volume":"50","author":"B. Voecking","year":"2003","unstructured":"Voecking, B.: How Asymmetry Helps Load Balancing. Journal of the ACM\u00a050(4), 568\u2013589 (2003)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:44:41Z","timestamp":1558687481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}