{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:54Z","timestamp":1725795894919},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_81","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"979-990","source":"Crossref","is-referenced-by-count":13,"title":["Balanced Allocations: A Simple Proof for the Heavily Loaded Case"],"prefix":"10.1007","author":[{"given":"Kunal","family":"Talwar","sequence":"first","affiliation":[]},{"given":"Udi","family":"Wieder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"81_CR1","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"1999","unstructured":"Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced allocations. SIAM J. Computing\u00a029(1), 180\u2013200 (1999)","journal-title":"SIAM J. Computing"},{"issue":"6","key":"81_CR2","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1137\/S009753970444435X","volume":"35","author":"P. Berenbrink","year":"2006","unstructured":"Berenbrink, P., Czumaj, A., Steger, A., V\u00f6cking, B.: Balanced allocations: The heavily loaded case. SIAM J. Computing\u00a035(6), 1350\u20131385 (2006)","journal-title":"SIAM J. Computing"},{"issue":"3","key":"81_CR3","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.tcs.2008.09.023","volume":"409","author":"P. Berenbrink","year":"2008","unstructured":"Berenbrink, P., Friedetzky, T., Hu, Z., Martin, R.: On weighted balls-into-bins games. Theor. Comput. Sci.\u00a0409(3), 511\u2013520 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"81_CR4","doi-asserted-by":"crossref","unstructured":"Dubhashi, D., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511581274"},{"key":"81_CR5","doi-asserted-by":"crossref","unstructured":"Karp, R., Luby, M., Meyer auf der Heide, F.: Efficient pram simulation on a distributed memory machine. In: STOC, pp. 318\u2013326 (1992)","DOI":"10.1145\/129712.129743"},{"key":"81_CR6","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Richa, A.W., Sitaraman, R.: The power of two random choices: A survey of techniques and results. In: Handbook of Randomized Computing, pp. 255\u2013312. Kluwer (2000)","DOI":"10.1007\/978-1-4615-0013-1_9"},{"key":"81_CR7","unstructured":"Mitzenmacher, M., Vcking, B.: The asymptotics of selecting the shortest of two, improved. In: Allerton, pp. 326\u2013327 (1998)"},{"key":"81_CR8","unstructured":"Pagh, R.: Hashing 2. Slides for the MADALGO Summer School on Data Structures (2013), \n                    \n                      http:\/\/www.madalgo.au.dk\/html_sider\/2_5_Events\/SS2013\/Course_material2013.html"},{"key":"81_CR9","doi-asserted-by":"crossref","unstructured":"Peres, Y., Talwar, K., Wieder, U.: The (1 + beta)-choice process and weighted balls-into-bins. In: SODA 2010, pp. 1613\u20131619 (2010)","DOI":"10.1137\/1.9781611973075.131"},{"key":"81_CR10","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":"81_CR11","doi-asserted-by":"crossref","unstructured":"Talwar, K., Wieder, U.: Balanced allocations: the weighted case. In: STOC, pp. 256\u2013265 (2007)","DOI":"10.1145\/1250790.1250829"},{"issue":"4","key":"81_CR12","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1145\/792538.792546","volume":"50","author":"B. V\u00f6cking","year":"2003","unstructured":"V\u00f6cking, B.: How asymmetry helps load balancing. J. ACM\u00a050(4), 568\u2013589 (2003)","journal-title":"J. ACM"},{"key":"81_CR13","doi-asserted-by":"crossref","unstructured":"Wieder, U.: Ballanced allocations with heterogenous bins. In: SPAA, pp. 188\u2013193 (2007)","DOI":"10.1145\/1248377.1248407"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:32:17Z","timestamp":1558924337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}