{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:49:25Z","timestamp":1773481765696,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/icde.2013.6544813","type":"proceedings-article","created":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T19:02:52Z","timestamp":1372273372000},"page":"50-61","source":"Crossref","is-referenced-by-count":68,"title":["Finding connected components in map-reduce in logarithmic rounds"],"prefix":"10.1109","author":[{"given":"V.","family":"Rastogi","sequence":"first","affiliation":[]},{"given":"A.","family":"Machanavajjhala","sequence":"additional","affiliation":[]},{"given":"L.","family":"Chitnis","sequence":"additional","affiliation":[]},{"given":"Anish","family":"Das Sarma","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","author":"reif","year":"1985","journal-title":"Optimal Parallel Algorithms for Interger Sorting and Graph Connectivity"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2011.02.004"},{"key":"18","author":"rastogi","year":"2012","journal-title":"Finding Connected Components in Map-reduce in Logarithmic Rounds"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.2200\/S00274ED1V01Y201006HLT007"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"13","article-title":"Connected components on distributed memory machines","author":"krishnamurthy","year":"1994","journal-title":"Parallel Algorithms 3rd DIMACS Implementation Challenge"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90058-5"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979325247X"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.76"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90008-6"},{"key":"3","doi-asserted-by":"crossref","DOI":"10.1609\/icwsm.v4i1.14033","article-title":"Measuring user influence in twitter: The million follower fallacy","author":"cha","year":"2010","journal-title":"ICWSM"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33460-3_35"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920881"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951367"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1851476.1851593"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"4","article-title":"Giraph: Large-scale graph processing on hadoop","author":"ching","year":"2010","journal-title":"Hadoop Summit"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1291"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/0220066"}],"event":{"name":"2013 29th IEEE International Conference on Data Engineering (ICDE 2013)","location":"Brisbane, QLD","start":{"date-parts":[[2013,4,8]]},"end":{"date-parts":[[2013,4,12]]}},"container-title":["2013 IEEE 29th International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6530811\/6544790\/06544813.pdf?arnumber=6544813","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T02:08:19Z","timestamp":1715566099000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6544813\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/icde.2013.6544813","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}