{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:56:27Z","timestamp":1780674987694,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":181,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"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":[[2021,10,18]]},"DOI":"10.1145\/3466752.3480133","type":"proceedings-article","created":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T19:12:05Z","timestamp":1634497925000},"page":"282-297","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems"],"prefix":"10.1145","author":[{"given":"Maciej","family":"Besta","sequence":"first","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raghavendra","family":"Kanakagiri","sequence":"additional","affiliation":[{"name":"IIT Tirupati, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Grzegorz","family":"Kwasniewski","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rachata","family":"Ausavarungnirun","sequence":"additional","affiliation":[{"name":"King Mongkut's University of Technology North Bangkok, Thailand"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakub","family":"Ber\u00e1nek","sequence":"additional","affiliation":[{"name":"Technical University of Ostrava, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Konstantinos","family":"Kanellopoulos","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kacper","family":"Janda","sequence":"additional","affiliation":[{"name":"AGH-UST, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zur","family":"Vonarburg-Shmaria","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lukas","family":"Gianinazzi","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ioana","family":"Stefan","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan G\u00f3mez","family":"Luna","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakub","family":"Golinowski","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcin","family":"Copik","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lukas","family":"Kapp-Schwoerer","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salvatore","family":"Di Girolamo","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nils","family":"Blach","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marek","family":"Konieczny","sequence":"additional","affiliation":[{"name":"AGH-UST, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Onur","family":"Mutlu","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2018.8573480"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2017.21"},{"key":"e_1_3_2_1_4_1","volume-title":"Managing and mining graph data. Vol.\u00a040","author":"Aggarwal C","unstructured":"Charu\u00a0 C Aggarwal and Haixun Wang . 2010. Managing and mining graph data. Vol.\u00a040 . Springer . Charu\u00a0C Aggarwal and Haixun Wang. 2010. Managing and mining graph data. Vol.\u00a040. Springer."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. 20th int. conf. very large data bases, VLDB, Vol.\u00a01215","author":"Agrawal Rakesh","year":"1994","unstructured":"Rakesh Agrawal , Ramakrishnan Srikant , 1994 . Fast algorithms for mining association rules . In Proc. 20th int. conf. very large data bases, VLDB, Vol.\u00a01215 . Citeseer, 487\u2013499. Rakesh Agrawal, Ramakrishnan Srikant, 1994. Fast algorithms for mining association rules. In Proc. 20th int. conf. very large data bases, VLDB, Vol.\u00a01215. Citeseer, 487\u2013499."},{"key":"e_1_3_2_1_6_1","unstructured":"Junwhan Ahn Sungpack Hong Sungjoo Yoo Onur Mutlu and Kiyoung Choi. 2015. A scalable processing-in-memory accelerator for parallel graph processing. In ISCA.  Junwhan Ahn Sungpack Hong Sungjoo Yoo Onur Mutlu and Kiyoung Choi. 2015. A scalable processing-in-memory accelerator for parallel graph processing. In ISCA."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750385"},{"key":"e_1_3_2_1_8_1","volume-title":"SDM06: workshop on link analysis, counter-terrorism and security.","author":"Al\u00a0Hasan Mohammad","year":"2006","unstructured":"Mohammad Al\u00a0Hasan , Vineet Chaoji , Saeed Salem , and Mohammed Zaki . 2006 . Link prediction using supervised learning . In SDM06: workshop on link analysis, counter-terrorism and security. Mohammad Al\u00a0Hasan, Vineet Chaoji, Saeed Salem, and Mohammed Zaki. 2006. Link prediction using supervised learning. In SDM06: workshop on link analysis, counter-terrorism and security."},{"key":"e_1_3_2_1_9_1","volume-title":"Social network data analytics","author":"Al\u00a0Hasan Mohammad","unstructured":"Mohammad Al\u00a0Hasan and Mohammed\u00a0 J Zaki . 2011. A survey of link prediction in social networks . In Social network data analytics . Springer , 243\u2013275. Mohammad Al\u00a0Hasan and Mohammed\u00a0J Zaki. 2011. A survey of link prediction in social networks. In Social network data analytics. Springer, 243\u2013275."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299874.3317984"},{"key":"e_1_3_2_1_11_1","volume-title":"Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 378\u2013383","author":"Angizi Shaahin","year":"2019","unstructured":"Shaahin Angizi , Jiao Sun , Wei Zhang , and Deliang Fan . 2019 . GraphS: A graph processing accelerator leveraging SOT-MRAM. In 2019 Design , Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 378\u2013383 . Shaahin Angizi, Jiao Sun, Wei Zhang, and Deliang Fan. 2019. GraphS: A graph processing accelerator leveraging SOT-MRAM. In 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 378\u2013383."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-015-0472-6"},{"key":"e_1_3_2_1_13_1","unstructured":"Peter\u00a0W Battaglia Jessica\u00a0B Hamrick Victor Bapst Alvaro Sanchez-Gonzalez Vinicius Zambaldi Mateusz Malinowski Andrea Tacchetti David Raposo Adam Santoro Ryan Faulkner 2018. Relational inductive biases deep learning and graph networks. arXiv preprint arXiv:1806.01261(2018).  Peter\u00a0W Battaglia Jessica\u00a0B Hamrick Victor Bapst Alvaro Sanchez-Gonzalez Vinicius Zambaldi Mateusz Malinowski Andrea Tacchetti David Raposo Adam Santoro Ryan Faulkner 2018. Relational inductive biases deep learning and graph networks. arXiv preprint arXiv:1806.01261(2018)."},{"key":"e_1_3_2_1_14_1","unstructured":"Scott Beamer Krste Asanovi\u0107 and David Patterson. 2015. The GAP benchmark suite. arXiv preprint arXiv:1508.03619(2015).  Scott Beamer Krste Asanovi\u0107 and David Patterson. 2015. The GAP benchmark suite. arXiv preprint arXiv:1508.03619(2015)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00018"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Maciej Besta Armon Carigiet Zur Vonarburg-Shmaria Kacper Janda Lukas Gianinazzi and Torsten Hoefler. 2020. High-performance parallel graph coloring with strong guarantees on work depth and quality. arXiv preprint arXiv:2008.11321(2020).  Maciej Besta Armon Carigiet Zur Vonarburg-Shmaria Kacper Janda Lukas Gianinazzi and Torsten Hoefler. 2020. High-performance parallel graph coloring with strong guarantees on work depth and quality. arXiv preprint arXiv:2008.11321(2020).","DOI":"10.1109\/SC41405.2020.00103"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Maciej Besta Raphael Grob Cesare Miglioli Nicola Bernold Grzegorz Kwasniewski Gabriel Gjini Raghavendra Kanakagiri Saleh Ashkboos Lukas Gianinazzi Nikoli Dryden 2021. Motif Prediction with Graph Neural Networks. arXiv preprint arXiv:2106.00761(2021).  Maciej Besta Raphael Grob Cesare Miglioli Nicola Bernold Grzegorz Kwasniewski Gabriel Gjini Raghavendra Kanakagiri Saleh Ashkboos Lukas Gianinazzi Nikoli Dryden 2021. Motif Prediction with Graph Neural Networks. arXiv preprint arXiv:2106.00761(2021).","DOI":"10.1145\/3534678.3539343"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749246.2749263"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS47924.2020.00118"},{"key":"e_1_3_2_1_20_1","volume-title":"SlimSell: A Vectorizable Graph Representation for Breadth-First Search. In Parallel and Distributed Processing Symposium (IPDPS)","author":"Besta Maciej","year":"2017","unstructured":"Maciej Besta , Florian Marending , Edgar Solomonik , and Torsten Hoefler . 2017 . SlimSell: A Vectorizable Graph Representation for Breadth-First Search. In Parallel and Distributed Processing Symposium (IPDPS) , 2017 IEEE International. IEEE, 32\u201341. Maciej Besta, Florian Marending, Edgar Solomonik, and Torsten Hoefler. 2017. SlimSell: A Vectorizable Graph Representation for Breadth-First Search. In Parallel and Distributed Processing Symposium (IPDPS), 2017 IEEE International. IEEE, 32\u201341."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078616"},{"key":"e_1_3_2_1_22_1","volume-title":"Tal Ben-Nun, and Torsten Hoefler.","author":"Besta Maciej","year":"2019","unstructured":"Maciej Besta , Dimitri Stanojevic , Johannes De\u00a0Fine Licht , Tal Ben-Nun, and Torsten Hoefler. 2019 . Graph Processing on FPGAs: Taxonomy, Survey, Challenges . arXiv preprint arXiv:1903.06697(2019). Maciej Besta, Dimitri Stanojevic, Johannes De\u00a0Fine Licht, Tal Ben-Nun, and Torsten Hoefler. 2019. Graph Processing on FPGAs: Taxonomy, Survey, Challenges. arXiv preprint arXiv:1903.06697(2019)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476252"},{"key":"e_1_3_2_1_24_1","volume-title":"Parallel Algorithms (2ed.)","author":"Blelloch E.","unstructured":"Guy\u00a0 E. Blelloch and Bruce\u00a0 M. Maggs . 2010. Parallel Algorithms (2ed.) . Chapman & Hall\/CRC , 25. Guy\u00a0E. Blelloch and Bruce\u00a0M. Maggs. 2010. Parallel Algorithms (2ed.). Chapman & Hall\/CRC, 25."},{"key":"e_1_3_2_1_25_1","unstructured":"Otakar Boruvka. 1926. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. (1926).  Otakar Boruvka. 1926. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. (1926)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_27_1","volume-title":"International Workshop on New Frontiers in Mining Complex Patterns. Springer, 32\u201345","author":"Bustio L\u00e1zaro","year":"2015","unstructured":"L\u00e1zaro Bustio , Ren\u00e9 Cumplido , Raudel Hern\u00e1ndez , Jos\u00e9\u00a0 M Bande , and Claudia Feregrino . 2015 . Frequent itemsets mining in data streams using reconfigurable hardware . In International Workshop on New Frontiers in Mining Complex Patterns. Springer, 32\u201345 . L\u00e1zaro Bustio, Ren\u00e9 Cumplido, Raudel Hern\u00e1ndez, Jos\u00e9\u00a0M Bande, and Claudia Feregrino. 2015. Frequent itemsets mining in data streams using reconfigurable hardware. In International Workshop on New Frontiers in Mining Complex Patterns. Springer, 32\u201345."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/LASCAS.2017.7948076"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.010"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132952.1132954"},{"key":"e_1_3_2_1_31_1","volume-title":"GaaS-X: Graph Analytics Accelerator Supporting Sparse Data Representation using Crossbar Architectures. ISCA","author":"Challapalle Nagadastagiri","year":"2020","unstructured":"Nagadastagiri Challapalle , Sahithi Rampalli , Linghao Song , Nandhini Chandramoorthy , Karthik Swaminathan , John Sampson , Yiran Chen , and Vijaykrishnan Narayanan . 2020. GaaS-X: Graph Analytics Accelerator Supporting Sparse Data Representation using Crossbar Architectures. ISCA ( 2020 ). Nagadastagiri Challapalle, Sahithi Rampalli, Linghao Song, Nandhini Chandramoorthy, Karthik Swaminathan, John Sampson, Yiran Chen, and Vijaykrishnan Narayanan. 2020. GaaS-X: Graph Analytics Accelerator Supporting Sparse Data Representation using Crossbar Architectures. ISCA (2020)."},{"key":"e_1_3_2_1_32_1","unstructured":"Rohit Chandra Leo Dagum David Kohr Ramesh Menon Dror Maydan and Jeff McDonald. 2001. Parallel programming in OpenMP. Morgan kaufmann.  Rohit Chandra Leo Dagum David Kohr Ramesh Menon Dror Maydan and Jeff McDonald. 2001. Parallel programming in OpenMP. Morgan kaufmann."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190545"},{"key":"e_1_3_2_1_34_1","unstructured":"Langshi Chen Jiayu Li Ariful Azad Lei Jiang Madhav Marathe Anil Vullikanti Andrey Nikolaev Egor Smirnov Ruslan Israfilov and Judy Qiu. 2019. A GraphBLAS approach for subgraph counting. arXiv preprint arXiv:1903.04395(2019).  Langshi Chen Jiayu Li Ariful Azad Lei Jiang Madhav Marathe Anil Vullikanti Andrey Nikolaev Egor Smirnov Ruslan Israfilov and Judy Qiu. 2019. A GraphBLAS approach for subgraph counting. arXiv preprint arXiv:1903.04395(2019)."},{"key":"e_1_3_2_1_35_1","volume-title":"Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU. arXiv preprint arXiv:1911.06969(2019).","author":"Chen Xuhao","year":"2019","unstructured":"Xuhao Chen , Roshan Dathathri , Gurbinder Gill , and Keshav Pingali . 2019 . Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU. arXiv preprint arXiv:1911.06969(2019). Xuhao Chen, Roshan Dathathri, Gurbinder Gill, and Keshav Pingali. 2019. Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU. arXiv preprint arXiv:1911.06969(2019)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497500"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339724"},{"key":"e_1_3_2_1_38_1","series-title":"SIAM Journal on computing 14, 1","volume-title":"Arboricity and subgraph listing algorithms","author":"Chiba Norishige","year":"1985","unstructured":"Norishige Chiba and Takao Nishizeki . 1985. Arboricity and subgraph listing algorithms . SIAM Journal on computing 14, 1 ( 1985 ), 210\u2013223. Norishige Chiba and Takao Nishizeki. 1985. Arboricity and subgraph listing algorithms. SIAM Journal on computing 14, 1 (1985), 210\u2013223."},{"key":"e_1_3_2_1_39_1","volume-title":"Mining graph data","author":"Cook J","unstructured":"Diane\u00a0 J Cook and Lawrence\u00a0 B Holder . 2006. Mining graph data . John Wiley & Sons . Diane\u00a0J Cook and Lawrence\u00a0B Holder. 2006. Mining graph data. John Wiley & Sons."},{"key":"e_1_3_2_1_40_1","volume-title":"O\u2019Reilly Media","author":"Corbet Jonathan","unstructured":"Jonathan Corbet , Alessandro Rubini , and Greg Kroah-Hartman . 2005. Linux device drivers . \u201d O\u2019Reilly Media , Inc .\u201d. Jonathan Corbet, Alessandro Rubini, and Greg Kroah-Hartman. 2005. Linux device drivers. \u201d O\u2019Reilly Media, Inc.\u201d."},{"key":"e_1_3_2_1_41_1","volume-title":"Carlo Sansone, and Mario Vento","author":"Cordella P","year":"2004","unstructured":"Luigi\u00a0 P Cordella , Pasquale Foggia , Carlo Sansone, and Mario Vento . 2004 . A (sub) graph isomorphism algorithm for matching large graphs. IEEE transactions on pattern analysis and machine intelligence 26, 10(2004), 1367\u20131372. Luigi\u00a0P Cordella, Pasquale Foggia, Carlo Sansone, and Mario Vento. 2004. A (sub) graph isomorphism algorithm for matching large graphs. IEEE transactions on pattern analysis and machine intelligence 26, 10(2004), 1367\u20131372."},{"key":"e_1_3_2_1_42_1","volume-title":"Introduction to algorithms","author":"Cormen H","unstructured":"Thomas\u00a0 H Cormen , Charles\u00a0 E Leiserson , Ronald\u00a0 L Rivest , and Clifford Stein . 2009. Introduction to algorithms . MIT press . Thomas\u00a0H Cormen, Charles\u00a0E Leiserson, Ronald\u00a0L Rivest, and Clifford Stein. 2009. Introduction to algorithms. MIT press."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2821565"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186125"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1093\/sysbio\/35.2.224"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210414"},{"key":"e_1_3_2_1_47_1","volume-title":"Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs. PVLDB","author":"Dhulipala Laxman","year":"2020","unstructured":"Laxman Dhulipala , Charles McGuffey , Hongbo Kang , Yan Gu , Guy Blelloch , Phillip Gibbons , and Julian Shun . 2020 . Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs. PVLDB (2020). Laxman Dhulipala, Charles McGuffey, Hongbo Kang, Yan Gu, Guy Blelloch, Phillip Gibbons, and Julian Shun. 2020. Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs. PVLDB (2020)."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319875"},{"key":"e_1_3_2_1_49_1","volume-title":"Data mining and machine learning in cybersecurity","author":"Dua Sumeet","unstructured":"Sumeet Dua and Xian Du. 2016. Data mining and machine learning in cybersecurity . CRC press . Sumeet Dua and Xian Du. 2016. Data mining and machine learning in cybersecurity. CRC press."},{"key":"e_1_3_2_1_50_1","volume-title":"BMC bioinformatics, Vol.\u00a013","author":"Eblen D","unstructured":"John\u00a0 D Eblen , Charles\u00a0 A Phillips , Gary\u00a0 L Rogers , and Michael\u00a0 A Langston . 2012. The maximum clique enumeration problem: algorithms, applications, and implementations . In BMC bioinformatics, Vol.\u00a013 . Springer , S5. John\u00a0D Eblen, Charles\u00a0A Phillips, Gary\u00a0L Rogers, and Michael\u00a0A Langston. 2012. The maximum clique enumeration problem: algorithms, applications, and implementations. In BMC bioinformatics, Vol.\u00a013. Springer, S5."},{"key":"e_1_3_2_1_51_1","volume-title":"ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I. 403\u2013414","author":"Eppstein David","year":"2010","unstructured":"David Eppstein , Maarten L\u00f6ffler , and Darren Strash . 2010 . Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. In Algorithms and Computation - 21st International Symposium , ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I. 403\u2013414 . https:\/\/doi.org\/10.1007\/978-3-642-17517-6_36 10.1007\/978-3-642-17517-6_36 David Eppstein, Maarten L\u00f6ffler, and Darren Strash. 2010. Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. In Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I. 403\u2013414. https:\/\/doi.org\/10.1007\/978-3-642-17517-6_36"},{"key":"e_1_3_2_1_52_1","volume-title":"AAAI Fall Symposium: Capturing and Using Patterns for Evidence Detection. 45\u201353","author":"Gallagher Brian","year":"2006","unstructured":"Brian Gallagher . 2006 . Matching Structure and Semantics: A Survey on Graph-Based Pattern Matching .. In AAAI Fall Symposium: Capturing and Using Patterns for Evidence Detection. 45\u201353 . Brian Gallagher. 2006. Matching Structure and Semantics: A Survey on Graph-Based Pattern Matching.. In AAAI Fall Symposium: Capturing and Using Patterns for Evidence Detection. 45\u201353."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358260"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2015.22"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2016.7446059"},{"key":"e_1_3_2_1_56_1","volume-title":"Processing-in-Memory: A Workload-driven Perspective. IBM JRD","author":"Ghose Saugata","year":"2019","unstructured":"Saugata Ghose , Amirali Boroumand , Jeremie\u00a0 S Kim , Juan G\u00f3mez-Luna , and Onur Mutlu . 2019. Processing-in-Memory: A Workload-driven Perspective. IBM JRD ( 2019 ). Saugata Ghose, Amirali Boroumand, Jeremie\u00a0S Kim, Juan G\u00f3mez-Luna, and Onur Mutlu. 2019. Processing-in-Memory: A Workload-driven Perspective. IBM JRD (2019)."},{"key":"e_1_3_2_1_57_1","volume-title":"Beyond-CMOS Technologies for Next Generation Computer Design","author":"Ghose Saugata","unstructured":"Saugata Ghose , Kevin Hsieh , Amirali Boroumand , Rachata Ausavarungnirun , and Onur Mutlu . 2019. The processing-in-memory paradigm: Mechanisms to enable adoption . In Beyond-CMOS Technologies for Next Generation Computer Design . Springer , 133\u2013194. Saugata Ghose, Kevin Hsieh, Amirali Boroumand, Rachata Ausavarungnirun, and Onur Mutlu. 2019. The processing-in-memory paradigm: Mechanisms to enable adoption. In Beyond-CMOS Technologies for Next Generation Computer Design. Springer, 133\u2013194."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461800"},{"key":"e_1_3_2_1_59_1","unstructured":"Lukas Gianinazzi Maximilian Fries Nikoli Dryden Tal Ben-Nun and Torsten Hoefler. 2021. Learning Combinatorial Node Labeling Algorithms. arXiv preprint arXiv:2106.03594(2021).  Lukas Gianinazzi Maximilian Fries Nikoli Dryden Tal Ben-Nun and Torsten Hoefler. 2021. Learning Combinatorial Node Labeling Algorithms. arXiv preprint arXiv:2106.03594(2021)."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3200691.3178504"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083676"},{"key":"e_1_3_2_1_62_1","volume-title":"International Conference on Machine Learning. PMLR, 1263\u20131272","author":"Gilmer Justin","year":"2017","unstructured":"Justin Gilmer , Samuel\u00a0 S Schoenholz , Patrick\u00a0 F Riley , Oriol Vinyals , and George\u00a0 E Dahl . 2017 . Neural message passing for quantum chemistry . In International Conference on Machine Learning. PMLR, 1263\u20131272 . Justin Gilmer, Samuel\u00a0S Schoenholz, Patrick\u00a0F Riley, Oriol Vinyals, and George\u00a0E Dahl. 2017. Neural message passing for quantum chemistry. In International Conference on Machine Learning. PMLR, 1263\u20131272."},{"key":"e_1_3_2_1_63_1","unstructured":"Juan G\u00f3mez-Luna Izzat\u00a0El Hajj Ivan Fernandez Christina Giannoula Geraldo\u00a0F Oliveira and Onur Mutlu. 2021. Benchmarking a New Paradigm: An Experimental Analysis of a Real Processing-in-Memory Architecture. arXiv preprint arXiv:2105.03814(2021).  Juan G\u00f3mez-Luna Izzat\u00a0El Hajj Ivan Fernandez Christina Giannoula Geraldo\u00a0F Oliveira and Onur Mutlu. 2021. Benchmarking a New Paradigm: An Experimental Analysis of a Real Processing-in-Memory Architecture. arXiv preprint arXiv:2105.03814(2021)."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446749"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2016.7783759"},{"key":"e_1_3_2_1_66_1","volume-title":"Data Mining Concepts and Techniques","author":"Han J","unstructured":"J Han and M Kamber . 2006. Data Mining Concepts and Techniques (A. Stephan, Ed.), 2 nd edn., vol. 40 . J Han and M Kamber. 2006. Data Mining Concepts and Techniques (A. Stephan, Ed.), 2nd edn., vol. 40.","edition":"2"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196924"},{"key":"e_1_3_2_1_68_1","unstructured":"Lei He. 2019. EnGN: A High-Throughput and Energy-Efficient Accelerator for Large Graph Neural Networks. arXiv preprint arXiv:1909.00155(2019).  Lei He. 2019. EnGN: A High-Throughput and Energy-Efficient Accelerator for Large Graph Neural Networks. arXiv preprint arXiv:1909.00155(2019)."},{"key":"e_1_3_2_1_70_1","volume-title":"8th International Summer School on Advanced Computer Architecture and Compilation for High-Performance and Embedded Systems (ACACES-2012)","author":"Heirman Wim","year":"2012","unstructured":"Wim Heirman , Trevor Carlson , and Lieven Eeckhout . 2012 . Sniper: Scalable and accurate parallel multi-core simulation. In 8th International Summer School on Advanced Computer Architecture and Compilation for High-Performance and Embedded Systems (ACACES-2012) . High-Performance and Embedded Architecture and Compilation Network of\u00a0\u2026, 91\u201394. Wim Heirman, Trevor Carlson, and Lieven Eeckhout. 2012. Sniper: Scalable and accurate parallel multi-core simulation. In 8th International Summer School on Advanced Computer Architecture and Compilation for High-Performance and Embedded Systems (ACACES-2012). High-Performance and Embedded Architecture and Compilation Network of\u00a0\u2026, 91\u201394."},{"key":"e_1_3_2_1_71_1","unstructured":"Maurice Herlihy Nir Shavit Victor Luchangco and Michael Spear. 2020. The art of multiprocessor programming. Newnes.  Maurice Herlihy Nir Shavit Victor Luchangco and Michael Spear. 2020. The art of multiprocessor programming. Newnes."},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.20"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807644"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014072"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2016.7753257"},{"key":"e_1_3_2_1_76_1","volume-title":"Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 973\u2013978","author":"Huang Tianhao","year":"2018","unstructured":"Tianhao Huang , Guohao Dai , Yu Wang , and Huazhong Yang . 2018 . HyVE: Hybrid vertex-edge memory hierarchy for energy-efficient graph processing. In 2018 Design , Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 973\u2013978 . Tianhao Huang, Guohao Dai, Yu Wang, and Huazhong Yang. 2018. HyVE: Hybrid vertex-edge memory hierarchy for energy-efficient graph processing. In 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 973\u2013978."},{"key":"e_1_3_2_1_77_1","volume-title":"Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 1273\u20131276","author":"Huang Yu","year":"2019","unstructured":"Yu Huang , Long Zheng , Xiaofei Liao , Hai Jin , Pengcheng Yao , and Chuangyi Gui . 2019 . RAGra: Leveraging Monolithic 3D ReRAM for Massively-Parallel Graph Processing. In 2019 Design , Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 1273\u20131276 . Yu Huang, Long Zheng, Xiaofei Liao, Hai Jin, Pengcheng Yao, and Chuangyi Gui. 2019. RAGra: Leveraging Monolithic 3D ReRAM for Massively-Parallel Graph Processing. In 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 1273\u20131276."},{"key":"e_1_3_2_1_78_1","volume-title":"Approximate Graph Pattern Mining at Scale. In 13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18). 745\u2013761.","author":"Iyer Anand\u00a0Padmanabha","unstructured":"Anand\u00a0Padmanabha Iyer , Zaoxing Liu , Xin Jin , Shivaram Venkataraman , Vladimir Braverman , and Ion Stoica . 2018. {ASAP} : Fast , Approximate Graph Pattern Mining at Scale. In 13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18). 745\u2013761. Anand\u00a0Padmanabha Iyer, Zaoxing Liu, Xin Jin, Shivaram Venkataraman, Vladimir Braverman, and Ion Stoica. 2018. {ASAP}: Fast, Approximate Graph Pattern Mining at Scale. In 13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18). 745\u2013761."},{"key":"e_1_3_2_1_79_1","volume-title":"Pushing the Envelope in Overlapping Communities Detection. In International Symposium on Intelligent Data Analysis. Springer, 151\u2013163","author":"Jabbour Said","year":"2018","unstructured":"Said Jabbour , Nizar Mhadhbi , Badran Raddaoui , and Lakhdar Sais . 2018 . Pushing the Envelope in Overlapping Communities Detection. In International Symposium on Intelligent Data Analysis. Springer, 151\u2013163 . Said Jabbour, Nizar Mhadhbi, Badran Raddaoui, and Lakhdar Sais. 2018. Pushing the Envelope in Overlapping Communities Detection. In International Symposium on Intelligent Data Analysis. Springer, 151\u2013163."},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387548"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1973.223640"},{"key":"e_1_3_2_1_82_1","volume-title":"Set theory","author":"Jech Thomas","unstructured":"Thomas Jech . 2013. Set theory . Springer Science & Business Media . Thomas Jech. 2013. Set theory. Springer Science & Business Media."},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1109\/VLSIT.2012.6242474"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888912000331"},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"crossref","unstructured":"Daxin Jiang and Jian Pei. 2009. Mining frequent cross-graph quasi-cliques. ACM Transactions on Knowledge Discovery from Data (TKDD) 2 4(2009) 1\u201342.  Daxin Jiang and Jian Pei. 2009. Mining frequent cross-graph quasi-cliques. ACM Transactions on Knowledge Discovery from Data (TKDD) 2 4(2009) 1\u201342.","DOI":"10.1145\/1460797.1460799"},{"key":"e_1_3_2_1_86_1","volume-title":"An Efficient System for Subgraph Discovery. In 2018 IEEE International Conference on Big Data (Big Data). IEEE, 703\u2013712","author":"Joshi Aparna","year":"2018","unstructured":"Aparna Joshi , Yu Zhang , Petko Bogdanov , and Jeong-Hyon Hwang . 2018 . An Efficient System for Subgraph Discovery. In 2018 IEEE International Conference on Big Data (Big Data). IEEE, 703\u2013712 . Aparna Joshi, Yu Zhang, Petko Bogdanov, and Jeong-Hyon Hwang. 2018. An Efficient System for Subgraph Discovery. In 2018 IEEE International Conference on Big Data (Big Data). IEEE, 703\u2013712."},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00042"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2762294"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378524"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761646"},{"key":"e_1_3_2_1_91_1","unstructured":"Arijit Khan. 2016. Vertex-centric graph processing: The good the bad and the ugly. arXiv preprint arXiv:1612.07404(2016).  Arijit Khan. 2016. Vertex-centric graph processing: The good the bad and the ugly. arXiv preprint arXiv:1612.07404(2016)."},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850471"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196915"},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_1_95_1","volume-title":"An efficient algorithm for discovering frequent subgraphs","author":"Kuramochi Michihiro","year":"2004","unstructured":"Michihiro Kuramochi and George Karypis . 2004. An efficient algorithm for discovering frequent subgraphs . IEEE transactions on Knowledge and Data Engineering 16, 9( 2004 ), 1038\u20131051. Michihiro Kuramochi and George Karypis. 2004. An efficient algorithm for discovering frequent subgraphs. IEEE transactions on Knowledge and Data Engineering 16, 9(2004), 1038\u20131051."},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM.2016.7822732"},{"key":"e_1_3_2_1_97_1","volume-title":"Managing and Mining Graph Data","author":"Lee E","unstructured":"Victor\u00a0 E Lee , Ning Ruan , Ruoming Jin , and Charu Aggarwal . 2010. A survey of algorithms for dense subgraph discovery . In Managing and Mining Graph Data . Springer , 303\u2013336. Victor\u00a0E Lee, Ning Ruan, Ruoming Jin, and Charu Aggarwal. 2010. A survey of algorithms for dense subgraph discovery. In Managing and Mining Graph Data. Springer, 303\u2013336."},{"key":"e_1_3_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.73.026120"},{"key":"e_1_3_2_1_99_1","first-page":"985","article-title":"Kronecker graphs: An approach to modeling networks","author":"Leskovec Jure","year":"2010","unstructured":"Jure Leskovec , Deepayan Chakrabarti , Jon Kleinberg , Christos Faloutsos , and Zoubin Ghahramani . 2010 . Kronecker graphs: An approach to modeling networks . Journal of Machine Learning Research 11 , Feb (2010), 985 \u2013 1042 . Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani. 2010. Kronecker graphs: An approach to modeling networks. Journal of Machine Learning Research 11, Feb (2010), 985\u20131042.","journal-title":"Journal of Machine Learning Research 11"},{"key":"e_1_3_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/3123939.3123977"},{"key":"e_1_3_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898064"},{"key":"e_1_3_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.5555\/1241540.1241551"},{"key":"e_1_3_2_1_103_1","volume-title":"An Empirical Analysis on Expressibility of Vertex Centric Graph Processing Paradigm. In 2018 IEEE International Conference on Big Data (Big Data). IEEE, 242\u2013251","author":"Liu Siyuan","year":"2018","unstructured":"Siyuan Liu and Arijit Khan . 2018 . An Empirical Analysis on Expressibility of Vertex Centric Graph Processing Paradigm. In 2018 IEEE International Conference on Big Data (Big Data). IEEE, 242\u2013251 . Siyuan Liu and Arijit Khan. 2018. An Empirical Analysis on Expressibility of Vertex Centric Graph Processing Paradigm. In 2018 IEEE International Conference on Big Data (Big Data). IEEE, 242\u2013251."},{"key":"e_1_3_2_1_104_1","volume-title":"ACM SIGARCH computer architecture news, Vol.\u00a036","author":"Loh H","unstructured":"Gabriel\u00a0 H Loh . 2008. 3D-stacked memory architectures for multi-core processors . In ACM SIGARCH computer architecture news, Vol.\u00a036 . IEEE Computer Society , 453\u2013464. Gabriel\u00a0H Loh. 2008. 3D-stacked memory architectures for multi-core processors. In ACM SIGARCH computer architecture news, Vol.\u00a036. IEEE Computer Society, 453\u2013464."},{"key":"e_1_3_2_1_105_1","doi-asserted-by":"crossref","unstructured":"Linyuan L\u00fc and Tao Zhou. 2011. Link prediction in complex networks: A survey. Physica A: statistical mechanics and its applications 390 6(2011) 1150\u20131170.  Linyuan L\u00fc and Tao Zhou. 2011. Link prediction in complex networks: A survey. Physica A: statistical mechanics and its applications 390 6(2011) 1150\u20131170.","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"e_1_3_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065034"},{"key":"e_1_3_2_1_107_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_109_1","volume-title":"2017 USENIX Annual Technical Conference (USENIX ATC\u201917)","author":"Malicevic Jasmina","year":"2017","unstructured":"Jasmina Malicevic , Baptiste Lepers , and Willy Zwaenepoel . 2017 . Everything you always wanted to know about multicore graph processing but were afraid to ask . In 2017 USENIX Annual Technical Conference (USENIX ATC\u201917) . 631\u2013643. Jasmina Malicevic, Baptiste Lepers, and Willy Zwaenepoel. 2017. Everything you always wanted to know about multicore graph processing but were afraid to ask. In 2017 USENIX Annual Technical Conference (USENIX ATC\u201917). 631\u2013643."},{"key":"e_1_3_2_1_110_1","doi-asserted-by":"publisher","DOI":"10.1145\/3307650.3322275"},{"key":"e_1_3_2_1_111_1","unstructured":"Daniel Mawhirter Sam Reinehr Connor Holmes Tongping Liu and Bo Wu. 2019. GraphZero: Breaking Symmetry for Efficient Graph Mining. arXiv preprint arXiv:1911.12877(2019).  Daniel Mawhirter Sam Reinehr Connor Holmes Tongping Liu and Bo Wu. 2019. GraphZero: Breaking Symmetry for Efficient Graph Mining. arXiv preprint arXiv:1911.12877(2019)."},{"key":"e_1_3_2_1_112_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359633"},{"key":"e_1_3_2_1_113_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_3_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_115_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755574"},{"key":"e_1_3_2_1_116_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600216"},{"key":"e_1_3_2_1_117_1","volume-title":"Processing Data Where It Makes Sense: Enabling In-Memory Computation. MicPro","author":"O. Mutlu","year":"2019","unstructured":"O. Mutlu 2019. Processing Data Where It Makes Sense: Enabling In-Memory Computation. MicPro ( 2019 ). O. Mutlu 2019. Processing Data Where It Makes Sense: Enabling In-Memory Computation. MicPro (2019)."},{"key":"e_1_3_2_1_118_1","unstructured":"Onur Mutlu Saugata Ghose Juan G\u00f3mez-Luna and Rachata Ausavarungnirun. 2020. A Modern Primer on Processing in Memory. arXiv preprint arXiv:2012.03112(2020).  Onur Mutlu Saugata Ghose Juan G\u00f3mez-Luna and Rachata Ausavarungnirun. 2020. A Modern Primer on Processing in Memory. arXiv preprint arXiv:2012.03112(2020)."},{"key":"e_1_3_2_1_119_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358308"},{"key":"e_1_3_2_1_120_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2017.54"},{"key":"e_1_3_2_1_121_1","unstructured":"Neo4j Inc.2019. The Neo4j Graph Algorithms User Guide v3.5. https:\/\/neo4j.com\/docs\/graph-algorithms\/current.  Neo4j Inc.2019. The Neo4j Graph Algorithms User Guide v3.5. https:\/\/neo4j.com\/docs\/graph-algorithms\/current."},{"key":"e_1_3_2_1_122_1","volume-title":"DAMOV: A New Methodology and Benchmark Suite for Evaluating Data Movement Bottlenecks. arXiv preprint arXiv:2105.03725(2021).","author":"Oliveira F","year":"2021","unstructured":"Geraldo\u00a0 F Oliveira , Juan G\u00f3mez-Luna , Lois Orosa , Saugata Ghose , Nandita Vijaykumar , Ivan Fernandez , Mohammad Sadrosadati , and Onur Mutlu . 2021 . DAMOV: A New Methodology and Benchmark Suite for Evaluating Data Movement Bottlenecks. arXiv preprint arXiv:2105.03725(2021). Geraldo\u00a0F Oliveira, Juan G\u00f3mez-Luna, Lois Orosa, Saugata Ghose, Nandita Vijaykumar, Ivan Fernandez, Mohammad Sadrosadati, and Onur Mutlu. 2021. DAMOV: A New Methodology and Benchmark Suite for Evaluating Data Movement Bottlenecks. arXiv preprint arXiv:2105.03725(2021)."},{"key":"e_1_3_2_1_123_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.24"},{"key":"e_1_3_2_1_124_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00067"},{"key":"e_1_3_2_1_125_1","doi-asserted-by":"crossref","unstructured":"Keshav Pingali Donald Nguyen Milind Kulkarni Martin Burtscher M\u00a0Amber Hassaan Rashid Kaleem Tsung-Hsien Lee Andrew Lenharth Roman Manevich and Mario M\u00e9ndez-Lojo. 2011. The tao of parallelism in algorithms. In ACM Sigplan Notices Vol.\u00a046. ACM 12\u201325.  Keshav Pingali Donald Nguyen Milind Kulkarni Martin Burtscher M\u00a0Amber Hassaan Rashid Kaleem Tsung-Hsien Lee Andrew Lenharth Roman Manevich and Mario M\u00e9ndez-Lojo. 2011. The tao of parallelism in algorithms. In ACM Sigplan Notices Vol.\u00a046. ACM 12\u201325.","DOI":"10.1145\/1993316.1993501"},{"key":"e_1_3_2_1_126_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.03.198"},{"key":"e_1_3_2_1_127_1","unstructured":"Gengyu Rao Jingji Chen Jason Yik and Xuehai Qian. 2021. IntersectX: An Accelerator for Graph Mining. arXiv preprint arXiv:2012.10848(2021).  Gengyu Rao Jingji Chen Jason Yik and Xuehai Qian. 2021. IntersectX: An Accelerator for Graph Mining. arXiv preprint arXiv:2012.10848(2021)."},{"key":"e_1_3_2_1_128_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDIM.2012.6360146"},{"key":"e_1_3_2_1_129_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci025605o"},{"key":"e_1_3_2_1_130_1","unstructured":"Pedro Ribeiro Pedro Paredes Miguel\u00a0EP Silva David Aparicio and Fernando Silva. 2019. A Survey on Subgraph Counting: Concepts Algorithms and Applications to Network Motifs and Graphlets. arXiv preprint arXiv:1910.13011(2019).  Pedro Ribeiro Pedro Paredes Miguel\u00a0EP Silva David Aparicio and Fernando Silva. 2019. A Survey on Subgraph Counting: Concepts Algorithms and Applications to Network Motifs and Graphlets. arXiv preprint arXiv:1910.13011(2019)."},{"key":"e_1_3_2_1_131_1","volume-title":"O\u2019Reilly Media","author":"Robinson Ian","unstructured":"Ian Robinson , Jim Webber , and Emil Eifrem . 2013. Graph databases . \u201d O\u2019Reilly Media , Inc .\u201d. Ian Robinson, Jim Webber, and Emil Eifrem. 2013. Graph databases. \u201d O\u2019Reilly Media, Inc.\u201d."},{"key":"e_1_3_2_1_132_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897350.2897355"},{"key":"e_1_3_2_1_133_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897350.2897355"},{"key":"e_1_3_2_1_134_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_135_1","unstructured":"Sherif Sakr Angela Bonifati Hannes Voigt Alexandru Iosup Khaled Ammar Renzo Angles Walid Aref Marcelo Arenas Maciej Besta Peter\u00a0A Boncz 2020. The Future is Big Graphs! A Community View on Graph Processing Systems. arXiv preprint arXiv:2012.06171(2020).  Sherif Sakr Angela Bonifati Hannes Voigt Alexandru Iosup Khaled Ammar Renzo Angles Walid Aref Marcelo Arenas Maciej Besta Peter\u00a0A Boncz 2020. The Future is Big Graphs! A Community View on Graph Processing Systems. arXiv preprint arXiv:2012.06171(2020)."},{"key":"e_1_3_2_1_136_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732294"},{"key":"e_1_3_2_1_137_1","volume-title":"Graph clustering. Computer science review 1, 1","author":"Schaeffer Satu\u00a0Elisa","year":"2007","unstructured":"Satu\u00a0Elisa Schaeffer . 2007. Graph clustering. Computer science review 1, 1 ( 2007 ), 27\u201364. Satu\u00a0Elisa Schaeffer. 2007. Graph clustering. Computer science review 1, 1 (2007), 27\u201364."},{"key":"e_1_3_2_1_138_1","unstructured":"Thomas Schank. 2007. Algorithmic aspects of triangle-based network analysis. Phd in computer science University Karlsruhe 3 (2007).  Thomas Schank. 2007. Algorithmic aspects of triangle-based network analysis. Phd in computer science University Karlsruhe 3 (2007)."},{"key":"e_1_3_2_1_139_1","doi-asserted-by":"publisher","DOI":"10.1145\/2678373.2665697"},{"key":"e_1_3_2_1_140_1","doi-asserted-by":"publisher","DOI":"10.1145\/2540708.2540725"},{"key":"e_1_3_2_1_141_1","doi-asserted-by":"publisher","DOI":"10.1145\/3123939.3124544"},{"key":"e_1_3_2_1_142_1","doi-asserted-by":"publisher","DOI":"10.1145\/3128571"},{"key":"e_1_3_2_1_143_1","unstructured":"Yossi Shiloach and Uzi Vishkin. 1980. An O (log n) parallel connectivity algorithm. Technical Report. Computer Science Department Technion.  Yossi Shiloach and Uzi Vishkin. 1980. An O (log n) parallel connectivity algorithm. Technical Report. Computer Science Department Technion."},{"key":"e_1_3_2_1_144_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90008-6"},{"key":"e_1_3_2_1_145_1","doi-asserted-by":"crossref","unstructured":"Julian Shun and Guy\u00a0E Blelloch. 2013. Ligra: a lightweight graph processing framework for shared memory. In ACM SIGPLAN Notices Vol.\u00a048. 135\u2013146.  Julian Shun and Guy\u00a0E Blelloch. 2013. Ligra: a lightweight graph processing framework for shared memory. In ACM SIGPLAN Notices Vol.\u00a048. 135\u2013146.","DOI":"10.1145\/2517327.2442530"},{"key":"e_1_3_2_1_146_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"e_1_3_2_1_147_1","volume-title":"Dijkstra\u2019s algorithm. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica","author":"Skiena S","year":"1990","unstructured":"S Skiena . 1990. Dijkstra\u2019s algorithm. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica , Reading, MA : Addison-Wesley ( 1990 ), 225\u2013227. S Skiena. 1990. Dijkstra\u2019s algorithm. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, Reading, MA: Addison-Wesley (1990), 225\u2013227."},{"key":"e_1_3_2_1_148_1","doi-asserted-by":"publisher","DOI":"10.1145\/3126908.3126971"},{"key":"e_1_3_2_1_149_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00052"},{"key":"e_1_3_2_1_150_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2032324100"},{"key":"e_1_3_2_1_151_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809983"},{"key":"e_1_3_2_1_152_1","unstructured":"Michael Sutton Tal Ben-Nun and Amnon Barak. [n. d.]. Optimizing Parallel Graph Connectivity Computation via Subgraph Sampling. ([n. d.]).  Michael Sutton Tal Ben-Nun and Amnon Barak. [n. d.]. Optimizing Parallel Graph Connectivity Computation via Subgraph Sampling. ([n. d.])."},{"key":"e_1_3_2_1_153_1","volume-title":"Graph mining: procedure, application to drug discovery and recent advances. Drug discovery today 18, 1-2","author":"Takigawa Ichigaku","year":"2013","unstructured":"Ichigaku Takigawa and Hiroshi Mamitsuka . 2013. Graph mining: procedure, application to drug discovery and recent advances. Drug discovery today 18, 1-2 ( 2013 ), 50\u201357. Ichigaku Takigawa and Hiroshi Mamitsuka. 2013. Graph mining: procedure, application to drug discovery and recent advances. Drug discovery today 18, 1-2 (2013), 50\u201357."},{"key":"e_1_3_2_1_154_1","volume-title":"Managing and Mining Graph Data","author":"Tang Lei","unstructured":"Lei Tang and Huan Liu . 2010. Graph mining applications to social network analysis . In Managing and Mining Graph Data . Springer , 487\u2013513. Lei Tang and Huan Liu. 2010. Graph mining applications to social network analysis. In Managing and Mining Graph Data. Springer, 487\u2013513."},{"key":"e_1_3_2_1_155_1","unstructured":"Ben Taskar Ming-Fai Wong Pieter Abbeel and Daphne Koller. 2004. Link prediction in relational data. In Advances in neural information processing systems. 659\u2013666.  Ben Taskar Ming-Fai Wong Pieter Abbeel and Daphne Koller. 2004. Link prediction in relational data. In Advances in neural information processing systems. 659\u2013666."},{"key":"e_1_3_2_1_156_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"key":"e_1_3_2_1_157_1","volume-title":"Cluster Analysis for Anomaly Detection in Accounting Data: An Audit Approach.International Journal of Digital Accounting Research 11","author":"Thiprungsri Sutapat","year":"2011","unstructured":"Sutapat Thiprungsri and Miklos\u00a0 A Vasarhelyi . 2011. Cluster Analysis for Anomaly Detection in Accounting Data: An Audit Approach.International Journal of Digital Accounting Research 11 ( 2011 ). Sutapat Thiprungsri and Miklos\u00a0A Vasarhelyi. 2011. Cluster Analysis for Anomaly Detection in Accounting Data: An Audit Approach.International Journal of Digital Accounting Research 11 (2011)."},{"key":"e_1_3_2_1_158_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_2_1_159_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_1_160_1","doi-asserted-by":"publisher","DOI":"10.5555\/2523721.2523748"},{"key":"e_1_3_2_1_161_1","volume-title":"13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18). 763\u2013782.","author":"Wang Kai","unstructured":"Kai Wang , Zhiqiang Zuo , John Thorpe , Tien\u00a0Quang Nguyen , and Guoqing\u00a0Harry Xu. 2018. Rstream: marrying relational algebra with streaming for efficient graph mining on a single machine . In 13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18). 763\u2013782. Kai Wang, Zhiqiang Zuo, John Thorpe, Tien\u00a0Quang Nguyen, and Guoqing\u00a0Harry Xu. 2018. Rstream: marrying relational algebra with streaming for efficient graph mining on a single machine. In 13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18). 763\u2013782."},{"key":"e_1_3_2_1_162_1","doi-asserted-by":"publisher","DOI":"10.2174\/1574893609666140516005740"},{"key":"e_1_3_2_1_163_1","doi-asserted-by":"publisher","DOI":"10.1145\/959242.959249"},{"key":"e_1_3_2_1_164_1","volume-title":"Social network analysis: Methods and applications. Vol.\u00a08","author":"Wasserman Stanley","unstructured":"Stanley Wasserman and Katherine Faust . 1994. Social network analysis: Methods and applications. Vol.\u00a08 . Cambridge university press . Stanley Wasserman and Katherine Faust. 1994. Social network analysis: Methods and applications. Vol.\u00a08. Cambridge university press."},{"key":"e_1_3_2_1_165_1","volume-title":"The risc-v instruction set manual","author":"Waterman Andrew","year":"2011","unstructured":"Andrew Waterman , Yunsup Lee , David\u00a0 A Patterson , and Krste Asanovic . 2011. The risc-v instruction set manual , volume i: Base user-level isa. EECS Department, UC Berkeley, Tech. Rep. UCB\/EECS-2011- 62 116 ( 2011 ). Andrew Waterman, Yunsup Lee, David\u00a0A Patterson, and Krste Asanovic. 2011. The risc-v instruction set manual, volume i: Base user-level isa. EECS Department, UC Berkeley, Tech. Rep. UCB\/EECS-2011-62 116 (2011)."},{"key":"e_1_3_2_1_167_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_1_168_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00033"},{"key":"e_1_3_2_1_169_1","volume-title":"Domino: Graph Processing Services on Energy-Efficient Hardware Accelerator. In 2018 IEEE International Conference on Web Services (ICWS). IEEE, 274\u2013281","author":"Xu Chongchong","year":"2018","unstructured":"Chongchong Xu , Chao Wang , Lei Gong , Lihui Jin , Xi Li , and Xuehai Zhou . 2018 . Domino: Graph Processing Services on Energy-Efficient Hardware Accelerator. In 2018 IEEE International Conference on Web Services (ICWS). IEEE, 274\u2013281 . Chongchong Xu, Chao Wang, Lei Gong, Lihui Jin, Xi Li, and Xuehai Zhou. 2018. Domino: Graph Processing Services on Energy-Efficient Hardware Accelerator. In 2018 IEEE International Conference on Web Services (ICWS). IEEE, 274\u2013281."},{"key":"e_1_3_2_1_170_1","unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2018. How powerful are graph neural networks?arXiv preprint arXiv:1810.00826(2018).  Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2018. How powerful are graph neural networks?arXiv preprint arXiv:1810.00826(2018)."},{"key":"e_1_3_2_1_171_1","unstructured":"Da Yan Hongzhi Chen James Cheng M\u00a0Tamer \u00d6zsu Qizhen Zhang and John Lui. 2017. G-thinker: big graph mining made easier and faster. arXiv preprint arXiv:1709.03110(2017).  Da Yan Hongzhi Chen James Cheng M\u00a0Tamer \u00d6zsu Qizhen Zhang and John Lui. 2017. G-thinker: big graph mining made easier and faster. arXiv preprint arXiv:1709.03110(2017)."},{"key":"e_1_3_2_1_172_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733089"},{"key":"e_1_3_2_1_173_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00208"},{"key":"e_1_3_2_1_174_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00012"},{"key":"e_1_3_2_1_175_1","unstructured":"Pengcheng Yao Long Zheng Zhen Zeng Yu Huang Chuangyi Gui Xiaofei Liao Hai Jin and Jingling Xue. [n. d.]. A Locality-Aware Energy-Efficient Accelerator for Graph Mining Applications. ([n. d.]).  Pengcheng Yao Long Zheng Zhen Zeng Yu Huang Chuangyi Gui Xiaofei Liao Hai Jin and Jingling Xue. [n. d.]. A Locality-Aware Energy-Efficient Accelerator for Graph Mining Applications. ([n. d.])."},{"key":"e_1_3_2_1_176_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO50266.2020.00077"},{"key":"e_1_3_2_1_177_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00053"},{"key":"e_1_3_2_1_178_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.29"},{"key":"e_1_3_2_1_179_1","volume-title":"Kaleido: An Efficient Out-of-core Graph Mining System on A Single Machine. arXiv preprint arXiv:1905.09572(2019).","author":"Zhao Cheng","year":"2019","unstructured":"Cheng Zhao , Zhibin Zhang , Peng Xu , Tianqi Zheng , and Xueqi Cheng . 2019 . Kaleido: An Efficient Out-of-core Graph Mining System on A Single Machine. arXiv preprint arXiv:1905.09572(2019). Cheng Zhao, Zhibin Zhang, Peng Xu, Tianqi Zheng, and Xueqi Cheng. 2019. Kaleido: An Efficient Out-of-core Graph Mining System on A Single Machine. arXiv preprint arXiv:1905.09572(2019)."},{"key":"e_1_3_2_1_180_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035943"},{"key":"e_1_3_2_1_181_1","volume-title":"Spara: An Energy-Efficient ReRAM-Based Accelerator for Sparse Graph Analytics Applications. In 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 696\u2013707","author":"Zheng Long","year":"2020","unstructured":"Long Zheng , Jieshan Zhao , Yu Huang , Qinggang Wang , Zhen Zeng , Jingling Xue , Xiaofei Liao , and Hai Jin . 2020 . Spara: An Energy-Efficient ReRAM-Based Accelerator for Sparse Graph Analytics Applications. In 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 696\u2013707 . Long Zheng, Jieshan Zhao, Yu Huang, Qinggang Wang, Zhen Zeng, Jingling Xue, Xiaofei Liao, and Hai Jin. 2020. Spara: An Energy-Efficient ReRAM-Based Accelerator for Sparse Graph Analytics Applications. In 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 696\u2013707."},{"key":"e_1_3_2_1_182_1","doi-asserted-by":"crossref","unstructured":"Minxuan Zhou Mohsen Imani Saransh Gupta Yeseong Kim and Tajana Rosing. 2019. GRAM: graph processing in a ReRAM-based computational memory.. In ASP-DAC. 591\u2013596.  Minxuan Zhou Mohsen Imani Saransh Gupta Yeseong Kim and Tajana Rosing. 2019. GRAM: graph processing in a ReRAM-based computational memory.. In ASP-DAC. 591\u2013596.","DOI":"10.1145\/3287624.3287711"},{"key":"e_1_3_2_1_183_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358256"}],"event":{"name":"MICRO '21: 54th Annual IEEE\/ACM International Symposium on Microarchitecture","location":"Virtual Event Greece","acronym":"MICRO '21","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["MICRO-54: 54th Annual IEEE\/ACM International Symposium on Microarchitecture"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3466752.3480133","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3466752.3480133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:57Z","timestamp":1750191537000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3466752.3480133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":181,"alternative-id":["10.1145\/3466752.3480133","10.1145\/3466752"],"URL":"https:\/\/doi.org\/10.1145\/3466752.3480133","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]},"assertion":[{"value":"2021-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}