{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T13:14:02Z","timestamp":1770297242556,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100008398","name":"Villum Fonden","doi-asserted-by":"publisher","award":["16582"],"award-info":[{"award-number":["16582"]}],"id":[{"id":"10.13039\/100008398","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323202","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"49-58","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Dynamic Algorithms for the Massively Parallel Computation Model"],"prefix":"10.1145","author":[{"given":"Giuseppe F.","family":"Italiano","sequence":"first","affiliation":[{"name":"LUISS University, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Lattanzi","sequence":"additional","affiliation":[{"name":"Google, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahab S.","family":"Mirrokni","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Parotsidis","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Copenhagen, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039714"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154855"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591805"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00070"},{"key":"e_1_3_2_1_5_1","first-page":"1","volume-title":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018","volume":"107","author":"Arar M.","year":"2018","unstructured":"M. Arar , S. Chechik , S. Cohen , C. Stein , and D. Wajc . Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018 ), volume 107 , pages 7: 1 -- 7 :16, 2018 . M. Arar, S. Chechik, S. Cohen, C. Stein, and D. Wajc. Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), volume 107, pages 7:1--7:16, 2018."},{"key":"e_1_3_2_1_6_1","first-page":"1616","volume-title":"Coresets meet edcs: algorithms for matching and vertex cover on massive graphs. In Proc. of the 30th Annual ACM-SIAM Symp. on Discrete Algorithms","author":"Assadi S.","year":"2019","unstructured":"S. Assadi , M. Bateni , A. Bernstein , V. Mirrokni , and C. Stein . Coresets meet edcs: algorithms for matching and vertex cover on massive graphs. In Proc. of the 30th Annual ACM-SIAM Symp. on Discrete Algorithms , pages 1616 -- 1635 , 2019 . S. Assadi, M. Bateni, A. Bernstein, V. Mirrokni, and C. Stein. Coresets meet edcs: algorithms for matching and vertex cover on massive graphs. In Proc. of the 30th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 1616--1635, 2019."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188922"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.89"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465224"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.115"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933083"},{"key":"e_1_3_2_1_12_1","first-page":"1","volume-title":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018","author":"Charikar M.","year":"2018","unstructured":"M. Charikar and S. Solomon . Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018 ), pages 33: 1 -- 33 :14, 2018 . M. Charikar and S. Solomon. Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), pages 33:1--33:14, 2018."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544813"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188764"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039492"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212743"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.99"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"e_1_3_2_1_19_1","volume-title":"Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM (JACM), 46(4):502--516","author":"Henzinger M. R.","year":"1999","unstructured":"M. R. Henzinger and V. King . Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM (JACM), 46(4):502--516 , 1999 . M. R. Henzinger and V. King. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM (JACM), 46(4):502--516, 1999."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502095"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90144-4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_1_24_1","volume-title":"V. Mirrokni, and M. W\u0142odarczyk. Connected components at scale via local contractions. arXiv preprint arXiv:1807.10727","author":"J.","year":"2018","unstructured":"J. \u0141ka cki , V. Mirrokni, and M. W\u0142odarczyk. Connected components at scale via local contractions. arXiv preprint arXiv:1807.10727 , 2018 . J. \u0141ka cki, V. Mirrokni, and M. W\u0142odarczyk. Connected components at scale via local contractions. arXiv preprint arXiv:1807.10727, 2018."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378558"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2591038"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.92"},{"key":"e_1_3_2_1_29_1","volume-title":"Simple deterministic algorithms for fully dynamic maximal matching. ACM Transactions on Algorithms (TALG), 12(1):7","author":"Neiman O.","year":"2016","unstructured":"O. Neiman and S. Solomon . Simple deterministic algorithms for fully dynamic maximal matching. ACM Transactions on Algorithms (TALG), 12(1):7 , 2016 . O. Neiman and S. Solomon. Simple deterministic algorithms for fully dynamic maximal matching. ACM Transactions on Algorithms (TALG), 12(1):7, 2016."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.43"},{"key":"e_1_3_2_1_31_1","first-page":"5600","volume-title":"Proc. of the 35th International Conference on Machine Learning","volume":"80","author":"Yaroslavtsev G.","year":"2018","unstructured":"G. Yaroslavtsev and A. Vadapalli . Massively parallel algorithms and hardness for single-linkage clustering under $ell_p$ distances . In Proc. of the 35th International Conference on Machine Learning , volume 80 , pages 5600 -- 5609 , 10--15 Jul 2018 . G. Yaroslavtsev and A. Vadapalli. Massively parallel algorithms and hardness for single-linkage clustering under $ell_p$ distances. In Proc. of the 35th International Conference on Machine Learning, volume 80, pages 5600--5609, 10--15 Jul 2018."}],"event":{"name":"SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures","location":"Phoenix AZ USA","acronym":"SPAA '19","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"]},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:16Z","timestamp":1750202596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":31,"alternative-id":["10.1145\/3323165.3323202","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323202","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}