{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T21:32:08Z","timestamp":1767648728888,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,15]],"date-time":"2016-06-15T00:00:00Z","timestamp":1465948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0953754"],"award-info":[{"award-number":["0953754"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,15]]},"DOI":"10.1145\/2902251.2902283","type":"proceedings-article","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T20:16:05Z","timestamp":1466108165000},"page":"401-411","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Better Algorithms for Counting Triangles in Data Streams"],"prefix":"10.1145","author":[{"given":"Andrew","family":"McGregor","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, USA"}]},{"given":"Sofya","family":"Vorotnikova","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, USA"}]},{"given":"Hoa T.","family":"Vu","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,6,15]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/2213556.2213560"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/BF02523189"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/FOCS.2011.82"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/IPDPS.2010.5470440"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/2505515.2505545"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.5555\/545381.545464"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/IPDPS.2007.370685"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/978-3-642-39206-1_21"},{"key":"e_1_3_2_1_9_1","volume-title":"Triangle counting in dynamic graph streams. CoRR, abs\/1404.4696","author":"Bulteau L.","year":"2014","unstructured":"L. Bulteau , V. Froese , K. Kutzkov , and R. Pagh . Triangle counting in dynamic graph streams. CoRR, abs\/1404.4696 , 2014 . L. Bulteau, V. Froese, K. Kutzkov, and R. Pagh. Triangle counting in dynamic graph streams. CoRR, abs\/1404.4696, 2014."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/1142351.1142388"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1137\/0214017"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/1536414.1536445"},{"unstructured":"G. Cormode. Personal communication 8\/23\/15. 2015.  G. Cormode. Personal communication 8\/23\/15. 2015.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","volume-title":"Personal communication 1\/23\/16","author":"Cormode G.","year":"2016","unstructured":"G. Cormode . Personal communication 1\/23\/16 . 2016 . G. Cormode. Personal communication 1\/23\/16. 2016."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1007\/s10619-013-7131-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1016\/j.tcs.2014.07.025"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1073\/pnas.032093399"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/FOCS.2015.44"},{"key":"e_1_3_2_1_19_1","volume-title":"Frequent directions : Simple and deterministic matrix sketching. CoRR, abs\/1501.01711","author":"Ghashami M.","year":"2015","unstructured":"M. Ghashami , E. Liberty , J. M. Phillips , and D. P. Woodruff . Frequent directions : Simple and deterministic matrix sketching. CoRR, abs\/1501.01711 , 2015 . M. Ghashami, E. Liberty, J. M. Phillips, and D. P. Woodruff. Frequent directions : Simple and deterministic matrix sketching. CoRR, abs\/1501.01711, 2015."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.5555\/2095116.2095157"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/1060590.1060621"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/2700395"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1109\/FOCS.2014.72"},{"key":"e_1_3_2_1_24_1","first-page":"710","volume-title":"11th Annual International Conference, COCOON 2005, Kunming, China, August 16--29, 2005","author":"Jowhari H.","year":"2005","unstructured":"H. Jowhari and M. Ghodsi . New streaming algorithms for counting triangles in graphs. In Computing and Combinatorics , 11th Annual International Conference, COCOON 2005, Kunming, China, August 16--29, 2005 , Proceedings , pages 710 -- 716 , 2005 . H. Jowhari and M. Ghodsi. New streaming algorithms for counting triangles in graphs. In Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16--29, 2005, Proceedings, pages 710--716, 2005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/1989284.1989289"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.5555\/2627817.2627938"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 13th SIAM International Conference on Data Mining, May 2--4, 2013","author":"Kolda T. G.","year":"2013","unstructured":"T. G. Kolda , A. Pinar , and C. Seshadhri . Triadic measures on graphs: The power of wedge sampling . In Proceedings of the 13th SIAM International Conference on Data Mining, May 2--4, 2013 . Austin, Texas, USA., pages 10--18 , 2013 . T. G. Kolda, A. Pinar, and C. Seshadhri. Triadic measures on graphs: The power of wedge sampling. In Proceedings of the 13th SIAM International Conference on Data Mining, May 2--4, 2013. Austin, Texas, USA., pages 10--18, 2013."},{"key":"e_1_3_2_1_28_1","volume-title":"Efficient triangle counting in large graphs via degree-based vertex partitioning. Internet Mathematics, 8(1--2):161--185","author":"Kolountzakis M. N.","year":"2012","unstructured":"M. N. Kolountzakis , G. L. Miller , R. Peng , and C. E. Tsourakakis . Efficient triangle counting in large graphs via degree-based vertex partitioning. Internet Mathematics, 8(1--2):161--185 , 2012 . M. N. Kolountzakis, G. L. Miller, R. Peng, and C. E. Tsourakakis. Efficient triangle counting in large graphs via degree-based vertex partitioning. Internet Mathematics, 8(1--2):161--185, 2012."},{"key":"e_1_3_2_1_29_1","first-page":"306","volume-title":"Proceedings","author":"Kutzkov K.","year":"2014","unstructured":"K. Kutzkov and R. Pagh . Triangle counting in dynamic graph streams. In Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2--4, 2014 . Proceedings , pages 306 -- 318 , 2014 . K. Kutzkov and R. Pagh. Triangle counting in dynamic graph streams. In Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2--4, 2014. Proceedings, pages 306--318, 2014."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/1401890.1401948"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.5555\/2040572.2040646"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/2627692.2627694"},{"key":"e_1_3_2_1_33_1","first-page":"472","volume-title":"Mathematical Foundations of Computer Science","author":"McGregor A.","year":"2015","unstructured":"A. McGregor , D. Tench , S. Vorotnikova , and H. T. Vu . Densest subgraph in dynamic graph streams . In Mathematical Foundations of Computer Science 2015 , pages 472 -- 482 . Springer Berlin Heidelberg , 2015. A. McGregor, D. Tench, S. Vorotnikova, and H. T. Vu. Densest subgraph in dynamic graph streams. In Mathematical Foundations of Computer Science 2015, pages 472--482. Springer Berlin Heidelberg, 2015."},{"key":"e_1_3_2_1_34_1","first-page":"824","volume-title":"Science","author":"Milo R.","year":"2002","unstructured":"R. Milo , S. Shen-Orr , S. Itzkovitz , N. Kashtan , D. Chklovskii , and U. Alon . Network motifs: simple building blocks of complex networks . In Science , pages 824 -- 827 , 2002 . R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network motifs: simple building blocks of complex networks. In Science, pages 824--827, 2002."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.5555\/1076315"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.5555\/1873601.1873693"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1016\/j.ipl.2011.12.007"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.14778\/2556549.2556569"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.7155\/jgaa.00108"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1145\/1963405.1963491"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1145\/2505515.2505741"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.7155\/jgaa.00245"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1145\/3147.3165"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1145\/1753846.1754097"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"acronym":"SIGMOD\/PODS'16","name":"SIGMOD\/PODS'16: International Conference on Management of Data","location":"San Francisco California USA"},"container-title":["Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2902251.2902283","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2902251.2902283","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2902251.2902283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:59Z","timestamp":1750222499000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2902251.2902283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,15]]},"references-count":44,"alternative-id":["10.1145\/2902251.2902283","10.1145\/2902251"],"URL":"https:\/\/doi.org\/10.1145\/2902251.2902283","relation":{},"subject":[],"published":{"date-parts":[[2016,6,15]]},"assertion":[{"value":"2016-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}