Arif M. Khan

Orcid: 0000-0002-3272-9512

Affiliations:
  • Pacific Northwest National Laboratory, Richland, WA, USA
  • Purdue University, West Lafayette, IN, USA (former)


According to our database1, Arif M. Khan authored at least 20 papers between 2012 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
cuAlign: Scalable Network Alignment on GPU Accelerators.
Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, 2023

2021
EXAGRAPH: Graph and combinatorial methods for enabling exascale applications.
Int. J. High Perform. Comput. Appl., 2021

A Parallel Approximation Algorithm for Maximizing Submodular b-Matching.
CoRR, 2021

cuTS: scaling subgraph isomorphism on distributed multi-GPU systems using trie based data structure.
Proceedings of the International Conference for High Performance Computing, 2021

Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems.
Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), 2021

A Parallel Approximation Algorithm for Maximizing Submodular <i>b</i>-Matching.
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020
Street-level Travel-time Estimation via Aggregated Uber Data.
Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

2019
Exploring MPI Communication Models for Graph Applications Using Graph Matching as a Case Study.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

Mapping Arbitrarily Sparse Two-Body Interactions on One-Dimensional Quantum Circuits.
Proceedings of the 26th IEEE International Conference on High Performance Computing, 2019

2018
New Approximation Algorithms for Minimum Weighted Edge Cover.
Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, 2018

Adaptive anonymization of data using b-edge cover.
Proceedings of the International Conference for High Performance Computing, 2018

Distributed Louvain Algorithm for Graph Community Detection.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Parallel Algorithms Through Approximation: B-Edge Cover.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2016
Efficient Approximation Algorithms for Weighted b-Matching.
SIAM J. Sci. Comput., 2016

A New 3/2-Approximation Algorithm for the <i>b</i>-Edge Cover Problem.
Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016

Designing scalable <i>b</i>-Matching algorithms on distributed memory multiprocessors by approximation.
Proceedings of the International Conference for High Performance Computing, 2016

2015
Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures.
Computer, 2015

2013
Classifying Immunophenotypes With Templates From Flow Cytometry.
Proceedings of the ACM Conference on Bioinformatics, 2013

2012
A multithreaded algorithm for network alignment via approximate matching.
Proceedings of the SC Conference on High Performance Computing Networking, 2012

Multithreaded Algorithms for Maxmum Matching in Bipartite Graphs.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012


  Loading...