{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:08:55Z","timestamp":1725548935990},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_19","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T13:06:19Z","timestamp":1267535179000},"page":"231-243","source":"Crossref","is-referenced-by-count":3,"title":["On Weighted Balls-into-Bins Games"],"prefix":"10.1007","author":[{"given":"Petra","family":"Berenbrink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Friedetzky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zengjian","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_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. Computing\u00a029, 180\u2013200 (1999)","journal-title":"SIAM J. Computing"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Czumaj, A., Steger, A., V\u00f6cking, B.: Balanced Allocations: The Heavily Loaded Case. In: Proc. of the 30th Annual ACM Symposium on Theory of Computing (STOC 2000), pp. 745\u2013754 (2000)","DOI":"10.1145\/335305.335411"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Bubley, R., Dyer, M.E.: Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains. In: Proc. of the 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), pp. 223\u2013231 (1997)","DOI":"10.1109\/SFCS.1997.646111"},{"key":"19_CR4","unstructured":"Berenbrink, P.: Randomized Allocation of Independent Tasks. University of Paderborn (2000)"},{"key":"19_CR5","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, 281\u2013300 (1999)","journal-title":"Theory of Computing Systems"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"604","DOI":"10.2307\/1427482","volume":"24","author":"C.-S. Chang","year":"1992","unstructured":"Chang, C.-S.: A New Ordering for Stochastic Majorization: Theory and Applications. Advances in Applied Probability\u00a024, 604\u2013634 (1992)","journal-title":"Advances in Applied Probability"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s002240010012","volume":"33","author":"A. Czumaj","year":"2000","unstructured":"Czumaj, A.: Recovery Time of Dynamic Allocation Processes. Theory of Computing Systems\u00a033, 465\u2013487 (2000)","journal-title":"Theory of Computing Systems"},{"key":"19_CR8","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, 297\u2013331 (2001)","journal-title":"Random Structures and Algorithms"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-540-45198-3_21","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Czumaj","year":"2003","unstructured":"Czumaj, A., Rily, C., Scheideler, C.: Perfectly Balanced Allocation. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 240\u2013251. Springer, Heidelberg (2003)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Luby, M., auf der Heide, F.M.: Efficient PRAM Simulation on a Distributed Memory Machine. In: Proc. of the 22nd Annual ACM Symposium on Theory of Computing (STOC 1992), pp. 318\u2013326 (1992)","DOI":"10.1145\/129712.129743"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00224-003-1131-5","volume":"36","author":"E. Koutsoupias","year":"2003","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.G.: Approximate Equilibria and Ball Fusion. Theory of Computing Systems\u00a036, 683\u2013693 (2003)","journal-title":"Theory of Computing Systems"},{"key":"19_CR12","volume-title":"Inequalities: Theory of Majorization and Its Applications","author":"A.W. Marshall","year":"1979","unstructured":"Marshall, A.W., Olkin, I.: Inequalities: Theory of Majorization and Its Applications. Academic Press, London (1979)"},{"key":"19_CR13","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 (2000)","DOI":"10.1007\/978-1-4615-0013-1_9"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Prabhakar, B., Shah, D.: Load Balancing with Memory. In: Proc. of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), pp. 799\u2013808 (2002)","DOI":"10.1109\/SFCS.2002.1182005"},{"key":"19_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"19_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0323-0","volume-title":"Algorithms for Random Generation and Counting: A Markov Chain Approach","author":"A. Sinclair","year":"1993","unstructured":"Sinclair, A.: Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkh\u00e4user, Boston (1993)"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Stemann, V.: Parallel Balanced Allocations. In: Proc. of the 8th ACM Symposium on Parallel Algorithms and Architectures (SPAA 1996), pp. 261\u2013269 (1996)","DOI":"10.1145\/237502.237565"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00453-002-0987-0","volume":"35","author":"P. Sanders","year":"2003","unstructured":"Sanders, P., Egner, S., Korst, J.H.M.: Fast Concurrent Access to Parallel Disks. Algorithmica\u00a035, 21\u201355 (2003)","journal-title":"Algorithmica"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"V\u00f6cking, B.: How Asymmetry Helps Load Balancing. In: Proc. of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1999), pp. 131\u2013140 (1999)","DOI":"10.1109\/SFFCS.1999.814585"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:29:45Z","timestamp":1605742185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}