default search action
Raghavendra Kanakagiri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c8]Raghavendra Kanakagiri
, Edgar Solomonik
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network. SPAA 2024: 169-181 - [i8]Maciej Besta, Robert Gerstenberger, Patrick Iff, Pournima Sonawane, Juan Gómez-Luna, Raghavendra Kanakagiri, Rui Min, Onur Mutlu, Torsten Hoefler, Raja Appuswamy, Aidan O'Mahony:
Hardware Acceleration for Knowledge Graph Processing: Challenges & Recent Developments. CoRR abs/2408.12173 (2024) - 2023
- [c7]Andreas Irmler
Optimizing Distributed Tensor Contractions Using Node-Aware Processor Grids. Euro-Par 2023: 710-724 - [c6]Maciej Besta
High-Performance and Programmable Attentional Graph Neural Networks with Global Tensor Formulations. SC 2023: 66:1-66:16 - [d11]Maciej Besta, Pawel Renc
GNN Scaling 0.1 Software Artifact. Zenodo, 2023 - [i7]Raghavendra Kanakagiri, Edgar Solomonik:
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network. CoRR abs/2307.05740 (2023) - [i6]Andreas Irmler, Raghavendra Kanakagiri, Sebastian T. Ohlmann, Edgar Solomonik, Andreas Grüneis:
Optimizing Distributed Tensor Contractions using Node-Aware Processor Grids. CoRR abs/2307.08829 (2023) - 2022
- [c5]Maciej Besta, Raphael Grob, Cesare Miglioli
Motif Prediction with Graph Neural Networks. KDD 2022: 35-45 - [c4]Tim Baer, Raghavendra Kanakagiri, Edgar Solomonik:
Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels. PP 2022: 72-83 - [c3]Maciej Besta, Cesare Miglioli
ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations. SC 2022: 43:1-43:17 - [i5]Maciej Besta, Cesare Miglioli, Paolo Sylos Labini
ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations. CoRR abs/2208.11469 (2022) - 2021
- [c2]Maciej Besta, Raghavendra Kanakagiri, Grzegorz Kwasniewski, Rachata Ausavarungnirun, Jakub Beránek
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems. MICRO 2021: 282-297 - [d10]Laxmikant V. Kalé
UIUC-PPL/charm: v7.0.0-rc1. Version v7.0.0-rc1. Zenodo, 2021 [all versions] - [d9]Laxmikant V. Kalé
UIUC-PPL/charm: v7.0.0-rc2. Version v7.0.0-rc2. Zenodo, 2021 [all versions] - [d8]Laxmikant V. Kalé
UIUC-PPL/charm: Charm++ version 7.0.0. Version v7.0.0. Zenodo, 2021 [all versions] - [i4]Maciej Besta, Raghavendra Kanakagiri, Grzegorz Kwasniewski, Rachata Ausavarungnirun, Jakub Beránek, Konstantinos Kanellopoulos, Kacper Janda, Zur Vonarburg-Shmaria, Lukas Gianinazzi, Ioana Stefan, Juan Gómez-Luna, Marcin Copik, Lukas Kapp-Schwoerer, Salvatore Di Girolamo, Marek Konieczny, Onur Mutlu, Torsten Hoefler:
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems. CoRR abs/2104.07582 (2021) - [i3]Maciej Besta, Raphael Grob, Cesare Miglioli, Nicola Bernold, Grzegorz Kwasniewski, Gabriel Gjini, Raghavendra Kanakagiri, Saleh Ashkboos, Lukas Gianinazzi, Nikoli Dryden, Torsten Hoefler:
Motif Prediction with Graph Neural Networks. CoRR abs/2106.00761 (2021) - [i2]Tim Baer, Raghavendra Kanakagiri, Edgar Solomonik:
Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels. CoRR abs/2110.04865 (2021) - 2020
- [c1]Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa
Communication-Efficient Jaccard similarity for High-Performance Distributed Genome Comparisons. IPDPS 2020: 1122-1132 - [d7]Laxmikant V. Kalé
UIUC-PPL/charm: v6.10.0. Version v6.10.0. Zenodo, 2020 [all versions] - [d6]Laxmikant V. Kalé
UIUC-PPL/charm: v6.10.1. Version v6.10.1. Zenodo, 2020 [all versions] - [d5]Laxmikant V. Kalé
UIUC-PPL/charm: Charm++ version 6.10.2. Version v6.10.2. Zenodo, 2020 [all versions] - [d4]Laxmikant V. Kalé
UIUC-PPL/charm: v6.11.0-beta1. Version v6.11.0-beta1. Zenodo, 2020 [all versions]
2010 – 2019
- 2019
- [j1]Minjung Kim, Subhasish Mandal, Eric Mikida, Kavitha Chandrasekar, Eric J. Bohm, Nikhil Jain, Qi Li, Raghavendra Kanakagiri, Glenn J. Martyna, Laxmikant V. Kalé, Sohrab Ismail-Beigi:
Scalable GW software for quasiparticle properties using OpenAtom. Comput. Phys. Commun. 244: 427-441 (2019) - [d3]Laxmikant V. Kalé
UIUC-PPL/charm: v6.10.0-beta1. Version v6.10.0-beta1. Zenodo, 2019 [all versions] - [d2]Laxmikant V. Kalé
UIUC-PPL/charm: v6.10.0-rc. Version v6.10.0-rc. Zenodo, 2019 [all versions] - [d1]Laxmikant V. Kalé
UIUC-PPL/charm: v6.10.0-rc2. Version v6.10.0-rc2. Zenodo, 2019 [all versions] - [i1]Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, Edgar Solomonik:
Communication-Efficient Jaccard Similarity for High-Performance Distributed Genome Comparisons. CoRR abs/1911.04200 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: