{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:15Z","timestamp":1750306335281,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,25]],"date-time":"2016-07-25T00:00:00Z","timestamp":1469404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100009059","name":"Pacific Institute for Mathematical Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009059","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["01IH13004"],"award-info":[{"award-number":["01IH13004"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,25]]},"DOI":"10.1145\/2933057.2933092","type":"proceedings-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T20:07:42Z","timestamp":1469563662000},"page":"83-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Self-stabilizing Balls & Bins in Batches"],"prefix":"10.1145","author":[{"given":"Petra","family":"Berenbrink","sequence":"first","affiliation":[{"name":"Simon Fraser University & University of Hamburg, Burnaby, BC, Canada"}]},{"given":"Tom","family":"Friedetzky","sequence":"additional","affiliation":[{"name":"Durham University, Durham, United Kingdom"}]},{"given":"Peter","family":"Kling","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, BC, Canada"}]},{"given":"Frederik","family":"Mallmann-Trenn","sequence":"additional","affiliation":[{"name":"\u00c9cole normale sup\u00e9rieure & Simon Fraser University, Paris, France"}]},{"given":"Lars","family":"Nagel","sequence":"additional","affiliation":[{"name":"Johannes Gutenberg-Universit\u00e4t Mainz, Mainz, Germany"}]},{"given":"Christopher","family":"Wastell","sequence":"additional","affiliation":[{"name":"Durham University, Durham, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2016,7,25]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5555\/647908.740138"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1002\/(SICI)1098-2418(199809)13:2%3C159::AID-RSA3%3E3.0.CO;2-Q"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1239\/aap\/1067436338"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1137\/S0097539795288490"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/2755573.2755584"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/341800.341813"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1137\/S009753970444435X"},{"doi-asserted-by":"crossref","unstructured":"P.\n      Berenbrink A.\n      Czumaj M.\n      Englert T.\n      Friedetzky and \n      L.\n      Nagel\n  . \n  Multiple-choice balanced allocation in (almost) parallel\n  . In A. Gupta K. Jansen J. Rolim and R. Servedio editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques volume \n  7408\n   of \n  Lecture Notes in Computer Science pages \n  411\n  --\n  422\n  . \n  Springer Berlin Heidelberg 2012\n  . ISBN 978-3-642-32511-3. 10.1007\/978-3-642-32512-0_35. URL http:\/\/dx.doi.org\/10.1007\/978-3-642-32512-0_35.    10.1007\/978-3-642-32512-0_35\nP. Berenbrink A. Czumaj M. Englert T. Friedetzky and L. Nagel. Multiple-choice balanced allocation in (almost) parallel. In A. Gupta K. Jansen J. Rolim and R. Servedio editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques volume 7408 of Lecture Notes in Computer Science pages 411--422. Springer Berlin Heidelberg 2012. ISBN 978-3-642-32511-3. 10.1007\/978-3-642-32512-0_35. URL http:\/\/dx.doi.org\/10.1007\/978-3-642-32512-0_35.","key":"e_1_3_2_1_8_1","DOI":"10.1007\/978-3-642-32512-0_35"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/2486159.2486191"},{"key":"e_1_3_2_1_10_1","volume-title":"Self-stabilizing balls & bins in batches. CoRR, abs\/1603.02188","author":"Berenbrink P.","year":"2016","unstructured":"P. Berenbrink , T. Friedetzky , P. Kling , F. Mallmann-Trenn , L. Nagel , and C. Wastell . Self-stabilizing balls & bins in batches. CoRR, abs\/1603.02188 , 2016 . URL http:\/\/arxiv.org\/abs\/1603.02188. P. Berenbrink, T. Friedetzky, P. Kling, F. Mallmann-Trenn, L. Nagel, and C. Wastell. Self-stabilizing balls & bins in batches. CoRR, abs\/1603.02188, 2016. URL http:\/\/arxiv.org\/abs\/1603.02188."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/277651.277686"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.5555\/795663.796355"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511984020","volume-title":"Topics in the Constructive Theory of Countable Markov Chains","author":"Fayolle G.","year":"1995","unstructured":"G. Fayolle , V. Malyshev , and M. Menshikov . Topics in the Constructive Theory of Countable Markov Chains . Cambridge University Press , 1995 . ISBN 9780521461979. URL https:\/\/books.google.ca\/books?id=lTJltFEnnHcC. G. Fayolle, V. Malyshev, and M. Menshikov. Topics in the Constructive Theory of Countable Markov Chains. Cambridge University Press, 1995. ISBN 9780521461979. URL https:\/\/books.google.ca\/books?id=lTJltFEnnHcC."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/322248.322254"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.2307\/1426671"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.5555\/1895807.1895845"},{"key":"e_1_3_2_1_17_1","volume-title":"A complete and simple solution to a discrete-time finite-capacity bmap\/d\/c queue","author":"Kim N. K.","year":"2012","unstructured":"N. K. Kim , M. L. Chaudhry , B. K. Yoon , and K. Kim . A complete and simple solution to a discrete-time finite-capacity bmap\/d\/c queue . 2012 . N. K. Kim, M. L. Chaudhry, B. K. Yoon, and K. Kim. A complete and simple solution to a discrete-time finite-capacity bmap\/d\/c queue. 2012."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1090\/mbk\/058"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/71.963420"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.5555\/1873601.1873732"},{"key":"e_1_3_2_1_21_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-49543-6_13","volume-title":"Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98","author":"Raab M.","year":"1998","unstructured":"M. Raab and A. Steger . \" balls into bins\" - A simple and tight analysis . In M. Luby, J. D. P. Rolim, and M. J. Serna, editors, Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98 , Barcelona, Spain, October 8-10, 1998 , Proceedings, volume 1518 of Lecture Notes in Computer Science , pages 159 -- 170 . Springer , 1998. ISBN 3-540-65142-X. 10.1007\/3-540-49543-6_13. URL http:\/\/dx.doi.org\/10.1007\/3--540--49543--6_13. 10.1007\/3--540--49543--6_13 M. Raab and A. Steger. \"balls into bins\" - A simple and tight analysis. In M. Luby, J. D. P. Rolim, and M. J. Serna, editors, Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings, volume 1518 of Lecture Notes in Computer Science, pages 159--170. Springer, 1998. ISBN 3-540-65142-X. 10.1007\/3-540-49543-6_13. URL http:\/\/dx.doi.org\/10.1007\/3--540--49543--6_13."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.5555\/131408.131463"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/237502.237565"},{"unstructured":"K.\n      Talwar\n     and \n      U.\n      Wieder\n  . \n  Balanced allocations: A simple proof for the heavily loaded case\n  . In J. Esparza P. Fraigniaud T. Husfeldt and E. Koutsoupias editors Automata Languages and Programming volume \n  8572\n   of \n  Lecture Notes in Computer Science pages \n  979\n  --\n  990\n  . \n  Springer Berlin Heidelberg 2014\n  . ISBN 978-3-662-43947-0. 10.1007\/978-3-662-43948-7_81. URL http:\/\/dx.doi.org\/10.1007\/978--3--662--43948--7_81.    10.1007\/978--3--662--43948--7_81\nK. Talwar and U. Wieder. Balanced allocations: A simple proof for the heavily loaded case. In J. Esparza P. Fraigniaud T. Husfeldt and E. Koutsoupias editors Automata Languages and Programming volume 8572 of Lecture Notes in Computer Science pages 979--990. Springer Berlin Heidelberg 2014. ISBN 978-3-662-43947-0. 10.1007\/978-3-662-43948-7_81. URL http:\/\/dx.doi.org\/10.1007\/978--3--662--43948--7_81.","key":"e_1_3_2_1_24_1"}],"event":{"sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"PODC '16","name":"PODC '16: ACM Symposium on Principles of Distributed Computing","location":"Chicago Illinois USA"},"container-title":["Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933092","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933057.2933092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:51Z","timestamp":1750222491000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933092"}},"subtitle":["The Power of Leaky Bins [Extended Abstract]"],"short-title":[],"issued":{"date-parts":[[2016,7,25]]},"references-count":24,"alternative-id":["10.1145\/2933057.2933092","10.1145\/2933057"],"URL":"https:\/\/doi.org\/10.1145\/2933057.2933092","relation":{},"subject":[],"published":{"date-parts":[[2016,7,25]]},"assertion":[{"value":"2016-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}