Contact Information

Physical Address: Network Dynamics and Simulation Science Laboratory
Virginia Bioinformatics Institute, Virginia Tech
CRC Research Building XV
1880 Pratt Drive, Blacksburg, VA 24061
Phone: +1 (540) 231-5359
Fax: +1 (540) 231-2891 [Attn: Maleq Khan]
Email: my_first_nameATvbi.vt.edu
Home page: http://staff.vbi.vt.edu/maleq/

Research Interest

Design and analysis of algorithms
Distributed algorithms
Randomized algorithms
Wireless ad hoc networks
Communication networks in general
Data mining

Education

Awards

Publications

    New

  1. Structural and Relational Properties of Social Contact Networks with Applications to Public Health Informatics. (Maleq Khan, V.S. Anil Kumar, Madhav Marathe, Zhao Zhao, Tridib Duta.)
  2. Energy-Efficient Distributed Minimum Spanning Tree Construction: Tight Bounds and Algorithms. (Yongwook Choi, Maleq Khan, Anil Kumar, and Gopal Pandurangan.)

    Book Chapter

  3. Theory of Communication Networks, Algorithms and Theory of Computation Handbook, second edition, CRC Press, Eds. Mikhail Atallah and Marina Blanton. a draft version. (Gopal Pandurangan and Maleq Khan.)

    Peer-Reviewed Journal Papers (articles marked with '*' have also a conference version)

  4. *Energy-Optimal Distributed Algorithms for Minimum Spanning Trees, to appear in the Journal of Selected Areas in Communications, Vol. 27, No. 6, Sep 2009. (Yongwook Choi, Maleq Khan, Anil Kumar, and Gopal Pandurangan.)
  5. Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks, IEEE Transactions on Parallel and Distributed Systems, Pages 124-139, Vol. 20, No. 1, Jan 2009. (Maleq Khan, Gopal Pandurangan, and Anil Kumar.)
  6. *A Fast Distributed Approximation Algorithm for Minimum Spanning Trees, Distributed Computing. Pages 391-402, Vol. 20, No. 6, Apr 2008. (Maleq Khan and Gopal Pandurangan.)
  7. A Simple Randomized Scheme for Constructing Low-Weight k-Connected Spanning Subgraphs with Applications to Distributed Algorithms, Theoretical Computer Science, Pages 101-114, Vol. 385, No. 1-3, Oct. 2007. (Maleq Khan, Gopal Pandurangan, and Anil Kumar.)
  8. *An Efficient Weighted Nearest Neighbor Classifier using Vertical Data Representation, International Journal of Business Intelligence and Data Mining, Vol. 2, No. 1, 2007. (William Perrizo, Qin Ding, Maleq Khan, Anne Denton, and Qiang Ding.)
  9. Multimedia Data Transmission and Control using Active Networks, Journal of Computer Communications. Vol. 28, No. 6, Apr. 2005. (Bharat Bhargava, Sheng-Yih Wang, Maleq Khan and Ahsan Habib.)
  10. Edge-to-Edge Measurement-Based Distributed Network Monitoring, Journal of Computer Networks, Vol. 44, No. 2, Feb. 2004. (Ahsan Habib, Maleq Khan, and Bharat Bhargava.)

    Peer-Reviewed Conference Papers (articles marked with '*' have also a journal version)

  11. A Study of Information Diffusion over a Realistic Social Network Model, International Symposium on Social Computing Applications, Vancouver, Canada, Aug. 2009. (Andrea Apolloni, Karthik Channakeshava, Lisa Durbeck, Maleq Khan, Chris Kuhlman, Bryan Lewis, and Samarth Swarup)
  12. Generation and Analysis of Large Synthetic Social Contact Networks, Winter Simulation Conference (WSC), Austin, Texas, Dec. 2009. (Christopher Barrett, Richard Beckman, Maleq Khan, V.S. Anil Kumar, Madhav Marathe, Paula Stretz, Tridib Dutta, and Bryan Lewis)
  13. Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad hoc Networks. 28th Conference on Computer Communications (INFOCOM), Rio de Janeiro, Brazil, Apr. 2009. (Maleq Khan, V.S. Anil Kumar, Madhav V. Marathe, Gopal Pandurangan, and S.S. Ravi.)
  14. Efficient Distributed Approximation Algorithms via Probabilistic Tree Embeddings. 27th ACM Symposium on Principles of Distributed Computing (PODC), Toronto, Canada, Aug. 2008. (Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, and Kunal Talwar.)
  15. *Energy-Optimal Distributed Algorithms for Minimum Spanning Trees. 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Munich, Germany, Jun. 2008. (Yongwook Choi, Maleq Khan, Anil Kumar, and Gopal Pandurangan.)
  16. *A Fast Distributed Approximation Algorithm for Minimum Spanning Trees, 20th International Symposium on Distributed Computing (DISC), Sep. 2006, Stockholm, Sweden. Winner of the Best Student Paper Award -- a web story that appeared in the front page of Purdue Computer Science homepage in Sep. 2006. Also mentioned in the ACM SIGACT News -- if you don't have access to the ACM DL, here is another copy. (Maleq Khan and Gopal Pandurangan.)
  17. *PINE - Podium Incremental Neighbor Evaluator for Classifying Spatial Data, ACM Symposium on Applied Computing (SAC), Melbourne, FL, USA, March 2003. (William Perrizo, Qin Ding, Anne Denton, Kirk Scott, Qiang Ding, and Maleq Khan.)
  18. Fast k-Nearest Neighbor Classification on Spatial Data Streams Using P-trees, 6th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Taipei, Taiwan, May 2002. (Maleq Khan, Qin Ding, and William Perrizo.)
  19. The P-tree Algebra, ACM Symposium on Applied Computing (SAC), Madrid, Spain, March 2002. (Qin Ding, Maleq Khan, Amalendu Roy and William Perrizo.)

    Dissertation and Theses

  20. Distributed Approximation Algorithms for Minimum Spanning Trees and Other Related Problems with Application to Wireless Ad Hoc Networks, Ph.D. dissertation, Department of Computer Science, Purdue University, West Lafayette, Indiana, 2007. (Maleq Khan)
  21. Fast Distance Metric Based Data Mining Techniques Using P-trees, Masters thesis, Computer Science Department, North Dakota State University, Fargo, North Dakota, 2001. (Maleq Khan)
  22. Performance Analysis of Multiprocessor Systems with Multilevel Cache, undergraduate thesis, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka, 1996. (Maleq Khan and Mahmud Hasan)

    Technical Reports

  23. Energy-efficient distributed constructions of minimum spanning tree for wireless ad-hoc networks, Tech. Rep. CSD-TR-06-019, Department of Computer Science, Purdue University, October 2006. (Maleq Khan, Gopal Pandurangan, and V.S. Kumar)
  24. Energy-Efficient Routing Schemes for Wireless Sensor Networks, Tech. Rep., CSD TR 03-013, Department of Computer Science, Purdue University, July 2003. (Maleq Khan, Gopal Pandurangan, and Bharat Bhargava)
  25. Self-configuring Clusters, Data Aggregation, and Authentication in Microsensor Networks, Tech. Rep., CSD TR 03-005, Department of Computer Science, Purdue University, March 2003. (Maleq Khan, Bharat Bhargava, and Leszek Lilien)

Impact of Research

My papers have been cited by at least 134 scholarly articles as of May 2007.

Talks

Professional Experience

Professional Membership

Selected Projects

Computer Skills

C/C++, Visual C++, Java, Pascal, FORTRAN, Prolog, Lisp, Scheme, ML, Assembly Languages, Socket Programming, System Programming, Matlab, Latex, Tex, HTML, Unix, Linux, Windows NT, Novel NetWare, FoxPro, dBase, MS Access, MS-Word, MS-Excel, Power Point, PhotoShop.

Courses

Graduate Courses

Algorithm and Theory: Theory of Computation and Computational Complexity, Algorithm Design Analysis and Implementation, Network Algorithms, Randomized Algorithms and Probabilistic Techniques in Computer Science, Foundation of Programming.
System and Programming: Operating Systems, Compiling and Programming Systems, Programming Languages, Object-oriented Systems.
Database and Data Mining: Database System Internals, Distributed Database Systems, Multimedia Database Systems, Data Mining.
Others: Simulation and Modeling of Computer Systems, Cryptography, Artificial Intelligence, Software Engineering.

Related Undergraduate Courses

Computer Science: Operating Systems, Computer Networks, Compiler Design, Data Structures, Algorithms, Database Systems, Artificial Intelligence and Expert Systems, Pattern Recognition, Computer Graphics, Discrete Mathematics, Numerical Analysis, Machine and Assembly Language Programming, Software Development-I & II, Management Information Systems, Fault Tolerant Systems, Computer System Analysis, Computer and Social Problems.
Computer Engineering and Electronics: Data Communications, Computer Architecture, Switching Theory and Logical Design, Digital Circuit Design, Digital Electronics and Pulse Techniques, Microprocessors and Interfacing, Microprocessor Based Design, Electronic Devices and Circuits.
Others: I took at least ten courses in Mathematics and Statistics. I also took some basic courses in Electrical Engineering, Physics, and Chemistry.

References