{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T18:43:46Z","timestamp":1790275426956,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,11]],"date-time":"2013-08-11T00:00:00Z","timestamp":1376179200000},"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":[[2013,8,11]]},"DOI":"10.1145\/2487575.2487678","type":"proceedings-article","created":{"date-parts":[[2013,8,13]],"date-time":"2013-08-13T08:31:21Z","timestamp":1376382681000},"page":"589-597","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":82,"title":["A space efficient streaming algorithm for triangle counting using the birthday paradox"],"prefix":"10.1145","author":[{"given":"Madhav","family":"Jha","sequence":"first","affiliation":[{"name":"Pennsylvania State University, State College, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Seshadhri","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Livermore, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ali","family":"Pinar","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Livermore, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213560"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109589"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470440"},{"key":"e_1_3_2_1_5_1","volume-title":"KDD workshon Large Scale Data Mining","author":"Avron H.","year":"2010","unstructured":"H. Avron . Counting triangles in large graphs using randomized matrix trace estimation . In KDD workshon Large Scale Data Mining , 2010 . H. Avron. Counting triangles in large graphs using randomized matrix trace estimation. In KDD workshon Large Scale Data Mining, 2010."},{"key":"e_1_3_2_1_6_1","first-page":"623","volume-title":"Symposium of Discrete Algorith,s","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 Symposium of Discrete Algorith,s , pages 623 -- 632 , 2002 . Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Symposium of Discrete Algorith,s, pages 623--632, 2002."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401898"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370685"},{"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.1086\/421787"},{"key":"e_1_3_2_1_12_1","first-page":"42","volume-title":"International Symposium on Code Generation and Optimization","author":"Chakrabarti D. R.","year":"2011","unstructured":"D. R. Chakrabarti , P. Banerjee , H.-J. Boehm , P. G. Joisha , and R. S. Schreiber . The runtime abort graph and its application to software transactional memory optimization . In International Symposium on Code Generation and Optimization , pages 42 -- 53 , 2011 . D. R. Chakrabarti, P. Banerjee, H.-J. Boehm, P. G. Joisha, and R. S. Schreiber. The runtime abort graph and its application to software transactional memory optimization. In International Symposium on Code Generation and Optimization, pages 42--53, 2011."},{"key":"e_1_3_2_1_13_1","first-page":"139","volume-title":"Symposium on Discrete Algorithms (SODA)","author":"Chiang Y.-J.","year":"1995","unstructured":"Y.-J. Chiang , M. T. Goodrich , E. F. Grove , R. Tamassia , D. E. Vengroff , and J. S. Vitter . External-memory graph algorithms . In Symposium on Discrete Algorithms (SODA) , pages 139 -- 149 , 1995 . Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Symposium on Discrete Algorithms (SODA), pages 139--149, 1995."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020513"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1086\/228943"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.032093399"},{"key":"e_1_3_2_1_19_1","volume-title":"An Introduction to probability theory and applications: Vol I","author":"Feller W.","year":"1968","unstructured":"W. Feller . An Introduction to probability theory and applications: Vol I . John Wiley and Sons , 3 rd edition, 1968 . W. Feller. An Introduction to probability theory and applications: Vol I. John Wiley and Sons, 3rd edition, 1968.","edition":"3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958119.2958158"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_53"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18009-5_3"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.10.005"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.24.1.1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00108"},{"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","volume-title":"Proceedings of the SIAM Conference on Data Mining","author":"Seshadhri C.","year":"2013","unstructured":"C. Seshadhri , A. Pinar , and T. G. Kolda . Fast triangle counting through wedge sampling . In Proceedings of the SIAM Conference on Data Mining , 2013 . C. Seshadhri, A. Pinar, and T. G. Kolda. Fast triangle counting through wedge sampling. In Proceedings of the SIAM Conference on Data Mining, 2013."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.72"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2009.32"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00245"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753846.1754097"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/2045005.2045097"},{"key":"e_1_3_2_1_41_1","unstructured":"Stanford Network Analysis Project (SNAP). Available at http:\/\/snap.stanford.edu\/.  Stanford Network Analysis Project (SNAP). Available at http:\/\/snap.stanford.edu\/."}],"event":{"name":"KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Chicago Illinois USA","acronym":"KDD' 13","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487678","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2487575.2487678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:48:44Z","timestamp":1750222124000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,11]]},"references-count":38,"alternative-id":["10.1145\/2487575.2487678","10.1145\/2487575"],"URL":"https:\/\/doi.org\/10.1145\/2487575.2487678","relation":{},"subject":[],"published":{"date-parts":[[2013,8,11]]},"assertion":[{"value":"2013-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}