Export 3 results:
Sort by: Filters: Author is M. Khan [Clear All Filters]
"Work-Efficient Distributed Euclidean Minimum Spanning Tree,",
20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Munich, Germany, June , 2008.
"Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in a Wireless Sensor Networks",
IEEE Transactions on Parallel and Distributed Systems, 2008.
"A Simple Randomized Scheme for Constructing Low-Weight k-Connected Spanning Subgraphs with Applications to Distributed Algorithms",
Theoretical Computer Science, vol. 385, no. 1-3, pp. 101-114, 2007.