Up : Main Page
Previous : Dual Degree
(B.Tech. / M.Tech.)
BACHELOR OF TECHNOLOGY
- Anirudh Gaddamanaugu, Performance Evaluation of Scheduling Algorithms in Optical Burst Switching Networks, (2008).
- Ashwinkumar B.V., Perfectly Reliable Message Transmission on Undirected Graphs, (2008).
- Balasubramanian S., Core Path in Special Classes of Graphs, (2008).
- Naga Naresh Karuturi, Group Key Management using Broadcast Encryption, (2008).
- Raghavendran G, Efficient Identity-Based Broadcase Signcryption Schemes, (2008).
- Aravindan V., Network Coding from a Game-Theoretic Perspective, (2007).
- Karthekeyan C., Secret Sharing for Commodity Schemes and Robust PIR Combiners, (2007).
- Ravishankar Krishnaswamy, Fault Tolerant Network Coding, (2007).
- Avinash Vaidyanathan V., Reliable Communication, (2006).
- Mukesh Meena, Elliptic Curve Cryptography, (2006).
- Raja Masa, Pairing Based Cryptography, (2006).
- Rajsekar M., Obfuscation in Cryptography, (2006).
- Ranjit Kumar K., On Efficient Protocols for Reliable Communication in Networks, (2006).
- Ravi Chandra Ch., Approximation Algorithms for On-Demand Information Dissemination, (2006).
- Aditya Y.S.V., A Survey on Selected Intrusion Detection Systems, (2005).
- Kamesh R., The Steiner Tree Problem, (2005).
- Srikanth Srinivasan, Using Communication Complexity and Branching Programs to Prove Lower Bounds, (2005).
- Tirthankar Dubey, A Survey of Some Recent Developments in Secure Multiparty Computation Techniques, (2005).
- Karthik S., Party Halls, Knapsacks and other online problems, (2004).
- Muthuramakrishnan V., Distributed consensus over hypergraphs tolerating dual failures, (2004).
- Ravikant D.V.S, Agreement on Synchronous Networks with local Broadcasts, (2004).
- Srikanth V., Optimal Protocols for Distributed Consensus Over Hypergraphs, (2004).
- Amitanand Aiyer S., Agreement Tolerating Faults, (2003).
- Chandrashekhar N., Secure Message Transmission in the Presence of Partial Faults, (2003).
- Mohan R., On Uniquely Restricted Matchings, (2003).
- Ruchi Kapoor, Design of an Electronic Cash Protocol that Resists Criminal Attacks, (2003).
- Sanketh Indrapu, Distributed Consensus, (2003).
- Vinod V., Efficient Secret Sharing and Oblivious Transfer, (2003).
- Ashwin Kumar M.V.N., Secure Communications, (2002).
- Gopi Krishna S., Non-Interactive Quantum Crypto-Computing, (2002).
- Pranava Raja Goundan, Equal-Flows in Networks, (2002).
- Sainath S.V.S., Parallel Algorithm for Minimum Connected Domination in Trapezoid Graphs, (2002).
- Krishnaram K.N.G., Secure Distributed Protocols: Complexity and Approximation, (2001).
- Sudhakar G., A Linear Time Algorithm for Determining the Single Connectedness of a Directed Planar Graph , (2001).
- Ajay C. Ramadoss, Lower bounds for the number of incomparable pairs in a poset of dimension n, (2000).
- Ajith Kumar M.N., On Designing Efficient Priority Queues, (2000).
- Ananthan S., Competitive Analysis of Some Online Optimization Problems, (2000).
- Arun Kumar Sahlam, Interactive Learning Environments for Theoretical Computer Science Education : Network Flow Algorithm Animatons, (2000).
- Prasanth Reddy K., On Heuristics to solve Real Time Vehicle Routing, (2000).
- Srinivasa Aditya Akella, Competitive Algorithms for Online Bin-Stretching, (2000).
- Udaya Bhanu G., Better Lower Bound For Online Machine Covering, (2000).
- Anand Ganesh, Approximate Algorithms for Some Optimisation Problems, (1999).
- Arvind A., Competitive Analysis of Online Load Balancing Problems, (1999).
- Lakshminarayanan S., TCP-New Boston : An Enhanced Protocol for ATM Networks, (1999).
- Ravi Kant, Recognition Complexity of Partial Order Properties, (1999).
- Murali, Efficient Algorithms for Some Graph Theoretic Problems, (1998).
- Narayanan Sriram Ramabhadran, Intractibility Results For A Coloring Problem On Weighted Graphs, (1998).
- Naveen Kumar K.M., Algorithms Engineering : A novel approach towards experimental analysis and validation of formally proved systems, (1998).
- Rajasekar K, Probabilistic Data Structures for Priority Queues, (1998).
- Ravindra Shankar P., Algorithmic and Hardness Results for Certain Graph Theoretic Problems, (1998).
- Sridhar R, Buffering paradigm : A new technique to design worst-case efficient randomized data structures, (1998).
- Satishchander S., Recognition of Objects Moving on a Conveyor Using Fourier Descriptive Method, (1997).
- Shyam Raghunanadan, Recognition of Objects Moving on a Conveyor Using Method of Moments, (1997).
- Venkatesan G., Intractability results for certain Graph-Theoretic Optimization and Approximation Problems, (1997).
- Sadagopan S., A Document Classifying System using the Self Organising Map for Text Mining, (1997).
- Boyapati Chandrasekar, Worst Case optimal Data Structures for Priority Queues, Dequeue with Heap order and Parallel finger search trees, (1996).
- Madan Lal M.S., Tree 3 - Spanners and Bandwidth minimisation problems on special classes of graphs, (1996).
- Niranjan Neelakantan, Computer Based Learning, (1996).
- Srinivas G., Develop An Off-line Path Planning Algorithm For a Robotic System With Moving Obstacles, (1996).
- Rajagopalan S., Develop a Vision Based Off-line Path Planning Program Using Visibility Graph Method For a Robotic System, (1996).
- Mani Rajesh, Vision Based On-line/ Off-line Path Planning for a Robotic System II, (1995).
- Pankaj Kulkarni, The Tree 3-Spanner Problem on Some Special Class of Graphs, (1995).
- Ramakrishna V, Competitive Number Problem on Interval Graphs, (1995).
- Ramesh V.K., Efficient Algorithms for connectivity and Path problems on Some Special Classes of Graphs, (1995).
- Subramanian K., Vision Based On-line/ Off-line Path Planning for a Robotic System I, (1995).
- Anand S., Treewidth and Core Problems on Recursively Defined Classes of Graphs, (1994).
- Balaji R., Transitive Reduction Paradigm to Solve Domination Problems on Interval graphs, (1994).
- Gopalakrishnan C.P., Disjoint Paths in Permutation and Chordal Graphs, (1994).
- Madhukar K. Domination Problems on Trapezoid and Cotriangulated Graphs, (1994).
- Anand R., Graph Decomposition Techniques for Efficient Algorithm Design, (1993).
- Bobby V.R., A Framework for Negotiation in Distributed Problem Solving - I, (1993).
- Hari Balakrishnan, Efficient Algorithms for Asteroidal Triple-Free and Distance Hereditary Graphs, (1993).
- Jayanth Majhi, A Framework for Negotiation in Distributed Problem Solving - II, (1993).
- Nagavamsi P., Domination and other related Problems on certain Classes of Perfect Graphs, (1993).
- Satyan C.R., Ordering of Vertices - An Application Specific Paradigm, (1992).
- Balayoghan V.B., Efficient Sequential and Parallel Algorithms on Interval Graphs, (1991).
- Ravi Sundaram, 2-Link Isothetic Visibility in Orthogonal Polygons, (1991).
- Selvan Kulandaiswami, Efficient Algorithms for Circular Permutation Graphs, (1991).
- Jayaram T.S., Efficient Algorithms on Block Graphs, (1990).
- Ramesh K., An Implementation of Quinton's Strategy for Systematic Design of Systolic Arrays, (1990).
- Aravind S., Fast Algorithms for Some Problems on Interval and Permutation Graphs, (1989).
- Madhav Vishnu Marathe, Efficient Algorithms on Interval Graphs, (1989).
- Mahesh R., Domination and Path Problems in Permutation Graphs, (1989).
- Paramasivam, Experimental Studies on Probabilistic Analysis of Algorithms, (1989).
- Ravi, Irredundance and Location-Domination in Interval Graphs, (1989).
- Anil Sathyanarayana Rao, Efficient Systolic Algorithms for Interval Graph Problems, (1988).
- Babu Ozhur Narayanan, New Sequential and Parallel Algorithms for Diameter Partitioning, (1988).
- Bulusu Krishna Mohan, Recognition Algorithms for Triangulated Graphs, (1988).
- Krishnan S.V., Efficient Algorithms for Some Problems on Planar Graphs, (1988).
- Rajeev G., Some Parallel Algorithms in Motion Planning and Collision Avoidance, (1988).
- Seshadri, Efficient Algorithms for Some Path Problems on Chordal Graphs, (1988).
- Venkatesh Harinarayan, Fast Parallel Algorithms for Some Geometric Problems, (1988).
- Kodiyaklam Vijay, A Survey of Lower Bound Theory, (1987).
- Ramalingam G., Domination Problems in Intersection Graphs, (1987).
- Ramesh Govindan, Fast Geometric Algorithms for Location Problems, (1987).
- Sundar R., Finding the Abiding Paths and Its Applications, (1987).
- Atul Saini, Graph Problems on a Broadcast-Mesh Processor Array, (1986).
- Krishna Prasad B., Graph Problems on a Linear Systolic Array, (1986).
- Mohan R., A Survey of Methods for Union-Find Problems, (1986).
- Sudarshan S., A Fast Algorithm for Computing Sparse Visibility Graphs, (1986).
- Nainan Kovoor, Finding Optimal Aggregates in Arrays, (1984).
Up : Main Page
Previous : Dual Degree
(B.Tech. / M.Tech.)
E.Boopal (Prof.CPR)
Wed Aug 5 15:36:01 IST 2008