{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:35:27Z","timestamp":1743111327555,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114755"},{"type":"electronic","value":"9783642114762"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-11476-2_17","type":"book-chapter","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T06:15:31Z","timestamp":1264400131000},"page":"209-221","source":"Crossref","is-referenced-by-count":4,"title":["Revisiting Randomized Parallel Load Balancing Algorithms"],"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":"17_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":"17_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"},{"issue":"1","key":"17_CR3","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":"17_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/237502.237565","volume-title":"Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures","author":"V. Stemann","year":"1996","unstructured":"Stemann, V.: Parallel balanced allocations. In: Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures, pp. 261\u2013269. ACM, New York (1996)"},{"issue":"5","key":"17_CR5","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":"17_CR6","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"},{"key":"17_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"17_CR8","volume-title":"Random Allocations","author":"V. Kolchin","year":"1978","unstructured":"Kolchin, V., Sevastyanov, B., Chistyakov, V.: Random Allocations. John Wiley & Sons, Chichester (1978)"},{"key":"17_CR9","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.: \u201dBalls 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)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11476-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T19:00:00Z","timestamp":1685386800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11476-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114755","9783642114762"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11476-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}