Sunil K S | Hi, I am Sunil. Currently doing PhD in the department of Computer Science and Engineering at IIT Madras. |
Research Interests | Formal Languages, Automata Theory, Computational Complexity | |
Education | - Doctor of Philosophy. January 2012 - July 2017
- University: IIT Madras, Chennai, India.
- Master of Technology in Computer Science & Engg. August 2009 - May 2011
- University: IIT Madras, Chennai, India.
- Bachelor of Technology in Computer Science & Engg. July 2002 - Jun 2006
- University: Mahatma Ganghi University, Kottayam India.
| |
Professional Experience | - Asst.Professor
- Amal Jyothi College of Engineering, Kanjirappally, Kerala, India. Feb 2007 - Aug 2009 and May 2011 - Dec 2011
- Mangalam College of Engineering, Ettumanoor, Kerala, India. July 2006 - Feb 2007
| |
|
Achievements |
- Qualified UGC NET (Computer Science and Applications) in 2014
- Qualified GATE (Computer Science) in 2009
- Best Faculty award from Amal Jyothi College of Engg., Kanjirappally in 2009
- Best Faculty in the department of Computer Science & Engg., Amal Jyothi College of Engg., Kanjirappally in 2008
|
|
Publications |
- Journal Publications
-
Balagopal Komarath, Jayalal Sarma, and K. S. Sunil.
On the complexity of L-reachability.
Fundamenta Informaticae, 145(4),
471-483, (2016).
- International Conferences
- Vidhya Ramaswamy, Jayalal Sarma, and K. S. Sunil.
Complexity of Reachability Testing in Labelled Graphs.
11th International Conference on Language and Automata Theory and Applications, LATA 2017, Umea, Sweden, March 6-9, 2017} Proceedings,
Page: 351-363.
- Balagopal Komarath, Jayalal Sarma and K.S. Sunil. Comparator Circuits over Finite Bounded Posets
The 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) July 6-10, 2015. Kyoto, Japan.
- Balagopal Komarath, Jayalal Sarma and K.S. Sunil. On the Complexity of L-reachability.
16th International Workshop on Descriptional Complexity of Formal Systems-2014. August 5-8, 2014. Turku, Finland.
- K.S. Sunil and Kamala Krithivasan. Tree Insertion Systems.
Foundations of Computer Science-2011. Las Vegas, USA. pages:165-171
| |