{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T10:38:44Z","timestamp":1753180724848,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"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":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210393","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Parallel Minimum Cuts in Near-linear Work and Low Depth"],"prefix":"10.1145","author":[{"given":"Barbara","family":"Geissmann","sequence":"first","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}]},{"given":"Lukas","family":"Gianinazzi","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759076"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470440"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/160688.160704"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"volume-title":"Cache-Oblivious Algorithms and Data Structures. In 9th Scandinavian Workshop on Algorithm, SWAT 2004, Theory, Humlebaek, Denmark, July 8--10, 2004, Proceedings. 3--13","year":"2004","author":"Brodal Gerth St.","key":"e_1_3_2_1_6_1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"e_1_3_2_1_8_1","first-page":"1277","article-title":"Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation","volume":"11","author":"Dinic E. A.","year":"1970","journal-title":"Soviet Math Doklady"},{"volume-title":"Cache-Oblivious Algorithms. In 40th Annual Symposium on Foundations of Computer Science, FOCS 1999","year":"1999","author":"Frigo Matteo","key":"e_1_3_2_1_9_1"},{"volume-title":"Cache Oblivious Minimum Cut. In 10th International Conference on Algorithms and Complexity, CIAC 2017, Athens, Greece, May 24--26, 2017, Proceedings. 285--296","year":"2017","author":"Geissmann Barbara","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1043"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00142-3"},{"key":"e_1_3_2_1_14_1","unstructured":"Maurice Herlihy and Nir Shavit . 2008. The art of multiprocessor programming. Morgan Kaufmann.   Maurice Herlihy and Nir Shavit . 2008. The art of multiprocessor programming. Morgan Kaufmann."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/333115.333124"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331608"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144501387141"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234534"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Richard M. Karp and Vijaya Ramachandran . 1990. Parallel Algorithms for Shared-Memory Machines. Handbook of Theoretical Computer Science Volume A: Algorithms and Complexity (A). 869--942.   Richard M. Karp and Vijaya Ramachandran . 1990. Parallel Algorithms for Shared-Memory Machines. Handbook of Theoretical Computer Science Volume A: Algorithms and Complexity (A). 869--942.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746588"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.43"},{"volume-title":"Computing Edge-Connectivity in Multiple and Capacitated Graphs International Symposium on Algorithms, SIGAL 1990, Tokyo, Japan, August 16--18, 1990, Proceedings. 12--20","year":"1990","author":"Nagamochi Hiroshi","key":"e_1_3_2_1_22_1"},{"key":"e_1_3_2_1_23_1","unstructured":"Christos H. Papadimitriou and Kenneth Steiglitz . 1998. Combinatorial optimization: algorithms and complexity pages 117--120. Courier Corporation. 117--120 pages.  Christos H. Papadimitriou and Kenneth Steiglitz . 1998. Combinatorial optimization: algorithms and complexity pages 117--120. Courier Corporation. 117--120 pages."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447256"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/3219302.3219303"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0820"},{"key":"e_1_3_2_1_27_1","unstructured":"John H. Reif . 1993. Synthesis of Parallel Algorithms (bibinfoedition1st ed.). Morgan Kaufmann Publishers Inc. San Francisco CA USA.   John H. Reif . 1993. Synthesis of Parallel Algorithms (bibinfoedition1st ed.). Morgan Kaufmann Publishers Inc. San Francisco CA USA."},{"volume-title":"ISMB 2000","year":"2000","author":"Sharan Roded","key":"e_1_3_2_1_28_1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90013-X"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263872"}],"event":{"name":"SPAA '18: 30th 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":"Vienna Austria","acronym":"SPAA '18"},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210393","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:13Z","timestamp":1750208893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":31,"alternative-id":["10.1145\/3210377.3210393","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210393","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}