| Generation and analysis of large synthetic social contact networks CL Barrett, RJ Beckman, M Khan, VSA Kumar, MV Marathe, PE Stretz, ... Proceedings of the 2009 Winter Simulation Conference (WSC), 1003-1014, 2009 | 209 | 2009 |
| The P-tree algebra Q Ding, M Khan, A Roy, W Perrizo Proceedings of the 2002 ACM symposium on Applied computing, 426-431, 2002 | 195 | 2002 |
| k-nearest Neighbor Classification on Spatial Data Streams Using P-trees M Khan, Q Ding, W Perrizo Pacific-Asia Conference on Knowledge Discovery and Data Mining, 517-528, 2002 | 185 | 2002 |
| Distributed algorithms for constructing approximate minimum spanning trees in wireless sensor networks M Khan, G Pandurangan, VSA Kumar IEEE Transactions on Parallel and Distributed Systems 20 (1), 124-139, 2008 | 154 | 2008 |
| Patric: A parallel algorithm for counting triangles in massive networks S Arifuzzaman, M Khan, M Marathe Proceedings of the 22nd ACM international conference on Information …, 2013 | 121 | 2013 |
| Sahad: Subgraph analysis in massive networks using hadoop Z Zhao, G Wang, AR Butt, M Khan, VSA Kumar, MV Marathe 2012 IEEE 26th International Parallel and Distributed Processing Symposium …, 2012 | 98 | 2012 |
| A fast distributed approximation algorithm for minimum spanning trees M Khan, G Pandurangan Distributed Computing 20 (6), 391-402, 2008 | 83 | 2008 |
| Efficient distributed approximation algorithms via probabilistic tree embeddings M Khan, F Kuhn, D Malkhi, G Pandurangan, K Talwar Distributed Computing 25 (3), 189-205, 2012 | 82 | 2012 |
| A study of information diffusion over a realistic social network model A Apolloni, K Channakeshava, L Durbeck, M Khan, C Kuhlman, B Lewis, ... 2009 International Conference on Computational Science and Engineering 4 …, 2009 | 64 | 2009 |
| Subgraph enumeration in large social contact networks using parallel color coding and streaming Z Zhao, M Khan, VSA Kumar, MV Marathe 2010 39th International Conference on Parallel Processing, 594-603, 2010 | 54 | 2010 |
| A fast distributed approximation algorithm for minimum spanning trees M Khan, G Pandurangan International Symposium on Distributed Computing, 355-369, 2006 | 45 | 2006 |
| Edge-to-edge measurement-based distributed network monitoring A Habib, M Khan, B Bhargava Computer Networks 44 (2), 211-233, 2004 | 45 | 2004 |
| Distributed-memory parallel algorithms for generating massive scale-free networks using preferential attachment model M Alam, M Khan, MV Marathe Proceedings of the International Conference on High Performance Computing …, 2013 | 39 | 2013 |
| Theory of communication networks G Pandurangan, M Khan Algorithms and Theory of Computation Handbook, Second Edition. CRC Press, 2009 | 35 | 2009 |
| Energy-optimal distributed algorithms for minimum spanning trees Y Choi, M Khan, VSA Kumar, G Pandurangan IEEE Journal on Selected Areas in Communications 27 (7), 1297-1304, 2009 | 33 | 2009 |
| A fast parallel algorithm for counting triangles in graphs using dynamic load balancing S Arifuzzaman, M Khan, M Marathe 2015 IEEE International Conference on Big Data (Big Data), 1839-1847, 2015 | 26 | 2015 |
| A space-efficient parallel algorithm for counting exact triangles in massive networks S Arifuzzaman, M Khan, M Marathe 2015 IEEE 17th International Conference on High Performance Computing and …, 2015 | 26 | 2015 |
| Effect of modelling slum populations on influenza spread in Delhi J Chen, S Chu, Y Chungbaek, M Khan, C Kuhlman, A Marathe, H Mortveit, ... BMJ open 6 (9), e011699, 2016 | 24 | 2016 |
| Energy-efficient routing schemes for wireless sensor networks M Khan, G Pandurangan, B Bhargava Tech. Rep. of Department of Computer Science, 2003 | 24 | 2003 |
| CINET: A cyberinfrastructure for network science SE Abdelhamid, R Alo, SM Arifuzzaman, P Beckman, MH Bhuiyan, ... 2012 IEEE 8th International Conference on E-Science, 1-8, 2012 | 22 | 2012 |
Anil Vullikanti (V. S. Anil Kumar)University of VirginiaVerified email at virginia.edu
