{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:09:20Z","timestamp":1766268560732,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T00:00:00Z","timestamp":1517529600000},"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,2]]},"DOI":"10.1145\/3159652.3159696","type":"proceedings-article","created":{"date-parts":[[2018,2,6]],"date-time":"2018-02-06T18:12:23Z","timestamp":1517940743000},"page":"540-546","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Shortcutting Label Propagation for Distributed Connected Components"],"prefix":"10.1145","author":[{"given":"Stergios","family":"Stergiou","sequence":"first","affiliation":[{"name":"Google & Yahoo Research, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dipen","family":"Rughwani","sequence":"additional","affiliation":[{"name":"Yahoo Research, Sunnyvale, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Tsioutsiouliklis","sequence":"additional","affiliation":[{"name":"Yahoo Research, Sunnyvale, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,2,2]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2016. Common Crawl. (2016). http:\/\/commoncrawl.org\/.  2016. Common Crawl. (2016). http:\/\/commoncrawl.org\/."},{"key":"e_1_3_2_1_2_1","unstructured":"2016. Twitter Graph. (2016). http:\/\/konect.uni-koblenz.de\/networks\/twitter_mpi.  2016. Twitter Graph. (2016). http:\/\/konect.uni-koblenz.de\/networks\/twitter_mpi."},{"volume-title":"A parallel O (log N) algorithm for finding connected components in planar images","author":"Agrawal Ajit","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676869"},{"key":"e_1_3_2_1_5_1","first-page":"175","article-title":"New Connectivity and MSF Algorithms for Ultracomputer and PRAM","volume":"83","author":"Awerbuch Baruch","year":"1983","journal-title":"ICPP"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.03.011"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2005.55"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0079"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2011.6152655"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480506.1480511"},{"volume-title":"Automated Reasoning","author":"Boyer Robert S","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/648138.746654"},{"volume-title":"High Performance Computing and Simulation (HPCS)","year":"2010","author":"C\u00e1ceres Edson Norberto","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/358628.358650"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1016"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/237502.237563"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90019-X"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454225"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498231"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220066"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0078"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1146"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/79147.214077"},{"key":"e_1_3_2_1_26_1","unstructured":"Andreas Harth. 2009. Billion Triples Challenge data set. Downloaded from http:\/\/km.aifb.kit.edu\/projects\/btc-2009\/. (2009).  Andreas Harth. 2009. Billion Triples Challenge data set. Downloaded from http:\/\/km.aifb.kit.edu\/projects\/btc-2009\/. (2009)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2010.07.002"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/359138.359141"},{"volume-title":"October 17--19","year":"1994","author":"Hsu Tsan-Sheng","key":"e_1_3_2_1_29_1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1009"},{"volume-title":"An introduction to parallel algorithms","author":"J\u00e1J\u00e1 Joseph","key":"e_1_3_2_1_31_1"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1291"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"volume-title":"Ccf: Fast and scalable connected component computation in mapreduce. In ICNC","year":"2014","author":"Kardes Hakan","key":"e_1_3_2_1_34_1"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/140901.141920"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670979.2670997"},{"volume-title":"Fund. of Computation Theory","author":"Koubek V\u00e1clav","key":"e_1_3_2_1_37_1"},{"key":"e_1_3_2_1_38_1","first-page":"1","article-title":"Connected components on distributed memory machines","volume":"30","author":"Krishnamurthy Arvind","year":"1997","journal-title":"Third DIMACS Implementation Challenge"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840376"},{"volume-title":"ConnectedComponents Algorithms For Mesh-Connected Parallel Computers. In 3rd Dimacs Implementation Challenge Workshop.","year":"1995","author":"Kumar Subodh","key":"e_1_3_2_1_40_1"},{"volume-title":"A fast parallel algorithm for labeling connected components in image arrays","author":"Lim Willie","key":"e_1_3_2_1_41_1"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2591038"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90131-4"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267822"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0053"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.79"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700371065"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/72935.72952"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/646340.686427"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544813"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90013-X"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612692"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.64"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2010.5470817"},{"volume-title":"Distributed Negative Sampling for Word Embeddings. In AAAI Conference on Artificial Intelligence","year":"2017","author":"Stergiou Stergios","key":"e_1_3_2_1_56_1"}],"event":{"name":"WSDM 2018: The Eleventh ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Marina Del Rey CA USA","acronym":"WSDM 2018"},"container-title":["Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3159652.3159696","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3159652.3159696","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:12Z","timestamp":1750213572000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3159652.3159696"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,2]]},"references-count":56,"alternative-id":["10.1145\/3159652.3159696","10.1145\/3159652"],"URL":"https:\/\/doi.org\/10.1145\/3159652.3159696","relation":{},"subject":[],"published":{"date-parts":[[2018,2,2]]},"assertion":[{"value":"2018-02-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}