Dr. P. Abisha Jeyanthi

  • PDF

abhishe_jayanthiEducation

Ph.D., Mathematics, University of Madras (1997) Thesis:
Public Key Cryptosystems and Language Theory.
M.Phil., Mathematics, University of Madras (1984)
M.Sc., Mathematics, University of Madras (1983)


Brief Profile

P. Abisha Jeyanthi has been on the teaching faculty of the Department of Mathematics since 1987. She received the Ph.D. Degree from University of Madras in 1997. Se has authored or co-authored research papers in the field of Cryptography, Thue Systems, Picture Languages and Grammar systems.


Area of Research Interest

Cryptography

Rewriting systems – Thue systems, Monoids

Grammar systems

Picture Languages


Projects Undertaken

Co-investigator in the project entitled Public Key Cryptosystem and Language Theory sponsored by the National Board in Higher Mathematics, Department of Atomic Energy from 1994 to 1997. Project No. 48/4/94 – G. (Principal Investigator: K.G. Subramanian)


Research Publications

  • Thue Like Systems(with D.G. Thomas and R. Siromoney) Technical Report(1985), Department of Mathematics, Madras Christian College.
  • Public key Cryptosystems based on Word Problems(with R. Siromoney, Do Long Van and K.G. Subramanian). Technical Report 17 (1987), Department of Mathematics , Madras Christian College.
  • A DOL/TOL Public Key Cryptosystems (with K.G. Subramanian and R. Siromoney) Information Processing Letters, 26 (1987/88), 95 – 97.
  • Cryptosystems for Picture Languages (with R. Siromoney and K.G. Subramanian) Syntactic and Structural Pattern Recognition, Eds. G. Ferrate, T. Palvidis, A. Sanfeliu and H. Bunke, NATO ASI Series, Springer-Verlag, Berlin, 1988, 315 – 332.
  • Generalized Parikh Vector and Public Key Cryptosystems (with G. Siromoney, R. Siromoney and K.G. Subramanian) A perspective in Theoretical Computer Science – Commemorative Volume for Gift Siromoney, Ed. R. Narasimhan, World Scientific, 1989, 301 – 323.
  • Encryption – Decryption Techniques for Pictures (with R. Siromoney and K.G. Subramanian) International Journal of Pattern Recognition and Artificial Intelligence, Vol. 3, No. 3 & 4, 1989, 497 – 503.
  • On Public Key Cryptosystems based on Language Theory(with R. Siromoney, K.G. Subramanian and V.R. Dare) College Magazine, Research Volume – 1, Volume LVIII, Madras Christian College, Chennai 600 059, 45 – 49.
  • Array Codes and Cryptosystems (with K.G. Subramanian, D.G. Thomas and Do Long Van) Proceedings of the Sixth International Workshop on Parallel Image Processing and Analysis, 1999, 291 – 302.
  • Pure Pattern Grammars (with K.G. Subramanian and D.G. Thomas) Proceedings of the International Conference on Grammar Systems, 2000, Austria, 253 – 262.
  • Tree Replacement and Public Key Cryptosystem (with S.C. Samuel, D.G. Thomas and K.G. Subramanian) INDOCRYPT 2002, LNCS 2551, 2002, 71 – 79.
  • Line Languages (with K. Sasikala, T. Kalyani , V.R. Dare) Electronic Notes in Discrete Mathematics, Vol. 12, 2003
  • Public Key Cryptosystems based on Free Partially Commutative Monoids and Groups(with D.G. Thomas and K.G. Subramanian) INDOCRYPT 2003, LNCS 2904, 2003, 218 – 227.
  • Subword Complexity of Partial Words (with K. Sasikala, T. Kalyani and V.R. Dare) Proc. of the second National Conference on Mathematical and Computational Models, Allied Publishers, 2003, 253 – 259.
  • Special factors of Partial words and trapezoidal words (with K. Sasikala and V.R. Dare) National Conference in Graphs, Combinatorics, Algorithms and Applications (S. Arumugam, B.D. Acharya and S. B. Rao), Narosa Publishing House, 2005, 135 – 144.
  • Learning Line Languages using Positive Data (with K. Sasikala, D.G. Thomas, V.R. Dare) Computational Mathematics (K. Thangavel and Balasubramaniam), Narosa Publishing House, 2005, 153 – 157.
  • Subarray Complexity of finite arrays(with V.R. Dare and T. Kalyani) National Conference in Graphs, Combinatorics, Algorithms and Applications (S. Arumugam, B. D. Acharya and S. B. Rao), Narosa Publications, 2005, 71–78.
  • Stochastic table hexagonal arrays (with D. G. Thomas and S. C. Samuel) Computational Mathematics (K. Thangavel and Balasubramaniam), Narosa Publishing House, 2005, 221 – 224.
  • Computing all repeats of a partial word using suffix tree and valency tree (with K. Sasikala, V.R. Dare and D.G. Thomas) In ‘Discrete Mathematics and Its Applications”, (M. Sethumadhavan) Narosa Publishing House, 2006, 220 – 222.
  • Arrays and Special Subarrays (with T. Kalyani and V.R. Dare) Discrete Mathematics and Its Applications, (M. Sethumadhavan) Narosa Publishing House, 2006, 175 – 183.
  • Hexagonal array replacement and public key cryptosystems (with S.C. Samuel and D.G. Thomas) Discrete Mathematics and Its Applications”, (M. Sethumadhavan) Narosa Publishing House, 2006, 115 – 119.
  • Triangular Pasting Systems (with T. Kalyani, K. Sasikala, V.R. Dare and T. Robinson) Formal Models, Languages and Applications, World Scientific MPAI series, 2006, 196 – 212.
  • Pattern Generation and Stochastic Table Hexagonal Grammars, (With D.G. Thomas and S.C. Samuel) Proceedings of the 3rd Indian International Conference on Artificial Intelligence (IICAI 2007), Pune, India, December 2007.

 Contacts

E-Mail: pjabisha@yahoo.com

 

 

You are here: Departments Aided Stream Mathematics