Biography

Arif Khan’s research interest includes graph algorithm, high performance computing, approximation algorithm along with their applications in bioinformatics, social network and machine learning. His goal is to explore how approximation algorithms can solve big graph problems using leadership class supercomputers.

Interests

  • Complex Network Analysis
  • Artifical Intelligence
  • High Performance Computing
  • Bioinformatics

Education

  • PhD in Computer Science, 2017

    Purdue University

  • MSc in Computer Science, 2011

    University of Florida

  • BSc in Computer Science and Engg, 2006

    Bangladesh University of Engg & Tech (BUET)

Recent Publications

(2020). A Distributed Travel Time Estimation Capability for Metropolitan-sized Road Transportation Networks. SIGKDD Urban Computing.

PDF

(2020). Street-level Travel-time Estimation via Aggregated Uber Data. SIAM CSC.

PDF

(2019). Graph Analytics and Optimization Methods for Insights from the Uber Movement Data. ACM SCC.

PDF

(2019). Mapping Arbitrarily Sparse Two-body Interactions on One-dimensional Quantum Circuits. HiPC.

PDF

(2018). Adaptive Anonymization of Data using b-Edge Cover. Supercomputing.

PDF

Contact