default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArif M. Khan
Person information
- affiliation: Pacific Northwest National Laboratory, Richland, WA, USA
- affiliation (former): Purdue University, West Lafayette, IN, USA
Other persons with the same name
- Arif Khan — disambiguation page
- Arif Khan 0001
![[0000-0002-5793-933X]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-5793-933X")
— University of Sydney, Faculty of Engineering & IT, NSW, Australia - Arif Khan 0002 — Pakistan Academy for Rural Development, Peshawar, Pakistan (and 1 more)
- Arif Khan 0003 — University of Florida, Gainesville, FL, USA
- Arif Khan 0004 — Saarland University, Saarbrücken, Germany (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c16]Lizhi Xiang, Arif M. Khan, S. M. Ferdous, Aravind Sukumaran-Rajam, Mahantesh Halappanavar:
cuAlign: Scalable Network Alignment on GPU Accelerators. SC Workshops 2023: 747-755- 2021
- [j3]Seher Acer, Ariful Azad, Erik G. Boman, Aydin Buluç, Karen D. Devine, S. M. Ferdous, Nitin Gawande, Sayan Ghosh, Mahantesh Halappanavar, Ananth Kalyanaraman, Arif Khan, Marco Minutoli, Alex Pothen, Sivasankaran Rajamanickam, Oguz Selvitopi, Nathan R. Tallent, Antonino Tumeo:
EXAGRAPH: Graph and combinatorial methods for enabling exascale applications. Int. J. High Perform. Comput. Appl. 35(6): 553-571 (2021) - [c15]S. M. Ferdous, Alex Pothen, Arif Khan, Ajay Panyala, Mahantesh Halappanavar:
A Parallel Approximation Algorithm for Maximizing Submodular b-Matching. ACDA 2021: 45-56 - [c14]Arun V. Sathanur, Arif M. Khan:
Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems. IEEE BigData 2021: 1731-1738 - [c13]Lizhi Xiang, Arif Khan, Edoardo Serra, Mahantesh Halappanavar, Aravind Sukumaran-Rajam:
cuTS: scaling subgraph isomorphism on distributed multi-GPU systems using trie based data structure. SC 2021: 69 - [i2]S. M. Ferdous, Alex Pothen, Arif Khan, Ajay Panyala, Mahantesh Halappanavar:
A Parallel Approximation Algorithm for Maximizing Submodular b-Matching. CoRR abs/2107.05793 (2021) - 2020
- [c12]Kelsey Maass, Arun V. Sathanur, Arif Khan, Robert Rallo:
Street-level Travel-time Estimation via Aggregated Uber Data. CSC 2020: 76-84 - [i1]Kelsey Maass, Arun V. Sathanur, Arif Khan, Robert Rallo:
Street-level Travel-time Estimation via Aggregated Uber Data. CoRR abs/2001.04533 (2020)
2010 – 2019
- 2019
- [c11]Arif M. Khan, Mahantesh Halappanavar, Tobias Hagge, Karol Kowalski, Alex Pothen, Sriram Krishnamoorthy:
Mapping Arbitrarily Sparse Two-Body Interactions on One-Dimensional Quantum Circuits. HiPC 2019: 52-62 - [c10]Sayan Ghosh, Mahantesh Halappanavar, Ananth Kalyanaraman, Arif Khan, Assefaw H. Gebremedhin:
Exploring MPI Communication Models for Graph Applications Using Graph Matching as a Case Study. IPDPS 2019: 761-770 - 2018
- [c9]S. M. Ferdous, Arif M. Khan, Alex Pothen:
Parallel Algorithms Through Approximation: B-Edge Cover. IPDPS 2018: 22-33 - [c8]Sayan Ghosh, Mahantesh Halappanavar, Antonino Tumeo, Ananth Kalyanaraman, Hao Lu, Daniel G. Chavarría-Miranda, Arif Khan, Assefaw Hadish Gebremedhin:
Distributed Louvain Algorithm for Graph Community Detection. IPDPS 2018: 885-895 - [c7]Arif Khan, Krzysztof Choromanski, Alex Pothen, S. M. Ferdous, Mahantesh Halappanavar, Antonino Tumeo:
Adaptive anonymization of data using b-edge cover. SC 2018: 59:1-59:11 - [c6]S. M. Ferdous, Alex Pothen, Arif Khan:
New Approximation Algorithms for Minimum Weighted Edge Cover. CSC 2018: 97-108 - 2017
- [b1]Arif M. Khan:
Parallel Graph Algorithms Through Approximation. Purdue University, USA, 2017 - 2016
- [j2]Arif M. Khan, Alex Pothen, Md. Mostofa Ali Patwary, Nadathur Rajagopalan Satish, Narayanan Sundaram, Fredrik Manne, Mahantesh Halappanavar, Pradeep Dubey:
Efficient Approximation Algorithms for Weighted b-Matching. SIAM J. Sci. Comput. 38(5) (2016) - [c5]Arif M. Khan, Alex Pothen, Md. Mostofa Ali Patwary, Mahantesh Halappanavar, Nadathur Rajagopalan Satish, Narayanan Sundaram, Pradeep Dubey:
Designing scalable b-Matching algorithms on distributed memory multiprocessors by approximation. SC 2016: 773-783 - [c4]Arif M. Khan, Alex Pothen:
A New 3/2-Approximation Algorithm for the b-Edge Cover Problem. CSC 2016: 52-61 - 2015
- [j1]Mahantesh Halappanavar, Alex Pothen, Ariful Azad, Fredrik Manne, Johannes Langguth, Arif M. Khan:
Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures. Computer 48(8): 46-55 (2015) - 2013
- [c3]Ariful Azad, Arif M. Khan, Bartek Rajwa, Saumyadipta Pyne, Alex Pothen:
Classifying Immunophenotypes With Templates From Flow Cytometry. BCB 2013: 256 - 2012
- [c2]Ariful Azad, Mahantesh Halappanavar, Sivasankaran Rajamanickam, Erik G. Boman, Arif M. Khan, Alex Pothen:
Multithreaded Algorithms for Maxmum Matching in Bipartite Graphs. IPDPS 2012: 860-872 - [c1]Arif M. Khan, David F. Gleich, Alex Pothen, Mahantesh Halappanavar:
A multithreaded algorithm for network alignment via approximate matching. SC 2012: 64
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-08-05 21:14 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:
