{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:46:54Z","timestamp":1740894414595,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_21","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"240-251","source":"Crossref","is-referenced-by-count":13,"title":["Perfectly Balanced Allocation"],"prefix":"10.1007","author":[{"given":"Artur","family":"Czumaj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Riley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"1999","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocations. SIAM J. Comput.\u00a029(1), 180\u2013200 (1999)","journal-title":"SIAM J. Comput."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Czumaj, A., Steger, A., V\u00f6cking, B.: Balanced allocations: The heavily loaded case. In: STOC, pp. 745\u2013754 (2000)","DOI":"10.1145\/335305.335411"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-49543-6_12","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"R. Cole","year":"1998","unstructured":"Cole, R., Frieze, A., Maggs, B.M., Mitzenmacher, M., Richa, A.W., Sitaraman, R.K., Upfal, E.: On balls and bins with deletions. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol.\u00a01518, p. 145. Springer, Heidelberg (1998)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Cole, R., Maggs, B.M., Meyer auf der Heide, F., Mitzenmacher, M., Richa, A.W., Schr\u00f6der, K., Sitaraman, R.K., V\u00f6cking, B.: Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In: STOC, pp. 378\u2013388 (1998)","DOI":"10.1145\/276698.276790"},{"issue":"4","key":"21_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/rsa.1011","volume":"18","author":"A. Czumaj","year":"2001","unstructured":"Czumaj, A., Stemann, V.: Randomized allocation processes. Random Structures and Algorithms\u00a018(4), 297\u2013331 (2001); A preliminary version appeared in FOCS, pp. 194\u2013203, 1997","journal-title":"Random Structures and Algorithms"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1137\/S0097539795292208","volume":"29","author":"B. Ghosh","year":"1999","unstructured":"Ghosh, B., Leighton, F.T., Maggs, B.M., Muthukrishnan, S., Plaxton, C.G., Rajaraman, R., Richa, A.W., Tarjan, R.E., Zuckerman, D.: Tight analyses of two local load balancing algorithms. SIAM J. Comput.\u00a029(1), 29\u201364 (1999)","journal-title":"SIAM J. Comput."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Random graphs, random walks, differential equations and the probabilistic analysis of algorithms. In: STACS, pp. 1\u20132 (1998)","DOI":"10.1007\/BFb0028543"},{"issue":"4\/5","key":"21_CR8","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01940878","volume":"16","author":"R.M. Karp","year":"1996","unstructured":"Karp, R.M., Luby, M., Meyer auf der Heide, F.: Efficient PRAM simulation on a distributed memory machine. Algorithmica\u00a016(4\/5), 517\u2013542 (1996)","journal-title":"Algorithmica"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Korst, J.: Random duplicated assignment: An alternative to striping in video servers. In: ACM MULITIMEDIA, pp. 219\u2013226 (1997)","DOI":"10.1145\/266180.266372"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Luczak, M.J., Upfal, E.: Reducing network congestion and blocking probability through balanced allocation. In: FOCS, pp. 587\u2013595 (1999)","DOI":"10.1109\/SFFCS.1999.814633"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: Load balancing and density dependent jump Markov processes. In: FOCS, pp. 213\u2013222 (1996)","DOI":"10.1109\/SFCS.1996.548480"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/978-1-4615-0013-1_9","volume-title":"Handbook of Randomized Computing","author":"M. Mitzenmacher","year":"2001","unstructured":"Mitzenmacher, M., Richa, A.W., Sitaraman, R.: The power of two random choices: A survey of techniques and results. In: Rajasekaran, S., et al. (eds.) Handbook of Randomized Computing, vol.\u00a0I, pp. 255\u2013312. Kluwer Academic Press, Dordrecht (2001)"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Rabani, Y., Sinclair, A., Wanka, R.: Local divergence of Markov chains and the analysis of iterative load-balancing schemes. In: FOCS, pp. 694\u2013703 (1998)","DOI":"10.1109\/SFCS.1998.743520"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Sanders, P.: Asynchronous scheduling of redundant disk arrays. In: SPAA, pp. 89\u201398 (2000)","DOI":"10.1145\/341800.341812"},{"key":"21_CR15","unstructured":"Sanders, P.: Reconciling simplicity and realism in parallel disk models. In: SODA, pp. 67\u201376 (2001)"},{"issue":"1","key":"21_CR16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s00453-002-0987-0","volume":"35","author":"P. Sanders","year":"2003","unstructured":"Sanders, P., Egner, S., Korst, J.: Fast concurrent access to parallel disks. Algorithmica\u00a035(1), 21\u201355 (2003); A preliminary version appeared in SODA, pp. 849\u2013858, 2000","journal-title":"Algorithmica"},{"key":"21_CR17","unstructured":"Schoenmakers, L.A.M.: A new algorithm for the recognition of series parallel graphs. Technical Report CS-R9504, CWI\u2014Centrum voor Wiskunde en Informatica (January 1995)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"V\u00f6cking, B.: How asymetry helps load balancing. In: FOCS, pp. 131\u2013141 (1999)","DOI":"10.1109\/SFFCS.1999.814585"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:52:17Z","timestamp":1740840737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}