{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:14Z","timestamp":1772164094588,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,2,10]],"date-time":"2018-02-10T00:00:00Z","timestamp":1518220800000},"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,2,10]]},"DOI":"10.1145\/3178487.3178504","type":"proceedings-article","created":{"date-parts":[[2018,2,6]],"date-time":"2018-02-06T13:12:23Z","timestamp":1517922743000},"page":"219-232","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Communication-avoiding parallel minimum cuts and connected components"],"prefix":"10.1145","author":[{"given":"Lukas","family":"Gianinazzi","sequence":"first","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Kalvoda","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"De Palma","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Besta","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,2,10]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/647908.740141"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277662"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Friedhelm Meyer auf der Heide and Gabriel T. Martinez. 1998. Communication-efficient parallel multiway and approximate minimum cut computation. In LATIN'98: Theoretical Informatics. Springer 316--330.   Friedhelm Meyer auf der Heide and Gabriel T. Martinez. 1998. Communication-efficient parallel multiway and approximate minimum cut computation. In LATIN'98: Theoretical Informatics. Springer 316--330.","DOI":"10.1007\/BFb0054332"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-2010-2"},{"key":"e_1_3_2_2_6_1","volume-title":"Proceedings of the Fourth SIAM International Conference on Data Mining","author":"Chakrabarti Deepayan","year":"2004"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/325096.325150"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0109-4"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"e_1_3_2_2_10_1","unstructured":"L.R. Ford and Delbert R. Fulkerson. 1962. Flows in networks. Vol. 1962. Princeton Princeton University Press.  L.R. Ford and Delbert R. Fulkerson. 1962. Flows in networks. Vol. 1962. Princeton Princeton University Press."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071383"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.9"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Barbara Geissmann and Lukas Gianinazzi. 2017. Cache Oblivious Minimum Cut. Springer International Publishing Cham 285--296.  Barbara Geissmann and Lukas Gianinazzi. 2017. Cache Oblivious Minimum Cut. Springer International Publishing Cham 285--296.","DOI":"10.1007\/978-3-319-57586-5_24"},{"key":"e_1_3_2_2_14_1","volume-title":"Proceedings of a DIMACS Workshop","author":"Goddard Steve","year":"1994"},{"key":"e_1_3_2_2_15_1","first-page":"1","article-title":"The parallel BGL: A generic library for distributed graph computations","volume":"2","author":"Gregor Douglas","year":"2005","journal-title":"Parallel Object-Oriented Scientific Computing (POOSC)"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/313852.314099"},{"key":"e_1_3_2_2_17_1","volume-title":"Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 165--174","author":"Hao Jianxiu"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807644"},{"key":"e_1_3_2_2_19_1","volume-title":"Recent Advances in the Message Passing Interface - 17th European MPI Users' Group Meeting","author":"Hoefler Torsten","year":"2010"},{"key":"e_1_3_2_2_20_1","unstructured":"Mark Hoemmen. 2010. Communication-avoiding Krylov Subspace Methods. Ph.D. Dissertation. Berkeley CA USA. Advisor(s) Demmel James W. AAI3413388.   Mark Hoemmen. 2010. Communication-avoiding Krylov Subspace Methods. Ph.D. Dissertation. Berkeley CA USA. Advisor(s) Demmel James W. AAI3413388."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2003.10.012"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331608"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144501387141"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/201019.201022"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234534"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1394608.1382129"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Jean-Yves Le Boudec. 2010. Performance evaluation of computer and communication systems. EPFL Press.  Jean-Yves Le Boudec. 2010. Performance evaluation of computer and communication systems. EPFL Press.","DOI":"10.1201\/b16328"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405004"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC.2012.83"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.06.025"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1022594.1022596"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-007-0012-0"},{"key":"e_1_3_2_2_35_1","unstructured":"Michael Oser Rabin. 1976. Probablistic Algorithms. In Algorithms and Complexity Joseph F. Traub (Ed.). Academic Press 21--36.  Michael Oser Rabin. 1976. Probablistic Algorithms. In Algorithms and Complexity Joseph F. Traub (Ed.). Academic Press 21--36."},{"key":"e_1_3_2_2_36_1","unstructured":"John H. Reif. 1993. Synthesis of Parallel Algorithms (1st ed.). Morgan Kaufmann Publishers Inc. San Francisco CA USA.   John H. Reif. 1993. Synthesis of Parallel Algorithms (1st ed.). Morgan Kaufmann Publishers Inc. San Francisco CA USA."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73045"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063405"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"e_1_3_2_2_40_1","volume-title":"Proc Int Conf Intell Syst Mol Biol","volume":"8","author":"Sharan Roded","year":"2000"},{"key":"e_1_3_2_2_41_1","unstructured":"Jeremy G. Siek Lie-Quan Lee and Andrew Lumsdaine. 2001. Boost Graph Library: User Guide and Reference Manual The. Pearson Education.  Jeremy G. Siek Lie-Quan Lee and Andrew Lumsdaine. 2001. Boost Graph Library: User Guide and Reference Manual The. Pearson Education."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1776656.1776677"},{"key":"e_1_3_2_2_43_1","unstructured":"Marc Snir. 1998. MPI-the Complete Reference: The MPI core. Vol. 1. MIT press.   Marc Snir. 1998. MPI-the Complete Reference: The MPI core. Vol. 1. MIT press."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206006"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263872"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/0734-189X(90)90008-J"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"Duncan J. Watts and Steven H Strogatz. 1998. Collective Dynamics of small-world networks. Nature 393 (1998).  Duncan J. Watts and Steven H Strogatz. 1998. Collective Dynamics of small-world networks. Nature 393 (1998).","DOI":"10.1038\/30918"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1166253.1166292"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2016.02.003"}],"event":{"name":"PPoPP '18: 23nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Vienna Austria","acronym":"PPoPP '18","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178487.3178504","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3178487.3178504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:39:08Z","timestamp":1750196348000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178487.3178504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,10]]},"references-count":50,"alternative-id":["10.1145\/3178487.3178504","10.1145\/3178487"],"URL":"https:\/\/doi.org\/10.1145\/3178487.3178504","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3200691.3178504","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2018,2,10]]},"assertion":[{"value":"2018-02-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}