Kishore Kothapalli Assistant Professor Center for Security, Theory, and Algorithmic Research International Institute of Information Technology Hyderabad

Teaching (Current Semester)

• Discrete Mathematics
• Introduction to Parallel Algorithms and Programming

Professional Service

• Program Committee Member, ESA 2010, Engineering and Applications Track
• Program Committee Member, NCC 2010 (Networking Track)
• Program Committee Member, ICDCN 2010, Distributed Computing Track
• Tutorial titled ''GPU Architectural, Programming, and Performance Models'', at PPoPP, 2010, Bangalore, India, (with P. J. Narayanan and Suryakant Patidar). Slides for the tutorial are available here

Projects

• Acyclic Edge Coloring of Complete Graphs, Department of Science and Technology, Government of India, New Delhi, 2008-2011.
• Microsoft Opensource Technology Program Microsoft, 2008-2009.
• IBM Shared University Research Program, IBM 2009--
• Network Security Solutions

Publications

1. Jyothish Soman, K. Kothapalli, P. J. Narayanan, Fast GPU Algorithms for Graph Connectivity, to appear in Proc. of Workshop on Large Scale Parallel Processing (LSPP), (in conjunction with IEEE IPDPS), 2010.
2. B. Bruhadeshwar, K. Kothapalli and Indira Radhika, A Fully Dynamic and Self-Stabilizing TDMA Scheme for Wireless Ad-hoc Networks, to appear in AINA, 2010.
3. P. Satya Krishna, K. Kothapalli. The Power of Orientation in Symmetry Breaking, to appear in AINA, 2010.
4. Satish Varagani, K. Kothapalli , and V. Ch. Venkaiah, Acyclic Colroing of Graphs of Maximum Degree Delta, in Proc. of Indian Mathematical Society, 2009.
5. V. Satish, K. Yadav, K. Kothapalli, and V. Ch. Venkaiah. Acyclic Vertex Coloring of Graphs of Maximum Degree 4, In the 7th Japan Conference on Computational Geometry and Graphs, 2009.
6. V. Satish, K. Yadav, K. Kothapalli, and V. Ch. Venkaiah. Acyclic Vertex Coloring of Graphs of Maximum Degree 6 , To appear in the V Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS), 2009.
7. Kishore Kothapalli, Rishabh Mukherjee, Suhail Rehman Suryakant Patidar, P. J. Narayanan, and Kannan Srinathan. A Performance Prediction Model for the CUDA GPGPU Platform, in Proc. of 16th Annual International Conference on High Performance Computing (HiPC), Kochi, India, 2009 (to Appear).
8. Sreekanth Malladi, Bruhadeshwar Bezawada, and Kishore Kothapalli. Automatic analysis of distance bounding protocols, in Workshop on Foundations of Computer Security, 2009.
9. K. Ramanjaneyulu, V. Ch. Venkaiah and Kishore Kothapalli. Cordial labelings of a Class of Planar Graphs, AKCE Journal of Graphs and Combinatorics, 6, No. 1 (2009), pp. 171-181.
10. H. K. Krishnappa, Kishore Kothapalli, and V. Ch. Venkaiah. Vertex Magic Total Labelings of Complete Graphs, AKCE Journal of Graphs and Combinatorics, 6, No. 1 (2009), pp. 143-154.
11. S. Rehman, K.Kothapalli, and P. J. Narayanan. Fast and Scalable List Ranking on the GPU , to appear in the 23rd International Conference on Supercomputing, New York, 2009.
12. P. Satya Krishna, K. Kothapalli Empirical Analysis of Distribtued Coloring Algorithms, in IEEE International Advanced Computing Conference, March 2009.
13. B. Bruhadeshwar, K. Kothapalli, M. Poornima, Routing Protocol Security using Symmetric Key Based Techniques, in Proc. of ARES 2009.
14. B. Bruhadeshwar, K. Kothapalli, M. Sreedeepya, Reducing the cost of Session Key Establishment , in Proc. of ARES 2009.
15. V. Ch. Venkaiah, K. Kothapalli, B. Joshi, and K. Ramanjaneyulu, Acyclic Edge Coloring of Kp(q-1), Kp(q-1)(r-1), and K(p-1)(q-1),(p-1)(q-1) in International Conference on Graph Theory and its Applications, 2009.
16. Kishore Yadav, and Satish Varagani, K. Kothapalli, V. Ch. Venkaiah. Acyclic Vertex Coloring of Graphs of Maximum Degree 5 , in International Conference on Graph Theory and its Applications, 2009.
17. K. Ramanjaneyulu, K. Kothapalli, V. Ch. Venkaiah. Cordial Labeling of a Class of Planar Graphs, in Proc. of the International Workshop on Graph Labeling, 2009.
18. H. K. Krishnappa, K. Kothapalli, V. Ch. Venkaiah. Vertex Magic Total Labeling of Complete Graphs in Proc. of the International Workshop on Graph Labeling, 2009.
19. K. Kothapalli, B. Bruhadeshwar, S. Thorat, and A. Khandelwal. Payload Content Based Network Anomaly Detection, in Proc. of IEEE International Conference on the Applications of Digital Information and Web Technologies, 2008.
20. K. Kothapalli, B. Bruhadeshwar, S. Thorat, and A. Khandelwal. Anomalous Packet Detection using Partitioned Payload in Journal of Information Assurance and Security, Vol 4, pp. 195--202, 2008.
21. B. Bruhadeshwar and K. Kothapalli, A Family of Collusion-Resistant Protocols for Authentication, in Proc. of the International Conference on Distributed Computing and Networks (ICDCN), January 2008, Kolkata, India.
22. K. Kothapalli, R. Khot, R. Poola, and K. Srinathan, Self-Stabilizing Routing Algorithms for Wireless Ad hoc Networks, in Proc. of the International Conference on Distributed Computing and Internet Technologies (ICDCIT), Banglalore, 2008.
23. K. Kothapalli, V. Ch. Venkaiah, and K. Ramanjaneyulu, Anti-magic Labellings for a class of Planar Graphs, the Australasian Journal of Combinatorics, 2008.
24. K. Kothapalli and C. Scheideler, Lower bounds for Information Gathering in Adversarial Systems, in Proceedings of the International Conference on Distributed Computing in Sensor Systems, 2006.
25. K. Kothapalli, C. Scheideler, C. Schindelhauer and M. Onus, Distributed Coloring in $\tilde{O}(\sqrt{\log n})$ bits, in IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2006.
26. K. Kothapalli and C. Scheideler, Supervised Peer-to-Peer Systems, in Proceedings of IEEE International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN), 2005.
27. K. Kothapalli, M. Onus, A. Richa, and C. Scheideler, Efficient Broadcasting and Gathering in Wireless Ad Hoc Networks, in Proceedings of IEEE International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN), 2005.
28. K. Kothapalli, M. Onus, A. Richa and C. Scheideler, Constant Density Spanners for Wireless Ad Hoc Networks, in Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2005.
29. K. Kothapalli, G. Hager, et. al., ``CIS-UltraCal an open-source ultrasound calibration toolkit'', in Proceedings of SPIE International Symposium on Medical Imaging, 2005.
30. A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler and M. Thober, Pagoda: a Dynamic Overlay Network for Routing, Data Management, and Multicasting, in Proceedings of the 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2004.
31. K. Kothapalli and C. Scheideler, Information Gathering in Adversarial Systems: Lines and Cycles, in Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2003.
32. K. Kothapalli and S. Saxena, An Optimal Parallel Algorithm for General Maximal Matchings is as easy as for Bipartite Graphs, in Information Processing Letters, 75(4):145--151,2000.
33. K. Kothapalli and S. Saxena, ``Efficient Parallel Recognition of Small Induced Subgraphs'', in Proceedings of IEEE International Conference on Advances in Computing, 1999.

Theses and Technical Reports

• B. Bruhadeshwar, K. Kothapalli, and H. Dinghra, A Framework for Shared Object Access with Applications, 2008.
• K. Kothapalli, V. Ch. Venkaiah, Prasant Gopal, C. R. Subramanian, and W. D. Wallis. Lexicographically Smallest One Factorizations of Complete Graphs, 2007.
• A Genetic Algorithm for the Weighted Set Cover Problem, Submitted to the Department of Computer Science and Engineering, National Institute of Technology, Warangal, India, 1996.
• Parallel Algorithms for some Graph Problems, Submitted to the Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India, 1998.
• Topology and Routing in Overlay Networks Submitted to the Department of Computer Science, Johns Hopkins University, Baltimore, MD, USA, 2006.

Useful Tools

Hobbies