{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T01:23:16Z","timestamp":1776993796252,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,24]],"date-time":"2008-08-24T00:00:00Z","timestamp":1219536000000},"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":[[2008,8,24]]},"DOI":"10.1145\/1401890.1401898","type":"proceedings-article","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T11:56:41Z","timestamp":1219838201000},"page":"16-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":220,"title":["Efficient semi-streaming algorithms for local triangle counting in massive graphs"],"prefix":"10.1145","author":[{"given":"Luca","family":"Becchetti","sequence":"first","affiliation":[{"name":"Sapienza Universit\u00e0 di Roma, Rome, Italy"}]},{"given":"Paolo","family":"Boldi","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Milano, Milan, Italy"}]},{"given":"Carlos","family":"Castillo","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Barcelona, Spain"}]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Barcelona, Spain"}]}],"member":"320","published-online":{"date-parts":[[2008,8,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_1_2_1","volume-title":"SODA","author":"Bar-Yossef Z.","year":"2002","unstructured":"Z. Bar-Yossef , R. Kumar , and D. Sivakumar . Reductions in streaming algorithms, with an application to counting triangles in graphs . In SODA , 2002 . Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In SODA, 2002."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(01)00035-1"},{"key":"e_1_3_2_1_4_1","first-page":"7","article-title":"Min-wise independent linear permutations","author":"Bohman T.","year":"2000","unstructured":"T. Bohman , C. Cooper , and A. M. Frieze . Min-wise independent linear permutations . Electr. J. Comb , 7 , 2000 . T. Bohman, C. Cooper, and A. M. Frieze. Min-wise independent linear permutations. Electr. J. Comb, 7, 2000.","journal-title":"Electr. J. Comb"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_6_1","volume-title":"Compression and Complexity of Sequences","author":"Broder A. Z.","year":"1998","unstructured":"A. Z. Broder . On the resemblance and containment of documents . In Compression and Complexity of Sequences , IEEE Computer Society , 1998 . A. Z. Broder. On the resemblance and containment of documents. In Compression and Complexity of Sequences, IEEE Computer Society, 1998."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/647819.736184"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276781"},{"key":"e_1_3_2_1_9_1","volume-title":"WWW","author":"Broder A. Z.","year":"1997","unstructured":"A. Z. Broder , S. C. Glassman , M. S. Manasse , and G. Zweig . Syntactic clustering of the web . In WWW , 1997 . A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the web. In WWW, 1997."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142388"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189702.1189703"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277814"},{"key":"e_1_3_2_1_13_1","volume-title":"SODA","author":"Coppersmith D.","year":"2004","unstructured":"D. Coppersmith and R. Kumar . An improved data stream algorithm for frequency moments . In SODA , 2004 . D. Coppersmith and R. Kumar. An improved data stream algorithm for frequency moments. In SODA, 2004."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109635"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.032093399"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_46"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017074.1017077"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060839"},{"key":"e_1_3_2_1_20_1","volume-title":"VLDB","author":"Gibson D.","year":"2005","unstructured":"D. Gibson , R. Kumar , and A. Tomkins . Discovering large dense subgraphs in massive graphs . In VLDB , 2005 . D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, 2005."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062745.1062789"},{"key":"e_1_3_2_1_22_1","volume-title":"Efficient computation of pagerank. Technical report","author":"Haveliwala T.","year":"1999","unstructured":"T. Haveliwala . Efficient computation of pagerank. Technical report , Stanford University , 1999 . T. Haveliwala. Efficient computation of pagerank. Technical report, Stanford University, 1999."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"M. R.\n      Henzinger P.\n      Raghavan and \n      S.\n      Rajagopalan\n  . \n  Computing on data streams\n  . \n  Dimacs Series In Discrete Mathematics And Theoretical Computer Science pages \n  107\n  --\n  118 1999\n  .   M. R. Henzinger P. Raghavan and S. Rajagopalan. Computing on data streams. Dimacs Series In Discrete Mathematics And Theoretical Computer Science pages 107--118 1999.","DOI":"10.1090\/dimacs\/050\/05"},{"key":"e_1_3_2_1_24_1","volume-title":"SODA","author":"Indyk P.","year":"1999","unstructured":"P. Indyk . A small approximately min-wise independent family of hash functions . In SODA , 1999 . P. Indyk. A small approximately min-wise independent family of hash functions. In SODA, 1999."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0207033"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_54"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/384192.384193"},{"issue":"2","key":"e_1_3_2_1_32_1","article-title":"Visualizing the signatures of social roles in online discussion groups","volume":"8","author":"Welser H. T.","year":"2007","unstructured":"H. T. Welser , E. Gleave , D. Fisher , and M. Smith . Visualizing the signatures of social roles in online discussion groups . The Journal of Social Structure , 8 ( 2 ), 2007 . H. T. Welser, E. Gleave, D. Fisher, and M. Smith. Visualizing the signatures of social roles in online discussion groups. The Journal of Social Structure, 8(2), 2007.","journal-title":"The Journal of Social Structure"}],"event":{"name":"KDD08: The 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Las Vegas Nevada USA","acronym":"KDD08","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401898","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1401890.1401898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:40Z","timestamp":1750255000000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,24]]},"references-count":32,"alternative-id":["10.1145\/1401890.1401898","10.1145\/1401890"],"URL":"https:\/\/doi.org\/10.1145\/1401890.1401898","relation":{},"subject":[],"published":{"date-parts":[[2008,8,24]]},"assertion":[{"value":"2008-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}