{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:54:53Z","timestamp":1742399693282,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651420"},{"type":"electronic","value":"9783540495437"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49543-6_12","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:58:05Z","timestamp":1181185085000},"page":"145-158","source":"Crossref","is-referenced-by-count":17,"title":["On Balls and Bins with Deletions"],"prefix":"10.1007","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[]},{"given":"Alan","family":"Frieze","sequence":"additional","affiliation":[]},{"given":"Bruce M.","family":"Maggs","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9a W.","family":"Richa","sequence":"additional","affiliation":[]},{"given":"Ramesh","family":"Sitaraman","sequence":"additional","affiliation":[]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"12_CR1","unstructured":"M. Adler, P. Berenbrink, and K. Schr\u00f3der. Analyzing an infinite parallel job allocation process. To appear in ESA 98."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"M. Adler, S. Chakrabarti, M. Mitzenmacher, and L. Rasmussen. Parallel randomized load balancing. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, 1995, pp. 238\u2013247.","DOI":"10.1145\/225058.225131"},{"key":"12_CR3","unstructured":"N. Alon and J. H. Spencer. The Probabilistic Method. John Wiley and Sons, 1992."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994, pp. 593\u2013602.","DOI":"10.1145\/195058.195412"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"P. Berenbrink, F. Meyer auf der Heide, and K. Schr\u00f3der. Allocating weighted jobs in parallel. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997, pp. 302\u2013310.","DOI":"10.1145\/258492.258522"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"R. Cole, B. M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A. W. Richa, K. Schr\u00f6der, R. K. Sitaraman, and B. V\u00f6cking. Randomized Protocols for Low-Congestion Circuit Routing inMultistage Interconnection Networks. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 378\u2013388.","DOI":"10.1145\/276698.276790"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"A. Czumaj and V. Stemann. Randomized allocation processes. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, 1997, pp. 194\u2013203.","DOI":"10.1109\/SFCS.1997.646108"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"M. Mitzenmacher. Density dependent jump markov processes and applications to load balancing. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 213\u2013223.","DOI":"10.1109\/SFCS.1996.548480"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"M. Mitzenmacher. On the analysis of randomized load balancing schemes. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997, pp. 292\u2013301.","DOI":"10.1145\/258492.258521"},{"key":"12_CR10","volume-title":"Technical Note 1997-024","author":"M. Mitzenmacher","year":"1997","unstructured":"M. Mitzenmacher. Studying balanced allocations with diffierential equations. Technical Note 1997-024, Digital Equipment Corporation Systems Research Center, Palo Alto, CA, October 1997."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"M. Mitzenmacher, How useful is old information? In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, 1997, pp. 83\u201391. Extended version available as Digital Systems Research Center Technical Note 1998-003.","DOI":"10.1145\/259380.259426"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"V. Stemann. Parallel balanced allocations. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996, pp. 261\u2013269.","DOI":"10.1145\/237502.237565"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:20:29Z","timestamp":1737076829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49543-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651420","9783540495437"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-49543-6_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}