{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T09:18:52Z","timestamp":1773825532677,"version":"3.50.1"},"reference-count":62,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/icde.2015.7113280","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T19:23:28Z","timestamp":1433359408000},"page":"149-160","source":"Crossref","is-referenced-by-count":106,"title":["Multicore triangle computations without tuning"],"prefix":"10.1109","author":[{"given":"Julian","family":"Shun","sequence":"first","affiliation":[]},{"given":"Kanat","family":"Tangwongsan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973198.1"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"ref33","article-title":"GraphChi: Large-scale graph computation on just a PC","author":"kyrola","year":"2012","journal-title":"OSDI"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08404-6_27"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.625260"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"ref36","article-title":"An external memory algorithm for listing triangles","author":"menegola","year":"2010","journal-title":"Universidade Federal Do Rio Grande Do sul"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90034-V"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref62","article-title":"Multipredicate join algorithms for accelerating relational graph processing on GPUs","author":"wu","year":"2014","journal-title":"ADMS"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588563"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487678"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/13090729X"},{"key":"ref2","article-title":"PATRIC: A parallel algorithm for counting triangles in massive networks","author":"arifuzzaman","year":"2013","journal-title":"CIKM"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2013.51"},{"key":"ref21","article-title":"PowerGraph: Distributed graph-parallel computation on natural graphs","author":"gonzalez","year":"2012","journal-title":"OSDI"},{"key":"ref24","article-title":"Fast triangle counting on the GPU","author":"green","year":"2015","journal-title":"IAA"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2567634.2567635"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803390"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463704"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612687"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312018"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37450-0_23"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-010-0001-9"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"ref56","article-title":"Counting triangles in real-world networks using projections","volume":"26","year":"2011","journal-title":"Knowl Inf Syst"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.72"},{"key":"ref54","article-title":"Parallel triangle counting in massive streaming graphs","author":"tangwongsan","year":"2013","journal-title":"CIKM"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"ref52","article-title":"Program-centric cost models for locality and parallelism","author":"simhadri","year":"2013"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810519"},{"key":"ref11","article-title":"Parallel algorithms","author":"blelloch","year":"1997","journal-title":"The Computer Science and Engineering Handbook"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594552"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142388"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2382577.2382581"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"ref17","article-title":"Algorithm engineering for large data sets","author":"dementiev","year":"2006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.032093399"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2010.5470687"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732227"},{"key":"ref3","article-title":"Counting triangles in large graphs using randomized matrix trace estimation","author":"avron","year":"2010","journal-title":"KDD-LDMTA"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401898"},{"key":"ref5","article-title":"Reductions in streaming algorithms, with an application to counting triangles in graphs","author":"bar-yossef","year":"2002","journal-title":"SODA"},{"key":"ref8","article-title":"Listing triangles","author":"bjorklund","year":"2014","journal-title":"ICALP"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554819"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989553"},{"key":"ref46","article-title":"Algorithmic aspects of triangle-based network analysis","author":"schank","year":"2007"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691744"},{"key":"ref48","article-title":"The importance of directed triangles with reciprocity: patterns and algorithms","volume":"abs 1302 6220","author":"seshadhri","year":"2013","journal-title":"CoRR"},{"key":"ref47","article-title":"Finding, counting and listing all triangles in large graphs, an experimental study","author":"schank","year":"2005","journal-title":"Wea"},{"key":"ref42","article-title":"An efficient MapReduce algorithm for counting triangles in a very large graph","author":"park","year":"2013","journal-title":"CIKM"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556569"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662017"}],"event":{"name":"2015 IEEE 31st International Conference on Data Engineering (ICDE)","location":"Seoul, South Korea","start":{"date-parts":[[2015,4,13]]},"end":{"date-parts":[[2015,4,17]]}},"container-title":["2015 IEEE 31st International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7109453\/7113253\/07113280.pdf?arnumber=7113280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T19:23:39Z","timestamp":1490383419000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7113280\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":62,"URL":"https:\/\/doi.org\/10.1109\/icde.2015.7113280","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}