Alumni - B.Tech.

  1. Anirudh Gaddamanaugu, Performance Evaluation of Scheduling Algorithms in Optical Burst Switching Networks, (2008).

  2. Ashwinkumar B.V., Perfectly Reliable Message Transmission on Undirected Graphs, (2008).

  3. Balasubramanian S., Core Path in Special Classes of Graphs, (2008).

  4. Naga Naresh Karuturi, Group Key Management using Broadcast Encryption, (2008).

  5. Raghavendran G, Efficient Identity-Based Broadcase Signcryption Schemes, (2008).

  6. Aravindan V., Network Coding from a Game-Theoretic Perspective, (2007).

  7. Karthekeyan C., Secret Sharing for Commodity Schemes and Robust PIR Combiners, (2007).

  8. Ravishankar Krishnaswamy, Fault Tolerant Network Coding, (2007).

  9. Avinash Vaidyanathan V., Reliable Communication, (2006).

  10. Mukesh Meena, Elliptic Curve Cryptography, (2006).

  11. Raja Masa, Pairing Based Cryptography, (2006).

  12. Rajsekar M., Obfuscation in Cryptography, (2006).

  13. Ranjit Kumar K., On Efficient Protocols for Reliable Communication in Networks, (2006).

  14. Ravi Chandra Ch., Approximation Algorithms for On-Demand Information Dissemination, (2006).

  15. Aditya Y.S.V., A Survey on Selected Intrusion Detection Systems, (2005).

  16. Kamesh R., The Steiner Tree Problem, (2005).

  17. Srikanth Srinivasan, Using Communication Complexity and Branching Programs to Prove Lower Bounds, (2005).

  18. Tirthankar Dubey, A Survey of Some Recent Developments in Secure Multiparty Computation Techniques, (2005).

  19. Karthik S., Party Halls, Knapsacks and other online problems, (2004).

  20. Muthuramakrishnan V., Distributed consensus over hypergraphs tolerating dual failures, (2004).

  21. Ravikant D.V.S, Agreement on Synchronous Networks with local Broadcasts, (2004).

  22. Srikanth V., Optimal Protocols for Distributed Consensus Over Hypergraphs, (2004).

  23. Amitanand Aiyer S., Agreement Tolerating Faults, (2003).

  24. Chandrashekhar N., Secure Message Transmission in the Presence of Partial Faults, (2003).

  25. Mohan R., On Uniquely Restricted Matchings, (2003).

  26. Ruchi Kapoor, Design of an Electronic Cash Protocol that Resists Criminal Attacks, (2003).

  27. Sanketh Indrapu, Distributed Consensus, (2003).

  28. Vinod V., Efficient Secret Sharing and Oblivious Transfer, (2003).

  29. Sandeep Varma.V, Studies in Distributed omega-Automata and P Automata, (2003).

  30. A. Arun Prasath, Studies in Graph Rewriting P-systems and Distributed Quantum Automata, (2003).

  31. Vinod V., Efficient Secret Sharing and Oblivious Transfer, (2003).

  32. Ashwin Kumar M.V.N., Secure Communications, (2002).

  33. Gopi Krishna S., Non-Interactive Quantum Crypto-Computing, (2002).

  34. Pranava Raja Goundan, Equal-Flows in Networks, (2002).

  35. Sainath S.V.S., Parallel Algorithm for Minimum Connected Domination in Trapezoid Graphs, (2002).

  36. A. Siddhartha Reddy, Studies in Cellular Automata and Integer Weighted Pushdown Automata, (2002).

  37. Krishnaram K.N.G., Secure Distributed Protocols: Complexity and Approximation, (2001).

  38. Sudhakar G., A Linear Time Algorithm for Determining the Single Connectedness of a Directed Planar Graph , (2001).

  39. G.N. Santhanakrishnan, Studies in Distributed Probabilistic Automaton and Simple Test-Tube Systems, (2001).

  40. R. Nandakumar, On the Complexity of Optimal Player Simulation, (2001).

  41. Ajay C. Ramadoss, Lower bounds for the number of incomparable pairs in a poset of dimension n, (2000).

  42. Ajith Kumar M.N., On Designing Efficient Priority Queues, (2000).

  43. Ananthan S., Competitive Analysis of Some Online Optimization Problems, (2000).

  44. Arun Kumar Sahlam, Interactive Learning Environments for Theoretical Computer Science Education : Network Flow Algorithm Animatons, (2000).

  45. Prasanth Reddy K., On Heuristics to solve Real Time Vehicle Routing, (2000).

  46. Srinivasa Aditya Akella, Competitive Algorithms for Online Bin-Stretching, (2000).

  47. Udaya Bhanu G., Better Lower Bound For Online Machine Covering, (2000).

  48. T. Muralidhar, Generative Power of Splicing Systems, (2000).

  49. Anand Ganesh, Approximate Algorithms for Some Optimisation Problems, (1999).

  50. Arvind A., Competitive Analysis of Online Load Balancing Problems, (1999).

  51. Lakshminarayanan S., TCP-New Boston : An Enhanced Protocol for ATM Networks, (1999).

  52. Ravi Kant, Recognition Complexity of Partial Order Properties, (1999).

  53. S.V.Ramasubramanian, Finite Automata and Digital Images, (1999).

  54. D.Ambedkar, Genotype Structure and Re-writing Systems and Evolutionary Algorithm for L-system Inference Problem, (1999).

  55. Murali, Efficient Algorithms for Some Graph Theoretic Problems, (1998).

  56. Narayanan Sriram Ramabhadran, Intractibility Results For A Coloring Problem On Weighted Graphs, (1998).

  57. Naveen Kumar K.M., Algorithms Engineering : A novel approach towards experimental analysis and validation of formally proved systems, (1998).

  58. Rajasekar K, Probabilistic Data Structures for Priority Queues, (1998).

  59. Ravindra Shankar P., Algorithmic and Hardness Results for Certain Graph Theoretic Problems, (1998).

  60. Sridhar R, Buffering paradigm : A new technique to design worst-case efficient randomized data structures, (1998).

  61. Rahul Santhanam, Graph Splicing Systems, (1998).

  62. S R Kaushik, Studies in Contextual Grammars and Array Splicing Systems, (1998).

  63. Prahlad Harsha, Studies in Distributed Automata and Simple Test Tube Systems, (1998).

  64. Satishchander S., Recognition of Objects Moving on a Conveyor Using Fourier Descriptive Method, (1997).

  65. Shyam Raghunanadan, Recognition of Objects Moving on a Conveyor Using Method of Moments, (1997).

  66. Venkatesan G., Intractability results for certain Graph-Theoretic Optimization and Approximation Problems, (1997).

  67. Sadagopan S., A Document Classifying System using the Self Organising Map for Text Mining, (1997).

  68. Boyapati Chandrasekar, Worst Case optimal Data Structures for Priority Queues, Dequeue with Heap order and Parallel finger search trees, (1996).

  69. Madan Lal M.S., Tree 3 - Spanners and Bandwidth minimisation problems on special classes of graphs, (1996).

  70. Niranjan Neelakantan, Computer Based Learning, (1996).

  71. Srinivas G., Develop An Off-line Path Planning Algorithm For a Robotic System With Moving Obstacles, (1996).

  72. Rajagopalan S., Develop a Vision Based Off-line Path Planning Program Using Visibility Graph Method For a Robotic System, (1996).

  73. P I Vijayakumar, Path Planning among Moving Obstacles, (1996).

  74. Sumeet Lahrani, Intersection Removal of Simple Polygons, (1996).

  75. Preetham, Parallel Algorithms for some Optimization Problems, (1996).

  76. Mani Rajesh, Vision Based On-line/ Off-line Path Planning for a Robotic System II, (1995).

  77. Pankaj Kulkarni, The Tree 3-Spanner Problem on Some Special Class of Graphs, (1995).

  78. Ramakrishna V, Competitive Number Problem on Interval Graphs, (1995).

  79. Ramesh V.K., Efficient Algorithms for connectivity and Path problems on Some Special Classes of Graphs, (1995).

  80. Subramanian K., Vision Based On-line/ Off-line Path Planning for a Robotic System I, (1995).

  81. Karthik S Mahadevan, On the One-Separability Problem for Isothetic Polyhedra, (1995).

  82. Dushyanth Narayanan, On Some Problems in Isothetic 3-D Computational Geometry, (1995).

  83. Venkatsathyam V, Algorithms for the 3-D Maximum Empty L-shaped Polyhedron Problem and the Polygonal Stabber Problem, (1995).

  84. Anand S., Treewidth and Core Problems on Recursively Defined Classes of Graphs, (1994).

  85. Balaji R., Transitive Reduction Paradigm to Solve Domination Problems on Interval graphs, (1994).

  86. Gopalakrishnan C.P., Disjoint Paths in Permutation and Chordal Graphs, (1994).

  87. Madhukar K. Domination Problems on Trapezoid and Cotriangulated Graphs, (1994).

  88. D Pavan Kumar, Extremal Problems in Computational Geometry, (1994).

  89. B Prakash, On Some Problems in Computational Geometry, (1994).

  90. KVS Rajeev, On Some Problems in Visibility, (1994).

  91. Anand R., Graph Decomposition Techniques for Efficient Algorithm Design, (1993).

  92. Bobby V.R., A Framework for Negotiation in Distributed Problem Solving - I, (1993).

  93. Hari Balakrishnan, Efficient Algorithms for Asteroidal Triple-Free and Distance Hereditary Graphs, (1993).

  94. Jayanth Majhi, A Framework for Negotiation in Distributed Problem Solving - II, (1993).

  95. Nagavamsi P., Domination and other related Problems on certain Classes of Perfect Graphs, (1993).

  96. Amarnath D, Animation of Convex Hull Algorithms, (1993).

  97. C Chandra Sekhar, On Two Problems in Computational Geometry, (1993).

  98. V Kasturi Rangan, Some Problems in Computational Geometry, (1993).

  99. Satyan C.R., Ordering of Vertices - An Application Specific Paradigm, (1992).

  100. K Induprakas, Three Dimensional Motion Planning among Planar Obstacles, 1992.

  101. Balayoghan V.B., Efficient Sequential and Parallel Algorithms on Interval Graphs, (1991).

  102. Ravi Sundaram, 2-Link Isothetic Visibility in Orthogonal Polygons, (1991).

  103. Selvan Kulandaiswami, Efficient Algorithms for Circular Permutation Graphs, (1991).

  104. B Srikanth Iyengar, On Some Problems in Motion Planning, (1991).

  105. T M Murali, Motion Planning Among Circular Obstacles and Finding Empty Homothetic Triangles, (1991).

  106. Jayaram T.S., Efficient Algorithms on Block Graphs, (1990).

  107. Ramesh K., An Implementation of Quinton's Strategy for Systematic Design of Systolic Arrays, (1990).

  108. R Srikant, Fast Algorithms for Problems in Computational Geometry and Motion Planning, (1990).

  109. Ragini Shamsunder, Algorithms on the Modified Cellular Graph Automaton, (1990).

  110. Aravind S., Fast Algorithms for Some Problems on Interval and Permutation Graphs, (1989).

  111. Madhav Vishnu Marathe, Efficient Algorithms on Interval Graphs, (1989).

  112. Mahesh R., Domination and Path Problems in Permutation Graphs, (1989).

  113. Paramasivam, Experimental Studies on Probabilistic Analysis of Algorithms, (1989).

  114. Ravi, Irredundance and Location-Domination in Interval Graphs, (1989).

  115. Raju Narayanaswamy, Syntactic Inference and growth function of edge replacement graph OL Systems, (1989).

  116. Anil Sathyanarayana Rao, Efficient Systolic Algorithms for Interval Graph Problems, (1988).

  117. Babu Ozhur Narayanan, New Sequential and Parallel Algorithms for Diameter Partitioning, (1988).

  118. Bulusu Krishna Mohan, Recognition Algorithms for Triangulated Graphs, (1988).

  119. Krishnan S.V., Efficient Algorithms for Some Problems on Planar Graphs, (1988).

  120. Rajeev G., Some Parallel Algorithms in Motion Planning and Collision Avoidance, (1988).

  121. Seshadri, Efficient Algorithms for Some Path Problems on Chordal Graphs, (1988).

  122. Venkatesh Harinarayan, Fast Parallel Algorithms for Some Geometric Problems, (1988).

  123. Kodiyaklam Vijay, A Survey of Lower Bound Theory, (1987).

  124. Ramalingam G., Domination Problems in Intersection Graphs, (1987).

  125. Ramesh Govindan, Fast Geometric Algorithms for Location Problems, (1987).

  126. Sundar R., Finding the Abiding Paths and Its Applications, (1987).

  127. Atul Saini, Graph Problems on a Broadcast-Mesh Processor Array, (1986).

  128. Krishna Prasad B., Graph Problems on a Linear Systolic Array, (1986).

  129. Mohan R., A Survey of Methods for Union-Find Problems, (1986).

  130. Sudarshan S., A Fast Algorithm for Computing Sparse Visibility Graphs, (1986).

  131. Nainan Kovoor, Finding Optimal Aggregates in Arrays, (1984).

  132. P Sri Suresh, Description generation and Recognition of handwritten English Alphabets, (1981).

 
Page Designed by E. Boopal. Copyright Reserved @ 2008