Alumni - M.S.

  1. P. Krishna Prasad, Privacy Preserving Data Mining Algorithms, (2008).

  2. M.B.Siddardha, Studies on Certain Classes of Array Grammars and Ambiguity, (2007).

  3. Meena Singh, Privacy Preserving Database Operations, (2007).

  4. Krishnasuri Narayanam, Protecting Server Privacy in Private Information Retrieval Schemes, (2006).

  5. Ashish Choudhary, Networks of Evolutionary Procesors with Splicing Rules, (2005).

  6. N. Tharani Rajan, Sharing a Set of Secrets : on-perfect and Non-deterministic Approaches, (2005).

  7. V. Jayaprakash, Studies of Tissue P Systems as a model of Cellular Computing, (2004).

  8. B. Prabhu, Efficiency Considerations in Secure Distributed Computation, (2003).

  9. Y. Sivasubramanyam, Studies in weighted Automata with Application to Image Processing, 2002.

  10. K. Srinivas, Adaptive Forward Error Correction for ATM/WATM Networks, (2002).

  11. K. Sharda, Distributed Processing in various kinds of Automata, (2001).

  12. K. Srinathan, Secure Distributed Protocols: Construction and Complexity, (2001).

  13. D. Arun Kumar, Approximation Algorithms for Some NP-Hard Optimization Problems, (2001).

  14. Vanam Srilakshmi, Efficient Algorithms for Optimisation Problems on Isothetic Polygons, (2000).

  15. K. Arthi, Probabilistic Grammar Systems : Theory and Application, (2000).

  16. M. Sakthi Balan, Distributed Processing in Automata, (2000).

  17. R. Ganesh, Design and Implementation of Tutoring Systems - The Intermediate Control Approach, (1999).

  18. S.Jeyalakshmi, Design and Analysis of Algorithms Related to Point Sets and Polygons, (1998).

  19. V.Radhakrishnan, Pattern Matching in Matrix Grammars, (1997).

  20. A.Renuka, Algorithms for Some Isothetic Path Planning Problems, (1996).

  21. N.S. Janaki Latha, Investigations on Proximity Problems in Colored Point Sets, (1996).

  22. A Rema, Studies on Some Path Planning Problems in Static and Dyanmic Domains, (1994).

  23. V. Balachandhran, Efficient Algorithms for Domination and Path Problems on Some Special Classes of Graphs, (1994).

  24. Saptarshi Mahesh, Efficient Dynamic Job Scheduling Algorithms for Multiprocessor Systems, (1994). [Co-guide: Dr. C. Siva Ram Murthy].

  25. V. K. Anuradha, Efficient Algorithms on Some Special Classes of Graphs, (1994).

  26. Velmurugan, Algorithms for Some Problems in Path Planning, (1994).

  27. Vanisri, On Some Problems in Isothetic Computaional Geometry, (1993).

  28. Vinodchandran, New Characterisations of Some Counting Classes, (1993).

  29. A. Raman, Studies on Algorithmic Aspects of Special Classes of Perfect Graphs, (1993).

  30. K. Karunakaran, Efficient Systolic Graphs Algorithms, (1992).

  31. V. Kamakoti, Algorithmic Aspects of Permutation Graphs, (1992).

  32. G. Srikrishna, Efficient Sequential and Parallel Algorithms for Path Problems on Planar Graphs, (1992).

  33. M V Nagendra Prasad, Two Variations of L-systems, (1990).

  34. A. Srinivasa Rao, Efficient Sequential and Parallel Algorithms on Interval Graphs, (1989).

  35. Anindya Das, Terminal Weighted Grammars and Picture Description, (1985).

  36. Usha Menon, Single Successor Context-free Graph Grammar and Application to Flowchart Compilation, (1984).

  37. K. Balasubramanian, Design of a Programming Language for Distributed Processing, (1984).

  38. Aparna R, Studies in Context free Graph Grammars and Matrix Languages, (1981).

Page Designed by E. Boopal. Copyright Reserved @ 2008