{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T05:21:57Z","timestamp":1741152117031,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_32","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T08:03:12Z","timestamp":1300089792000},"page":"314-325","source":"Crossref","is-referenced-by-count":0,"title":["Chains-into-Bins Processes"],"prefix":"10.1007","author":[{"given":"Tu\u011fkan","family":"Batu","sequence":"first","affiliation":[]},{"given":"Petra","family":"Berenbrink","sequence":"additional","affiliation":[]},{"given":"Colin","family":"Cooper","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_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":"32_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, 1350\u20131385 (2006)","journal-title":"SIAM J. Computing"},{"unstructured":"Englert, M.: Chains of Length Two into Bins. Manuscript, University of Aachen","key":"32_CR3"},{"doi-asserted-by":"crossref","unstructured":"Fekete, S., K\u00f6hler, E., Teich, J.: Optimal FPGA module placement with temporal precedence constraints. In: Proc. of the Conference on Design, Automation and Test in Europe (DATE 2001), pp. 658\u2013667 (2001)","key":"32_CR4","DOI":"10.1109\/DATE.2001.915093"},{"doi-asserted-by":"crossref","unstructured":"Kenthapadi, K., Panigrahy, R.: Balanced allocation on graphs. In: Proc. of 17th Annual Symposium on Discrete Algorithms (SODA 2006), pp. 434\u2013443 (2006)","key":"32_CR5","DOI":"10.1145\/1109557.1109606"},{"key":"32_CR6","series-title":"The Art of Computer Programming","volume-title":"Sorting and Searching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: Sorting and Searching, 2nd edn. The Art of Computer Programming, vol.\u00a03. Addison-Wesley, Reading (1998)","edition":"2"},{"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)","key":"32_CR7","DOI":"10.1007\/978-1-4615-0013-1_9"},{"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)","key":"32_CR8","DOI":"10.1109\/SFCS.2002.1182005"},{"doi-asserted-by":"crossref","unstructured":"Patterson, D.A., Gibson, G.A., Katz, R.H.: A Case for Redundant Arrays of Inexpensive Disks (RAID). In: Proc. of SIGMOD International Conference on Management of Data, pp. 109\u2013116 (1988)","key":"32_CR9","DOI":"10.1145\/971701.50214"},{"doi-asserted-by":"crossref","unstructured":"Sanders, P., V\u00f6cking, B.: Tail Bounds And Expectations For Random Arc Allocation And Applications. Combinatorics, Probability & Computing\u00a012(3) (2003)","key":"32_CR10","DOI":"10.1017\/S0963548303005601"},{"issue":"11","key":"32_CR11","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1109\/TC.2004.99","volume":"53","author":"C. Steiger","year":"2004","unstructured":"Steiger, C., Walder, H., Platzner, M.: Operating Systems for Reconfigurable Embedded Platforms: Online Scheduling of Real-Time Tasks. IEEE Trans. Computers\u00a053(11), 1393\u20131407 (2004)","journal-title":"IEEE Trans. Computers"},{"doi-asserted-by":"crossref","unstructured":"Talwar, K., Wieder, U.: Balanced allocations: the weighted case. In: Proc. of the 39th Symposium on Theory of Computing (STOC), pp. 256\u2013265 (2007)","key":"32_CR12","DOI":"10.1145\/1250790.1250829"},{"issue":"4","key":"32_CR13","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"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T06:37:07Z","timestamp":1741070227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}