default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKartik Lakhotia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Nils Blach, Maciej Besta, Daniele De Sensi, Jens Domke, Hussein Harake, Shigang Li, Patrick Iff, Marek Konieczny, Kartik Lakhotia, Ales Kubicek, Marcel Ferrari, Fabrizio Petrini, Torsten Hoefler:
A High-Performance Design, Implementation, Deployment, and Evaluation of The Slim Fly Network. NSDI 2024- [c18]Gabriel G. Santos, Kartik Lakhotia, César A. F. De Rose:
Towards a Scalable Parallel Infomap Algorithm for Community Detection. PDP 2024: 116-123 - [c17]Kartik Lakhotia
, Laura Monroe, Kelly Isham, Maciej Besta, Nils Blach, Torsten Hoefler, Fabrizio Petrini:
PolarStar: Expanding the Horizon of Diameter-3 Networks. SPAA 2024: 345-357 - [i11]Aleyah Dawkins, Kelly Isham, Ales Kubicek, Kartik Lakhotia, Laura Monroe:
Edge-Disjoint Spanning Trees on Star-Product Networks. CoRR abs/2403.12231 (2024) - 2023
- [j5]Kartik Lakhotia, Rajgopal Kannan, Viktor K. Prasanna:
Parallel Peeling of Bipartite Networks for Hierarchical Dense Subgraph Discovery. ACM Trans. Parallel Comput. 10(2): 5:1-5:35 (2023) - [c16]Matthew Joseph Adiletta, Jesmin Jahan Tithi, Emmanouil-Ioannis Farsarakis, Gerasimos Gerogiannis, Robert Adolf, Robert Benke, Sidharth Kashyap, Samuel Hsia, Kartik Lakhotia, Fabrizio Petrini, Gu-Yeon Wei, David Brooks:
Characterizing the Scalability of Graph Convolutional Networks on Intel® PIUMA. ISPASS 2023: 168-177 - [c15]Kartik Lakhotia, Kelly Isham, Laura Monroe, Maciej Besta, Torsten Hoefler, Fabrizio Petrini:
In-network Allreduce with Multiple Spanning Trees on PolarFly. SPAA 2023: 165-176 - [i10]Kartik Lakhotia, Laura Monroe, Kelly Isham, Maciej Besta, Nils Blach, Torsten Hoefler, Fabrizio Petrini:
PolarStar: Expanding the Scalability Horizon of Diameter-3 Networks. CoRR abs/2302.07217 (2023) - [i9]Nils Blach, Maciej Besta, Daniele De Sensi, Jens Domke, Hussein Harake, Shigang Li, Patrick Iff, Marek Konieczny, Kartik Lakhotia, Ales Kubicek, Marcel Ferrari, Fabrizio Petrini, Torsten Hoefler:
A High-Performance Design, Implementation, Deployment, and Evaluation of The Slim Fly Network. CoRR abs/2310.03742 (2023) - 2022
- [j4]Kartik Lakhotia, Fabrizio Petrini, Rajgopal Kannan, Viktor K. Prasanna:
Accelerating Allreduce With In-Network Reduction on Intel PIUMA. IEEE Micro 42(2): 44-52 (2022) - [c14]Kartik Lakhotia, Fabrizio Petrini, Rajgopal Kannan, Viktor K. Prasanna:
Accelerating Prefix Scan with in-network computing on Intel PIUMA. HIPC 2022: 59-68 - [c13]Kartik Lakhotia, Maciej Besta, Laura Monroe, Kelly Isham, Patrick Iff, Torsten Hoefler, Fabrizio Petrini:
PolarFly: A Cost-Effective and Flexible Low-Diameter Topology. SC 2022: 12:1-12:15 - [i8]Kartik Lakhotia, Maciej Besta, Laura Monroe, Kelly Isham, Patrick Iff, Torsten Hoefler, Fabrizio Petrini:
PolarFly: A Cost-Effective and Flexible Low-Diameter Topology. CoRR abs/2208.01695 (2022) - 2021
- [c12]Kartik Lakhotia, Fabrizio Petrini, Rajgopal Kannan, Viktor K. Prasanna:
In-network reductions on multi-dimensional HyperX. HOTI 2021: 1-8 - [i7]Kartik Lakhotia, Rajgopal Kannan, Viktor K. Prasanna:
Parallel Peeling of Bipartite Networks for Hierarchical Dense Subgraph Discovery. CoRR abs/2110.12511 (2021) - 2020
- [j3]Kartik Lakhotia, Rajgopal Kannan, Viktor K. Prasanna, César A. F. De Rose:
RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs. Proc. VLDB Endow. 14(3): 404-417 (2020) - [j2]Kartik Lakhotia, Rajgopal Kannan, Sourav Pati, Viktor K. Prasanna:
GPOP: A Scalable Cache- and Memory-efficient Framework for Graph Processing over Parts. ACM Trans. Parallel Comput. 7(1): 7:1-7:24 (2020) - [i6]Kartik Lakhotia, Rajgopal Kannan, Viktor K. Prasanna, César A. F. De Rose:
RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs. CoRR abs/2010.08695 (2020)
2010 – 2019
- 2019
- [j1]Kartik Lakhotia, Rajgopal Kannan, Qing Dong, Viktor K. Prasanna:
Planting Trees for scalable and efficient Canonical Hub Labeling. Proc. VLDB Endow. 13(4): 492-505 (2019) - [c11]Kartik Lakhotia, Rajgopal Kannan, Aditya Gaur, Ajitesh Srivastava, Viktor K. Prasanna:
Parallel edge-based sampling for static and dynamic graphs. CF 2019: 125-134 - [c10]Kartik Lakhotia, David Kempe:
Approximation Algorithms for Coordinating Ad Campaigns on Social Networks. CIKM 2019: 339-348 - [c9]Yue Niu, Hanqing Zeng, Ajitesh Srivastava, Kartik Lakhotia, Rajgopal Kannan, Yanzhi Wang, Viktor K. Prasanna:
SPEC2: SPECtral SParsE CNN Accelerator on FPGAs. HiPC 2019: 195-204 - [c8]Kartik Lakhotia, Rajgopal Kannan, Sourav Pati, Viktor K. Prasanna:
GPOP: a cache and memory-efficient framework for graph processing over partitions. PPoPP 2019: 393-394 - [i5]Kartik Lakhotia, Qing Dong, Rajgopal Kannan, Viktor K. Prasanna:
Planting Trees for scalable and efficient Canonical Hub Labeling. CoRR abs/1907.00140 (2019) - [i4]Kartik Lakhotia, David Kempe:
Approximation Algorithms for Coordinating Ad Campaigns on Social Networks. CoRR abs/1908.09185 (2019) - [i3]Yue Niu, Hanqing Zeng, Ajitesh Srivastava, Kartik Lakhotia, Rajgopal Kannan, Yanzhi Wang, Viktor K. Prasanna:
SPEC2: SPECtral SParsE CNN Accelerator on FPGAs. CoRR abs/1910.11103 (2019) - 2018
- [c7]Qing Dong, Kartik Lakhotia, Hanqing Zeng, Rajgopal Karman, Viktor K. Prasanna, Guna Seetharaman:
A Fast and Efficient Parallel Algorithm for Pruned Landmark Labeling. HPEC 2018: 1-7 - [c6]Kartik Lakhotia, Rajgopal Kannan, Viktor K. Prasanna:
Accelerating PageRank using Partition-Centric Processing. USENIX ATC 2018: 427-440 - [i2]Kartik Lakhotia, Sourav Pati, Rajgopal Kannan, Viktor K. Prasanna:
GPOP: A cache- and work-efficient framework for Graph Processing Over Partitions. CoRR abs/1806.08092 (2018) - 2017
- [c5]Kartik Lakhotia, Shreyas G. Singapura, Rajgopal Kannan, Viktor K. Prasanna:
ReCALL: Reordered Cache Aware Locality Based Graph Processing. HiPC 2017: 273-282 - [c4]Oded Green, James Fox, Euna Kim, Federico Busato, Nicola Bombieri, Kartik Lakhotia, Shijie Zhou, Shreyas G. Singapura, Hanqing Zeng, Rajgopal Kannan, Viktor K. Prasanna, David A. Bader:
Quickly finding a truss in a haystack. HPEC 2017: 1-7 - [c3]Shijie Zhou, Kartik Lakhotia, Shreyas G. Singapura, Hanqing Zeng, Rajgopal Kannan, Viktor K. Prasanna, James Fox, Euna Kim, Oded Green, David A. Bader:
Design and implementation of parallel PageRank on multicore platforms. HPEC 2017: 1-6 - [i1]Kartik Lakhotia, Rajgopal Kannan, Viktor K. Prasanna:
Accelerating PageRank using Partition-Centric Processing. CoRR abs/1709.07122 (2017) - 2016
- [c2]Atif Iqbal Ahangar, Rajat Agarwal, Kartik Lakhotia:
Real time low complexity VLSI decoder for prefix coded images. ISCAS 2016: 1694-1697 - [c1]Kartik Lakhotia, Gabriel Caffarena, Alberto Gil, David G. Márquez, Abraham Otero, Madhav P. Desai:
Low-Power, Low-Latency Hermite Polynomial Characterization of Heartbeats Using a Field-Programmable Gate Array. IWBBIO 2016: 266-276
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 21:22 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:
