Maleq Khan
Postdoctoral Research Associate, NDSSL, VBI.
Professional Preparation
- Purdue Univeristy, PhD Computer Science. 2007.
- North Dakota State University, MS in Computer Science, 2001.
- Bangladesh University of Engineering and Technology, BS in Computer Science and Engineering, 1996.
Research Interests
Broadly in the design and analysis of algorithms, and theoretical computer science. Specifically, distributed algorithms, randomized algorithms, approximation algorithms, wireless ad hoc networks, complex networks, and data mining.
Selected Publications
- Maleq Khan, Gopal Pandurangan, and Anil Kumar.
Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks,
to appear in IEEE Transactions on Parallel and Distributed Systems .
- Maleq Khan and Gopal Pandurangan.
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.
to appear in Distributed Computing.
- Maleq Khan, Gopal Pandurangan, and Anil Kumar.
A Simple Randomized Scheme for Constructing Low-Weight k-Connected Spanning Subgraphs with Applications to Distributed Algorithms.
Theoretical Computer Science, Pages 101-114, 385(1-3), Oct. 2007.
- Maleq Khan and Gopal Pandurangan.
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.
in the Proceedings of the 20th International Symposium on Distributed Computing (DISC), Sep. 2006, Stockholm, Sweden.
(Last updated: Tue Jan 29 15:03:02 EST 2008)
