{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:51:37Z","timestamp":1742982697744,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_48","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"545-557","source":"Crossref","is-referenced-by-count":2,"title":["Approximated Two Choices in Randomized Load Balancing"],"prefix":"10.1007","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[]},{"given":"Akinori","family":"Kawachi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"48_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.: Parallel randomized load balancing. Random Structures and Algorithms\u00a013(2), 159\u2013188 (1998)","journal-title":"Random Structures and Algorithms"},{"issue":"1","key":"48_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"2000","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocations. SIAM Journal on Computing\u00a029(1), 180\u2013200 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"48_CR3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522355.001.0001","volume-title":"Poisson Approximation","author":"A.D. Barbour","year":"1992","unstructured":"Barbour, A.D., Holst, L., Janson, S.: Poisson Approximation. Oxford University Press, Oxford (1992)"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Czumaj, A., Steger, A., V\u00f6cking, B.: Balanced allocations: the heavily loaded case. In: Proceedings of the 32nd annual ACM Symposium on Theory of Computing, pp. 745\u2013754 (2000)","DOI":"10.1145\/335305.335411"},{"key":"48_CR5","unstructured":"Drinea, E., Frieze, A., Mitzenmacher, M.: Balls and bins models with feedback. In: Proceedings of the 11th annual ACM-SIAM Symposium on Discrete Algorithms, pp. 308\u2013315 (2002)"},{"issue":"4\/5","key":"48_CR6","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01940878","volume":"16","author":"R. Karp","year":"1996","unstructured":"Karp, R., Luby, M., Meyer auf de Heide, F.: Efficient PRAM simulation on a distributed memory machine. Algorithmica\u00a016(4\/5), 517\u2013542 (1996)","journal-title":"Algorithmica"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: Load balancing and density dependent jump markov processes. In: Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, pp. 213\u2013222 (1996)","DOI":"10.1109\/SFCS.1996.548480"},{"key":"48_CR8","unstructured":"Mitzenmacher, M.: The power of two choices in randomized load balancing. PhD thesis, University of California, Berkeley (1996)"},{"issue":"10","key":"48_CR9","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/71.963420","volume":"12","author":"M. Mitzenmacher","year":"2001","unstructured":"Mitzenmacher, M.: The power of two choices in randomized load balancing. IEEE Transactions on Parallel and Distributed Systems\u00a012(10), 1094\u20131104 (2001)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Prabhakar, B., Shah, D.: Load balancing with memory. In: Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pp. 799\u2013808 (2002)","DOI":"10.1109\/SFCS.2002.1182005"},{"key":"48_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/978-1-4615-0013-1_9","volume-title":"Handbook of Randomized Computing, vol. 1","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: Handbook of Randomized Computing, vol. 1, pp. 255\u2013312. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"48_CR12","first-page":"165","volume-title":"Analytic Methods in Applied Probability: In Memory of Fridrih Karpelevich","author":"M. Mitzenmacher","year":"2002","unstructured":"Mitzenmacher, M., V\u00f6cking, B.: The asymptotics of selecting the shortest of two, improved. In: Analytic Methods in Applied Probability: In Memory of Fridrih Karpelevich, pp. 165\u2013176. American Mathematical Society, Providence (2002)"},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R. Monasson","year":"1999","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic phase transitions. Nature\u00a0400, 133\u2013137 (1999)","journal-title":"Nature"},{"key":"48_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motowani","year":"1995","unstructured":"Motowani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"V\u00f6cking, B.: How asymmetry helps load balancing. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 131\u2013140 (1999)","DOI":"10.1109\/SFFCS.1999.814585"},{"key":"48_CR16","unstructured":"V\u00f6cking, B.: Symmetric vs. asymmetric multiple-choice algorithms (invited paper). In: Proceedings of the 2nd ARACNE workshop, pp. 7\u201315 (2001)"},{"issue":"1","key":"48_CR17","first-page":"15","volume":"32","author":"N.D. Vvendenskaya","year":"1996","unstructured":"Vvendenskaya, N.D., Dobrushin, R.L., Karpelevich, F.I.: Queuing systems with selection of the shortest of two queues: An asymptotic approach. Problems of Information Transmission\u00a032(1), 15\u201327 (1996)","journal-title":"Problems of Information Transmission"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:52:28Z","timestamp":1740261148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}