{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,31]],"date-time":"2026-10-31T11:03:14Z","timestamp":1793444594472,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,28]],"date-time":"2009-06-28T00:00:00Z","timestamp":1246147200000},"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":[[2009,6,28]]},"DOI":"10.1145\/1557019.1557111","type":"proceedings-article","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T09:10:54Z","timestamp":1246353054000},"page":"837-846","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":227,"title":["DOULION"],"prefix":"10.1145","author":[{"given":"Charalampos E.","family":"Tsourakakis","sequence":"first","affiliation":[{"name":"CARNEGIE MELLON UNIVERSITY, PITTSBURGH, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"U.","family":"Kang","sequence":"additional","affiliation":[{"name":"CARNEGIE MELLON UNIVERSITY, PITTSBURGH, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gary L.","family":"Miller","sequence":"additional","affiliation":[{"name":"CARNEGIE MELLON UNIVERSITY, PITTSBURGH, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[{"name":"CARNEGIE MELLON UNIVERSITY, PITTSBURGH, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,6,28]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380858"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"Alon N.","year":"2000","unstructured":"N. Alon and S. Joel . The Probabilistic Method . Wiley Interscience , New York , second edition, 2000 . N. Alon and S. Joel. The Probabilistic Method. Wiley Interscience, New York, second edition, 2000."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_2_5_1","first-page":"623","volume-title":"SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms","author":"Bar-Yosseff Z.","year":"2002","unstructured":"Z. Bar-Yosseff , R. Kumar , and D. Sivakumar . Reductions in streaming algorithms, with an application to counting triangles in graphs . In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms , pages 623 -- 632 , Philadelphia, PA, USA , 2002 . Society for Industrial and Applied Mathematics. Z. Bar-Yosseff, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pages 623--632, Philadelphia, PA, USA, 2002. Society for Industrial and Applied Mathematics."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401898"},{"key":"e_1_3_2_2_7_1","volume-title":"Cambridge University Press","author":"Bollobas B.","year":"2001","unstructured":"B. Bollobas . Random Graphs . Cambridge University Press , 2001 . B. Bollobas. Random Graphs. Cambridge University Press, 2001."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142388"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000260300002"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28396"},{"key":"e_1_3_2_2_11_1","first-page":"137","volume-title":"OSDI '04","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . Mapreduce: Simplified data processing on large clusters . OSDI '04 , pages 137 -- 150 , December 2004 . J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. OSDI '04, pages 137--150, December 2004."},{"key":"e_1_3_2_2_12_1","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . Mapreduce: Simplified data processing on large clusters . OSDI , 2004 . J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. OSDI, 2004."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.032093399"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.026704"},{"key":"e_1_3_2_2_15_1","volume-title":"Matrix Computations","author":"Golub G.","year":"1989","unstructured":"G. Golub and C. Van Loan . Matrix Computations . JohnsHopkinsPress , Baltimore, MD , second edition, 1989 . G. Golub and C. Van Loan. Matrix Computations. JohnsHopkinsPress, Baltimore, MD, second edition, 1989."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803390"},{"key":"e_1_3_2_2_17_1","first-page":"710","volume-title":"COCOON","author":"Jowhari H.","year":"2005","unstructured":"H. Jowhari and M. Ghodsi . New streaming algorithms for counting triangles in graphs . In COCOON , pages 710 -- 716 , 2005 . H. Jowhari and M. Ghodsi. New streaming algorithms for counting triangles in graphs. In COCOON, pages 710--716, 2005."},{"key":"e_1_3_2_2_18_1","series-title":"The Art of Computer Programming","volume-title":"Seminumerical Algorithms","author":"Knuth D. E.","year":"1981","unstructured":"D. E. Knuth . Seminumerical Algorithms , volume 2 of The Art of Computer Programming . Addison-Wesley , Reading, Massachusetts , second edition, 10 Jan. 1981 . D. E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, Reading, Massachusetts, second edition, 10 Jan. 1981."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1324616.1324684"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"e_1_3_2_2_21_1","volume-title":"Mar","author":"Leskovec J.","year":"2008","unstructured":"J. Leskovec and E. Horvitz . Planetary-scale views on an instant-messaging network , Mar 2008 . J. Leskovec and E. Horvitz. Planetary-scale views on an instant-messaging network, Mar 2008."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"e_1_3_2_2_23_1","volume-title":"the eigenvalue power law","author":"Mihail M.","year":"2002","unstructured":"M. Mihail and C. Papadimitriou . the eigenvalue power law , 2002 . M. Mihail and C. Papadimitriou. the eigenvalue power law, 2002."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"e_1_3_2_2_26_1","volume-title":"Phd in computer science","author":"Schank T.","year":"2007","unstructured":"T. Schank . Algorithmic Aspects of Triangle-Based Network Analysis. Phd in computer science , University Karlsruhe , 2007 . T. Schank. Algorithmic Aspects of Triangle-Based Network Analysis. Phd in computer science, University Karlsruhe, 2007."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.72"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2009.32"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/358105.893"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2003.1238052"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"}],"event":{"name":"KDD09: The 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Paris France","acronym":"KDD09","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 15th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557111","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1557019.1557111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:38:42Z","timestamp":1750239522000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557111"}},"subtitle":["counting triangles in massive graphs with a coin"],"short-title":[],"issued":{"date-parts":[[2009,6,28]]},"references-count":31,"alternative-id":["10.1145\/1557019.1557111","10.1145\/1557019"],"URL":"https:\/\/doi.org\/10.1145\/1557019.1557111","relation":{},"subject":[],"published":{"date-parts":[[2009,6,28]]},"assertion":[{"value":"2009-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}