{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:46Z","timestamp":1750220326764,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538561","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"419-421","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Dimitrios","family":"Los","sequence":"first","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498719"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0320-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884481"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32512-0_35"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970444435X"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3288645.3288678"},{"key":"e_1_3_2_1_8_1","volume-title":"Propagation of chaos for a balls into bins model. Electron. Commun. Probab. 24","author":"Cancrini Nicoletta","year":"2019","unstructured":"Nicoletta Cancrini and Gustavo Posta . 2019. Propagation of chaos for a balls into bins model. Electron. Commun. Probab. 24 ( 2019 ), Paper No . 1, 9. https: \/\/doi.org\/10.1214\/18-ECP204 10.1214\/18-ECP204 Nicoletta Cancrini and Gustavo Posta. 2019. Propagation of chaos for a balls into bins model. Electron. Commun. Probab. 24 (2019), Paper No. 1, 9. https: \/\/doi.org\/10.1214\/18-ECP204"},{"key":"e_1_3_2_1_9_1","volume-title":"Mixing time for the repeated balls into bins dynamics. Electron. Commun. Probab. 25","author":"Cancrini Nicoletta","year":"2020","unstructured":"Nicoletta Cancrini and Gustavo Posta . 2020. Mixing time for the repeated balls into bins dynamics. Electron. Commun. Probab. 25 ( 2020 ), Paper No . 60, 14. https:\/\/doi.org\/10.1214\/20-ecp338 10.1214\/20-ecp338 Nicoletta Cancrini and Gustavo Posta. 2020. Mixing time for the repeated balls into bins dynamics. Electron. Commun. Probab. 25 (2020), Paper No. 60, 14. https:\/\/doi.org\/10.1214\/20-ecp338"},{"key":"e_1_3_2_1_10_1","volume-title":"Propagation of chaos for a general balls into bins dynamics. Electron. J. Probab. 26","author":"Cancrini Nicoletta","year":"2021","unstructured":"Nicoletta Cancrini and Gustavo Posta . 2021. Propagation of chaos for a general balls into bins dynamics. Electron. J. Probab. 26 ( 2021 ), Paper No . 23, 20. https: \/\/doi.org\/10.1214\/21-EJP590 10.1214\/21-EJP590 Nicoletta Cancrini and Gustavo Posta. 2021. Propagation of chaos for a general balls into bins dynamics. Electron. J. Probab. 26 (2021), Paper No. 23, 20. https: \/\/doi.org\/10.1214\/21-EJP590"},{"key":"e_1_3_2_1_11_1","volume-title":"18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26--29, 2011. Proceedings (Lecture Notes in Computer Science","volume":"14","author":"Cooper Colin","year":"2011","unstructured":"Colin Cooper . 2011 . Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful. In Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26--29, 2011. Proceedings (Lecture Notes in Computer Science , Vol. 6796), Adrian Kosowski and Masafumi Yamashita (Eds.). Springer, Berlin, Heidelberg, 1-- 14 . https:\/\/doi.org\/10.1007\/978--3--642--22212--2_1 10.1007\/978--3--642--22212--2_1 Colin Cooper. 2011. Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful. In Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26--29, 2011. Proceedings (Lecture Notes in Computer Science, Vol. 6796), Adrian Kosowski and Masafumi Yamashita (Eds.). Springer, Berlin, Heidelberg, 1--14. https:\/\/doi.org\/10.1007\/978--3--642--22212--2_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240010012"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3088"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/93385.93409"},{"key":"e_1_3_2_1_15_1","volume-title":"Jobshop-Like Queueing Systems. Manage. Sci. 50, 12 Supplement (December","author":"Jackson James R.","year":"2004","unstructured":"James R. Jackson . 2004. Jobshop-Like Queueing Systems. Manage. Sci. 50, 12 Supplement (December 2004 ), 1796--1802. https:\/\/doi.org\/10.1287\/mnsc.1040. 0268 10.1287\/mnsc.1040 James R. Jackson. 2004. Jobshop-Like Queueing Systems. Manage. Sci. 50, 12 Supplement (December 2004), 1796--1802. https:\/\/doi.org\/10.1287\/mnsc.1040. 0268"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940878"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/1425912"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.74"},{"volume-title":"Handbook of randomized computing","author":"Mitzenmacher Michael","key":"e_1_3_2_1_19_1","unstructured":"Michael Mitzenmacher , Andr\u00e9a W. Richa , and Ramesh Sitaraman . 2001. The power of two random choices: a survey of techniques and results . In Handbook of randomized computing , Vol. I , II. Comb. Optim., Vol. 9. Kluwer Acad . Publ., Dordrecht, Netherlands, 255--312. https:\/\/doi.org\/10.1007\/978--1--4615-0013--1_9 10.1007\/978--1--4615-0013--1_9 Michael Mitzenmacher, Andr\u00e9a W. Richa, and Ramesh Sitaraman. 2001. The power of two random choices: a survey of techniques and results. In Handbook of randomized computing, Vol. I, II. Comb. Optim., Vol. 9. Kluwer Acad. Publ., Dordrecht, Netherlands, 255--312. https:\/\/doi.org\/10.1007\/978--1--4615-0013--1_9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218015"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000070"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3117606"}],"event":{"name":"SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538561","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:08Z","timestamp":1750191128000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538561"}},"subtitle":["Tight Bounds for Repeated Balls-into-Bins"],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":22,"alternative-id":["10.1145\/3490148.3538561","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538561","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}