{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:53:45Z","timestamp":1779900825057,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540651420","type":"print"},{"value":"9783540495437","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49543-6_13","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T22:58:05Z","timestamp":1181170685000},"page":"159-170","source":"Crossref","is-referenced-by-count":232,"title":["\u201cBalls into Bins\u201d \u2014 A Simple and Tight Analysis"],"prefix":"10.1007","author":[{"given":"Martin","family":"Raab","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Angelika","family":"Steger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Y. Azar, A.Z. Broder, A.R. Karlin, and E. Upfal. On-line load balancing (extended abstract). In 33rd Annual Symposium on Foundations of Computer Science, pages 218\u2013225, Pittsburgh, Pennsylvania, 24\u201327 October 1992. IEEE.","DOI":"10.1109\/SFCS.1992.267770"},{"key":"13_CR2","volume-title":"Random graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s. Random graphs. Academic Press, New York-San Francisco-London-San Diego, 1985."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"A. Czumaj and V. Stemann. Randomized allocation processes. In 38th Annual Symposium on Foundations of Computer Science, pages 194\u2013203, 1997.","DOI":"10.1109\/SFCS.1997.646108"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/322248.322254","volume":"28","author":"G.H. Gonnet","year":"1981","unstructured":"G.H. Gonnet. Expected length of the longest probe sequence in hash code searching. J. ACM, 28(2):289\u2013304, 1981.","journal-title":"J. ACM"},{"key":"13_CR5","unstructured":"N. Johnson and S. Kotz. Urn Models and Their Applications. John Wiley and Sons, 1977."},{"key":"13_CR6","unstructured":"M.D. Mitzenmacher. The Power of Two Choices in Randomized Load Balancing. PhD thesis, Computer Science Department, University of California at Berkeley, 1996."}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49543-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T01:35:43Z","timestamp":1548293743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49543-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651420","9783540495437"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-49543-6_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1998]]}}}