{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,27]],"date-time":"2026-08-27T23:10:24Z","timestamp":1787872224345,"version":"build-2784847793"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Vetenskapsr\u00e5det","award":["2015-04659"],"award-info":[{"award-number":["2015-04659"]}]},{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["715672"],"award-info":[{"award-number":["715672"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384334","type":"proceedings-article","created":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T21:48:36Z","timestamp":1624916916000},"page":"496-509","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Weighted min-cut: sequential, cut-query, and streaming algorithms"],"prefix":"10.1145","author":[{"given":"Sagnik","family":"Mukhopadhyay","sequence":"first","affiliation":[{"name":"KTH, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4468-2675","authenticated-orcid":false,"given":"Danupon","family":"Nanongkai","sequence":"additional","affiliation":[{"name":"KTH, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Analyzing graph structure via linear measurements","author":"Ahn Kook Jin"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213560"},{"key":"e_1_3_2_1_3_1","first-page":"265","article-title":"Polynomial pass lower bounds for graph streaming algorithms","author":"Assadi Sepehr","year":"2019","journal-title":"STOC. ACM"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.39"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.15"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217026"},{"key":"e_1_3_2_1_7_1","volume-title":"A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. CoRR abs\/","author":"Chuzhoy Julia","year":"1910"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.013"},{"key":"e_1_3_2_1_9_1","volume-title":"Minimum Cut in ( log2 ) Time. arXiv:cs.DS\/","author":"Gawrychowski Pawe\u0142","year":"1911"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Mohsen Ghafari Krzysztof Nowicki and Mikkel Thorup. 2020. Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. In SODA. SIAM.  Mohsen Ghafari Krzysztof Nowicki and Mikkel Thorup. 2020. Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. In SODA. SIAM.","DOI":"10.1137\/1.9781611975994.77"},{"key":"e_1_3_2_1_11_1","unstructured":"Ashish Goel Michael Kapralov and Ian Post. 2012. Single pass sparsification in the streaming model with edge deletions. CoRR abs\/1203.4900 ( 2012 ).  Ashish Goel Michael Kapralov and Ian Post. 2012. Single pass sparsification in the streaming model with edge deletions. CoRR abs\/1203.4900 ( 2012 )."},{"key":"e_1_3_2_1_12_1","volume-title":"Local Flow Partitioning for Faster Edge Connectivity","author":"Henzinger Monika","year":"1919"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/320211.320215"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502095"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/141002281"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.81"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331608"},{"key":"e_1_3_2_1_18_1","article-title":"Deterministic Edge Connectivity in Near-Linear Time","volume":"66","author":"Mikkel Thorup Kawarabayashi","year":"2019","journal-title":"J. ACM"},{"key":"e_1_3_2_1_19_1","volume-title":"A Simple Algorithm for Minimum Cuts in Near-Linear Time. CoRR abs\/","author":"Lovett Antonio Molina","year":"1908"},{"key":"e_1_3_2_1_20_1","volume-title":"Cut-Query and Streaming Algorithms. CoRR abs\/","author":"Mukhopadhyay Sagnik","year":"1911"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"J. Ian Munro Yakov Nekrich and Jefrey Scott Vitter. 2016. Fast construction of wavelet trees. Theor. Comput. Sci. 638 ( 2016 ) 91-97.  J. Ian Munro Yakov Nekrich and Jefrey Scott Vitter. 2016. Fast construction of wavelet trees. Theor. Comput. Sci. 638 ( 2016 ) 91-97.","DOI":"10.1016\/j.tcs.2015.11.011"},{"key":"e_1_3_2_1_22_1","first-page":"950","article-title":"Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time","author":"Nanongkai Danupon","year":"2017","journal-title":"FOCS. IEEE Computer Society"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90041-7"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2018.39"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-0045-2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Jefrey Scott Vitter. 1985. Random sampling with a reservoir. ACM Trans. Math. Software 11 ( 1985 ) 37-57.  Jefrey Scott Vitter. 1985. Random sampling with a reservoir. ACM Trans. Math. Software 11 ( 1985 ) 37-57.","DOI":"10.1145\/3147.3165"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.126"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.10.017"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384334","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384334","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:57Z","timestamp":1750199577000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":29,"alternative-id":["10.1145\/3357713.3384334","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384334","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}